./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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/pthread/queue_ok_longest.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 12:34:21,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 12:34:21,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 12:34:21,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 12:34:21,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 12:34:21,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 12:34:21,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 12:34:21,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 12:34:21,902 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 12:34:21,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 12:34:21,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 12:34:21,904 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 12:34:21,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 12:34:21,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 12:34:21,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 12:34:21,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 12:34:21,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 12:34:21,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 12:34:21,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 12:34:21,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 12:34:21,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 12:34:21,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 12:34:21,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 12:34:21,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 12:34:21,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 12:34:21,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 12:34:21,935 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 12:34:21,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 12:34:21,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 12:34:21,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 12:34:21,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 12:34:21,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 12:34:21,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 12:34:21,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 12:34:21,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 12:34:21,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 12:34:21,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 12:34:21,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 12:34:21,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 12:34:21,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 12:34:21,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 12:34:21,945 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-08-30 12:34:21,980 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 12:34:21,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 12:34:21,981 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 12:34:21,982 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 12:34:21,982 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 12:34:21,983 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 12:34:21,983 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 12:34:21,983 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 12:34:21,984 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 12:34:21,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 12:34:21,985 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 12:34:21,985 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 12:34:21,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 12:34:21,985 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 12:34:21,985 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 12:34:21,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 12:34:21,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 12:34:21,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 12:34:21,986 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-08-30 12:34:21,986 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 12:34:21,986 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 12:34:21,987 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 12:34:21,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 12:34:21,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 12:34:21,987 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 12:34:21,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 12:34:21,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 12:34:21,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 12:34:21,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 12:34:21,988 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 12:34:21,988 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 12:34:21,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 12:34:21,989 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 12:34:21,989 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 12:34:21,989 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 12:34:21,989 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 12:34:21,990 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 12:34:21,990 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 ! overflow) ) 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 -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d 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 -> TOGETHER [2023-08-30 12:34:22,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 12:34:22,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 12:34:22,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 12:34:22,294 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 12:34:22,295 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 12:34:22,296 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-08-30 12:34:23,526 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 12:34:23,806 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 12:34:23,807 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-08-30 12:34:23,828 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/194b4fde4/ab524541b6c4413e94a9f0102a0e2130/FLAGbad6c4c8e [2023-08-30 12:34:23,841 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/194b4fde4/ab524541b6c4413e94a9f0102a0e2130 [2023-08-30 12:34:23,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 12:34:23,845 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 12:34:23,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 12:34:23,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 12:34:23,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 12:34:23,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 12:34:23" (1/1) ... [2023-08-30 12:34:23,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e6f7543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:23, skipping insertion in model container [2023-08-30 12:34:23,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 12:34:23" (1/1) ... [2023-08-30 12:34:23,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 12:34:23,905 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 12:34:24,346 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43280,43293] [2023-08-30 12:34:24,351 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43553,43566] [2023-08-30 12:34:24,355 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 12:34:24,366 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 12:34:24,424 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43280,43293] [2023-08-30 12:34:24,430 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43553,43566] [2023-08-30 12:34:24,449 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 12:34:24,510 INFO L208 MainTranslator]: Completed translation [2023-08-30 12:34:24,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:24 WrapperNode [2023-08-30 12:34:24,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 12:34:24,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 12:34:24,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 12:34:24,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 12:34:24,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:24" (1/1) ... [2023-08-30 12:34:24,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:24" (1/1) ... [2023-08-30 12:34:24,573 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 215 [2023-08-30 12:34:24,573 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 12:34:24,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 12:34:24,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 12:34:24,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 12:34:24,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:24" (1/1) ... [2023-08-30 12:34:24,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:24" (1/1) ... [2023-08-30 12:34:24,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:24" (1/1) ... [2023-08-30 12:34:24,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:24" (1/1) ... [2023-08-30 12:34:24,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:24" (1/1) ... [2023-08-30 12:34:24,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:24" (1/1) ... [2023-08-30 12:34:24,611 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:24" (1/1) ... [2023-08-30 12:34:24,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:24" (1/1) ... [2023-08-30 12:34:24,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 12:34:24,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 12:34:24,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 12:34:24,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 12:34:24,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:24" (1/1) ... [2023-08-30 12:34:24,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 12:34:24,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:34:24,647 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 12:34:24,672 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 12:34:24,688 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-30 12:34:24,688 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-30 12:34:24,688 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-30 12:34:24,689 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-30 12:34:24,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 12:34:24,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 12:34:24,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 12:34:24,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 12:34:24,689 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 12:34:24,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 12:34:24,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 12:34:24,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 12:34:24,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 12:34:24,691 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 12:34:24,873 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 12:34:24,875 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 12:34:25,261 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 12:34:25,274 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 12:34:25,276 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-30 12:34:25,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 12:34:25 BoogieIcfgContainer [2023-08-30 12:34:25,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 12:34:25,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 12:34:25,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 12:34:25,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 12:34:25,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 12:34:23" (1/3) ... [2023-08-30 12:34:25,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f64b9eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 12:34:25, skipping insertion in model container [2023-08-30 12:34:25,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 12:34:24" (2/3) ... [2023-08-30 12:34:25,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f64b9eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 12:34:25, skipping insertion in model container [2023-08-30 12:34:25,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 12:34:25" (3/3) ... [2023-08-30 12:34:25,291 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2023-08-30 12:34:25,298 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 12:34:25,307 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 12:34:25,307 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-08-30 12:34:25,308 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 12:34:25,398 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-30 12:34:25,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 238 transitions, 492 flow [2023-08-30 12:34:25,513 INFO L130 PetriNetUnfolder]: 13/236 cut-off events. [2023-08-30 12:34:25,514 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 12:34:25,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 236 events. 13/236 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 446 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 164. Up to 3 conditions per place. [2023-08-30 12:34:25,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 238 transitions, 492 flow [2023-08-30 12:34:25,528 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 221 places, 227 transitions, 463 flow [2023-08-30 12:34:25,531 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 12:34:25,538 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 227 transitions, 463 flow [2023-08-30 12:34:25,541 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 227 transitions, 463 flow [2023-08-30 12:34:25,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 227 transitions, 463 flow [2023-08-30 12:34:25,597 INFO L130 PetriNetUnfolder]: 13/227 cut-off events. [2023-08-30 12:34:25,597 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 12:34:25,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 227 events. 13/227 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 367 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 164. Up to 3 conditions per place. [2023-08-30 12:34:25,610 INFO L119 LiptonReduction]: Number of co-enabled transitions 13612 [2023-08-30 12:34:33,406 INFO L134 LiptonReduction]: Checked pairs total: 27777 [2023-08-30 12:34:33,407 INFO L136 LiptonReduction]: Total number of compositions: 211 [2023-08-30 12:34:33,429 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 12:34:33,433 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;@72f6f1cf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 12:34:33,433 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-08-30 12:34:33,437 INFO L130 PetriNetUnfolder]: 1/17 cut-off events. [2023-08-30 12:34:33,438 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 12:34:33,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:33,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:33,439 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:33,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:33,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1508825301, now seen corresponding path program 1 times [2023-08-30 12:34:33,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:33,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451651405] [2023-08-30 12:34:33,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:33,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:34,713 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 12:34:34,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:34,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451651405] [2023-08-30 12:34:34,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451651405] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:34,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:34,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 12:34:34,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351493344] [2023-08-30 12:34:34,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:34,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 12:34:34,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:34,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 12:34:34,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 12:34:35,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 449 [2023-08-30 12:34:35,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 213.4) internal successors, (1067), 5 states have internal predecessors, (1067), 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 12:34:35,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:35,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 449 [2023-08-30 12:34:35,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:35,757 INFO L130 PetriNetUnfolder]: 1447/2384 cut-off events. [2023-08-30 12:34:35,757 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2023-08-30 12:34:35,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4770 conditions, 2384 events. 1447/2384 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11890 event pairs, 1050 based on Foata normal form. 0/1699 useless extension candidates. Maximal degree in co-relation 4563. Up to 2313 conditions per place. [2023-08-30 12:34:35,770 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 53 selfloop transitions, 9 changer transitions 0/69 dead transitions. [2023-08-30 12:34:35,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 69 transitions, 271 flow [2023-08-30 12:34:35,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 12:34:35,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 12:34:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1336 transitions. [2023-08-30 12:34:35,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.495916852264291 [2023-08-30 12:34:35,790 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1336 transitions. [2023-08-30 12:34:35,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1336 transitions. [2023-08-30 12:34:35,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:35,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1336 transitions. [2023-08-30 12:34:35,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 222.66666666666666) internal successors, (1336), 6 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 12:34:35,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 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 12:34:35,823 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 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 12:34:35,825 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 123 flow. Second operand 6 states and 1336 transitions. [2023-08-30 12:34:35,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 69 transitions, 271 flow [2023-08-30 12:34:35,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 12:34:35,830 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 178 flow [2023-08-30 12:34:35,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2023-08-30 12:34:35,835 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2023-08-30 12:34:35,835 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 178 flow [2023-08-30 12:34:35,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 213.4) internal successors, (1067), 5 states have internal predecessors, (1067), 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 12:34:35,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:35,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:35,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 12:34:35,837 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:35,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:35,837 INFO L85 PathProgramCache]: Analyzing trace with hash -471342727, now seen corresponding path program 1 times [2023-08-30 12:34:35,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:35,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870043355] [2023-08-30 12:34:35,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:35,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:36,649 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 12:34:36,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:36,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870043355] [2023-08-30 12:34:36,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870043355] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:36,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:36,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 12:34:36,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547724280] [2023-08-30 12:34:36,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:36,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 12:34:36,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:36,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 12:34:36,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 12:34:37,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 449 [2023-08-30 12:34:37,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 210.33333333333334) internal successors, (1262), 6 states have internal predecessors, (1262), 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 12:34:37,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:37,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 449 [2023-08-30 12:34:37,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:37,978 INFO L130 PetriNetUnfolder]: 1909/3185 cut-off events. [2023-08-30 12:34:37,979 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2023-08-30 12:34:37,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6756 conditions, 3185 events. 1909/3185 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 17548 event pairs, 356 based on Foata normal form. 0/2452 useless extension candidates. Maximal degree in co-relation 4972. Up to 2371 conditions per place. [2023-08-30 12:34:37,993 INFO L137 encePairwiseOnDemand]: 440/449 looper letters, 120 selfloop transitions, 17 changer transitions 0/144 dead transitions. [2023-08-30 12:34:37,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 144 transitions, 629 flow [2023-08-30 12:34:37,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 12:34:37,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 12:34:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1389 transitions. [2023-08-30 12:34:37,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155902004454342 [2023-08-30 12:34:37,997 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1389 transitions. [2023-08-30 12:34:37,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1389 transitions. [2023-08-30 12:34:38,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:38,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1389 transitions. [2023-08-30 12:34:38,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 231.5) internal successors, (1389), 6 states have internal predecessors, (1389), 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 12:34:38,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 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 12:34:38,009 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 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 12:34:38,009 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 178 flow. Second operand 6 states and 1389 transitions. [2023-08-30 12:34:38,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 144 transitions, 629 flow [2023-08-30 12:34:38,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 144 transitions, 629 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 12:34:38,020 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 272 flow [2023-08-30 12:34:38,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=71, PETRI_TRANSITIONS=74} [2023-08-30 12:34:38,021 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places. [2023-08-30 12:34:38,021 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 272 flow [2023-08-30 12:34:38,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 210.33333333333334) internal successors, (1262), 6 states have internal predecessors, (1262), 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 12:34:38,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:38,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:38,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 12:34:38,023 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:38,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:38,023 INFO L85 PathProgramCache]: Analyzing trace with hash -470766127, now seen corresponding path program 2 times [2023-08-30 12:34:38,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:38,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801405931] [2023-08-30 12:34:38,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:38,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:38,422 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 12:34:38,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:38,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801405931] [2023-08-30 12:34:38,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801405931] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:38,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:38,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 12:34:38,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201440275] [2023-08-30 12:34:38,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:38,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 12:34:38,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:38,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 12:34:38,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 12:34:38,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 449 [2023-08-30 12:34:38,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 272 flow. Second operand has 6 states, 6 states have (on average 211.33333333333334) internal successors, (1268), 6 states have internal predecessors, (1268), 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 12:34:38,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:38,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 449 [2023-08-30 12:34:38,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:39,088 INFO L130 PetriNetUnfolder]: 2048/3425 cut-off events. [2023-08-30 12:34:39,088 INFO L131 PetriNetUnfolder]: For 784/784 co-relation queries the response was YES. [2023-08-30 12:34:39,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8024 conditions, 3425 events. 2048/3425 cut-off events. For 784/784 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 19054 event pairs, 410 based on Foata normal form. 0/2660 useless extension candidates. Maximal degree in co-relation 6211. Up to 2404 conditions per place. [2023-08-30 12:34:39,108 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 109 selfloop transitions, 19 changer transitions 0/135 dead transitions. [2023-08-30 12:34:39,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 135 transitions, 678 flow [2023-08-30 12:34:39,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 12:34:39,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 12:34:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1167 transitions. [2023-08-30 12:34:39,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5198218262806236 [2023-08-30 12:34:39,112 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1167 transitions. [2023-08-30 12:34:39,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1167 transitions. [2023-08-30 12:34:39,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:39,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1167 transitions. [2023-08-30 12:34:39,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 233.4) internal successors, (1167), 5 states have internal predecessors, (1167), 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 12:34:39,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 449.0) internal successors, (2694), 6 states have internal predecessors, (2694), 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 12:34:39,138 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 449.0) internal successors, (2694), 6 states have internal predecessors, (2694), 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 12:34:39,138 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 272 flow. Second operand 5 states and 1167 transitions. [2023-08-30 12:34:39,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 135 transitions, 678 flow [2023-08-30 12:34:39,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 135 transitions, 658 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-08-30 12:34:39,152 INFO L231 Difference]: Finished difference. Result has 76 places, 81 transitions, 344 flow [2023-08-30 12:34:39,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=344, PETRI_PLACES=76, PETRI_TRANSITIONS=81} [2023-08-30 12:34:39,153 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2023-08-30 12:34:39,154 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 81 transitions, 344 flow [2023-08-30 12:34:39,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.33333333333334) internal successors, (1268), 6 states have internal predecessors, (1268), 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 12:34:39,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:39,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:39,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 12:34:39,155 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:39,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:39,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1218367487, now seen corresponding path program 1 times [2023-08-30 12:34:39,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:39,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534579836] [2023-08-30 12:34:39,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:39,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:39,219 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 12:34:39,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:39,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534579836] [2023-08-30 12:34:39,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534579836] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:39,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:39,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 12:34:39,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680875262] [2023-08-30 12:34:39,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:39,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 12:34:39,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:39,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 12:34:39,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 12:34:39,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 449 [2023-08-30 12:34:39,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 81 transitions, 344 flow. Second operand has 4 states, 4 states have (on average 221.25) internal successors, (885), 4 states have internal predecessors, (885), 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 12:34:39,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:39,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 449 [2023-08-30 12:34:39,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:39,845 INFO L130 PetriNetUnfolder]: 3360/5521 cut-off events. [2023-08-30 12:34:39,845 INFO L131 PetriNetUnfolder]: For 2431/2471 co-relation queries the response was YES. [2023-08-30 12:34:39,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13038 conditions, 5521 events. 3360/5521 cut-off events. For 2431/2471 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 33384 event pairs, 1505 based on Foata normal form. 40/4211 useless extension candidates. Maximal degree in co-relation 10283. Up to 3250 conditions per place. [2023-08-30 12:34:39,878 INFO L137 encePairwiseOnDemand]: 442/449 looper letters, 149 selfloop transitions, 4 changer transitions 0/163 dead transitions. [2023-08-30 12:34:39,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 163 transitions, 970 flow [2023-08-30 12:34:39,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 12:34:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 12:34:39,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 991 transitions. [2023-08-30 12:34:39,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5517817371937639 [2023-08-30 12:34:39,885 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 991 transitions. [2023-08-30 12:34:39,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 991 transitions. [2023-08-30 12:34:39,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:39,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 991 transitions. [2023-08-30 12:34:39,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 247.75) internal successors, (991), 4 states have internal predecessors, (991), 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 12:34:39,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 449.0) internal successors, (2245), 5 states have internal predecessors, (2245), 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 12:34:39,894 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 449.0) internal successors, (2245), 5 states have internal predecessors, (2245), 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 12:34:39,894 INFO L175 Difference]: Start difference. First operand has 76 places, 81 transitions, 344 flow. Second operand 4 states and 991 transitions. [2023-08-30 12:34:39,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 163 transitions, 970 flow [2023-08-30 12:34:39,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 163 transitions, 940 flow, removed 15 selfloop flow, removed 0 redundant places. [2023-08-30 12:34:39,903 INFO L231 Difference]: Finished difference. Result has 81 places, 84 transitions, 366 flow [2023-08-30 12:34:39,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=366, PETRI_PLACES=81, PETRI_TRANSITIONS=84} [2023-08-30 12:34:39,906 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2023-08-30 12:34:39,906 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 84 transitions, 366 flow [2023-08-30 12:34:39,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 221.25) internal successors, (885), 4 states have internal predecessors, (885), 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 12:34:39,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:39,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:39,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 12:34:39,907 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:39,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:39,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1711980127, now seen corresponding path program 1 times [2023-08-30 12:34:39,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:39,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040802368] [2023-08-30 12:34:39,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:39,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:40,514 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 12:34:40,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:40,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040802368] [2023-08-30 12:34:40,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040802368] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:40,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:40,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 12:34:40,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109708980] [2023-08-30 12:34:40,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:40,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 12:34:40,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:40,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 12:34:40,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 12:34:40,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 449 [2023-08-30 12:34:40,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 84 transitions, 366 flow. Second operand has 6 states, 6 states have (on average 213.66666666666666) internal successors, (1282), 6 states have internal predecessors, (1282), 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 12:34:40,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:40,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 449 [2023-08-30 12:34:40,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:41,868 INFO L130 PetriNetUnfolder]: 3845/6364 cut-off events. [2023-08-30 12:34:41,868 INFO L131 PetriNetUnfolder]: For 2574/2584 co-relation queries the response was YES. [2023-08-30 12:34:41,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15355 conditions, 6364 events. 3845/6364 cut-off events. For 2574/2584 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 38002 event pairs, 2036 based on Foata normal form. 0/5037 useless extension candidates. Maximal degree in co-relation 9951. Up to 5400 conditions per place. [2023-08-30 12:34:41,912 INFO L137 encePairwiseOnDemand]: 435/449 looper letters, 99 selfloop transitions, 19 changer transitions 0/125 dead transitions. [2023-08-30 12:34:41,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 125 transitions, 718 flow [2023-08-30 12:34:41,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 12:34:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 12:34:41,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1582 transitions. [2023-08-30 12:34:41,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5033407572383074 [2023-08-30 12:34:41,917 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1582 transitions. [2023-08-30 12:34:41,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1582 transitions. [2023-08-30 12:34:41,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:41,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1582 transitions. [2023-08-30 12:34:41,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 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 12:34:41,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 449.0) internal successors, (3592), 8 states have internal predecessors, (3592), 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 12:34:41,927 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 449.0) internal successors, (3592), 8 states have internal predecessors, (3592), 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 12:34:41,927 INFO L175 Difference]: Start difference. First operand has 81 places, 84 transitions, 366 flow. Second operand 7 states and 1582 transitions. [2023-08-30 12:34:41,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 125 transitions, 718 flow [2023-08-30 12:34:41,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 125 transitions, 714 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 12:34:41,937 INFO L231 Difference]: Finished difference. Result has 89 places, 92 transitions, 465 flow [2023-08-30 12:34:41,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=465, PETRI_PLACES=89, PETRI_TRANSITIONS=92} [2023-08-30 12:34:41,939 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places. [2023-08-30 12:34:41,940 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 92 transitions, 465 flow [2023-08-30 12:34:41,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 213.66666666666666) internal successors, (1282), 6 states have internal predecessors, (1282), 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 12:34:41,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:41,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:41,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 12:34:41,941 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:41,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:41,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1521891715, now seen corresponding path program 1 times [2023-08-30 12:34:41,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:41,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464193978] [2023-08-30 12:34:41,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:41,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:42,672 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 12:34:42,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:42,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464193978] [2023-08-30 12:34:42,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464193978] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:42,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:42,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 12:34:42,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91804004] [2023-08-30 12:34:42,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:42,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 12:34:42,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:42,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 12:34:42,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-30 12:34:43,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 449 [2023-08-30 12:34:43,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 92 transitions, 465 flow. Second operand has 7 states, 7 states have (on average 210.57142857142858) internal successors, (1474), 7 states have internal predecessors, (1474), 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 12:34:43,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:43,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 449 [2023-08-30 12:34:43,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:44,757 INFO L130 PetriNetUnfolder]: 5335/8653 cut-off events. [2023-08-30 12:34:44,758 INFO L131 PetriNetUnfolder]: For 3350/3382 co-relation queries the response was YES. [2023-08-30 12:34:44,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22979 conditions, 8653 events. 5335/8653 cut-off events. For 3350/3382 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 53337 event pairs, 1036 based on Foata normal form. 195/7266 useless extension candidates. Maximal degree in co-relation 20634. Up to 5366 conditions per place. [2023-08-30 12:34:44,810 INFO L137 encePairwiseOnDemand]: 435/449 looper letters, 184 selfloop transitions, 27 changer transitions 0/218 dead transitions. [2023-08-30 12:34:44,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 218 transitions, 1296 flow [2023-08-30 12:34:44,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 12:34:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 12:34:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1643 transitions. [2023-08-30 12:34:44,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227489659560929 [2023-08-30 12:34:44,816 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1643 transitions. [2023-08-30 12:34:44,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1643 transitions. [2023-08-30 12:34:44,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:44,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1643 transitions. [2023-08-30 12:34:44,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 234.71428571428572) internal successors, (1643), 7 states have internal predecessors, (1643), 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 12:34:44,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 449.0) internal successors, (3592), 8 states have internal predecessors, (3592), 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 12:34:44,826 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 449.0) internal successors, (3592), 8 states have internal predecessors, (3592), 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 12:34:44,826 INFO L175 Difference]: Start difference. First operand has 89 places, 92 transitions, 465 flow. Second operand 7 states and 1643 transitions. [2023-08-30 12:34:44,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 218 transitions, 1296 flow [2023-08-30 12:34:44,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 218 transitions, 1281 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 12:34:44,855 INFO L231 Difference]: Finished difference. Result has 94 places, 101 transitions, 603 flow [2023-08-30 12:34:44,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=603, PETRI_PLACES=94, PETRI_TRANSITIONS=101} [2023-08-30 12:34:44,859 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 37 predicate places. [2023-08-30 12:34:44,859 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 101 transitions, 603 flow [2023-08-30 12:34:44,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.57142857142858) internal successors, (1474), 7 states have internal predecessors, (1474), 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 12:34:44,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:44,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:44,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 12:34:44,861 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:44,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:44,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1524270299, now seen corresponding path program 2 times [2023-08-30 12:34:44,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:44,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102787273] [2023-08-30 12:34:44,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:44,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:45,618 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 12:34:45,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:45,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102787273] [2023-08-30 12:34:45,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102787273] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:45,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:45,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 12:34:45,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009865398] [2023-08-30 12:34:45,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:45,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 12:34:45,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:45,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 12:34:45,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 12:34:46,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 449 [2023-08-30 12:34:46,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 101 transitions, 603 flow. Second operand has 7 states, 7 states have (on average 211.57142857142858) internal successors, (1481), 7 states have internal predecessors, (1481), 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 12:34:46,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:46,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 449 [2023-08-30 12:34:46,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:47,169 INFO L130 PetriNetUnfolder]: 5577/9060 cut-off events. [2023-08-30 12:34:47,169 INFO L131 PetriNetUnfolder]: For 7400/7418 co-relation queries the response was YES. [2023-08-30 12:34:47,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26065 conditions, 9060 events. 5577/9060 cut-off events. For 7400/7418 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 56308 event pairs, 1904 based on Foata normal form. 141/7581 useless extension candidates. Maximal degree in co-relation 18924. Up to 6711 conditions per place. [2023-08-30 12:34:47,227 INFO L137 encePairwiseOnDemand]: 439/449 looper letters, 153 selfloop transitions, 23 changer transitions 0/183 dead transitions. [2023-08-30 12:34:47,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 183 transitions, 1204 flow [2023-08-30 12:34:47,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 12:34:47,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 12:34:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1398 transitions. [2023-08-30 12:34:47,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5189309576837416 [2023-08-30 12:34:47,232 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1398 transitions. [2023-08-30 12:34:47,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1398 transitions. [2023-08-30 12:34:47,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:47,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1398 transitions. [2023-08-30 12:34:47,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 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 12:34:47,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 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 12:34:47,240 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 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 12:34:47,240 INFO L175 Difference]: Start difference. First operand has 94 places, 101 transitions, 603 flow. Second operand 6 states and 1398 transitions. [2023-08-30 12:34:47,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 183 transitions, 1204 flow [2023-08-30 12:34:47,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 183 transitions, 1165 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-08-30 12:34:47,299 INFO L231 Difference]: Finished difference. Result has 95 places, 103 transitions, 648 flow [2023-08-30 12:34:47,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=648, PETRI_PLACES=95, PETRI_TRANSITIONS=103} [2023-08-30 12:34:47,299 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 38 predicate places. [2023-08-30 12:34:47,300 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 103 transitions, 648 flow [2023-08-30 12:34:47,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 211.57142857142858) internal successors, (1481), 7 states have internal predecessors, (1481), 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 12:34:47,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:47,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:47,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 12:34:47,301 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:47,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:47,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1531774647, now seen corresponding path program 3 times [2023-08-30 12:34:47,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:47,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878152129] [2023-08-30 12:34:47,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:47,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:47,902 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 12:34:47,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:47,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878152129] [2023-08-30 12:34:47,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878152129] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:47,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:47,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 12:34:47,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628904918] [2023-08-30 12:34:47,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:47,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 12:34:47,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:47,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 12:34:47,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 12:34:48,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 449 [2023-08-30 12:34:48,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 103 transitions, 648 flow. Second operand has 7 states, 7 states have (on average 210.57142857142858) internal successors, (1474), 7 states have internal predecessors, (1474), 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 12:34:48,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:48,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 449 [2023-08-30 12:34:48,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:49,417 INFO L130 PetriNetUnfolder]: 6471/10435 cut-off events. [2023-08-30 12:34:49,418 INFO L131 PetriNetUnfolder]: For 10856/10894 co-relation queries the response was YES. [2023-08-30 12:34:49,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31089 conditions, 10435 events. 6471/10435 cut-off events. For 10856/10894 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 63561 event pairs, 1216 based on Foata normal form. 141/8570 useless extension candidates. Maximal degree in co-relation 23328. Up to 6497 conditions per place. [2023-08-30 12:34:49,476 INFO L137 encePairwiseOnDemand]: 434/449 looper letters, 177 selfloop transitions, 38 changer transitions 0/222 dead transitions. [2023-08-30 12:34:49,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 222 transitions, 1493 flow [2023-08-30 12:34:49,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 12:34:49,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 12:34:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1631 transitions. [2023-08-30 12:34:49,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5189309576837416 [2023-08-30 12:34:49,482 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1631 transitions. [2023-08-30 12:34:49,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1631 transitions. [2023-08-30 12:34:49,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:49,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1631 transitions. [2023-08-30 12:34:49,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 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 12:34:49,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 449.0) internal successors, (3592), 8 states have internal predecessors, (3592), 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 12:34:49,492 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 449.0) internal successors, (3592), 8 states have internal predecessors, (3592), 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 12:34:49,492 INFO L175 Difference]: Start difference. First operand has 95 places, 103 transitions, 648 flow. Second operand 7 states and 1631 transitions. [2023-08-30 12:34:49,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 222 transitions, 1493 flow [2023-08-30 12:34:49,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 222 transitions, 1453 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-30 12:34:49,575 INFO L231 Difference]: Finished difference. Result has 102 places, 116 transitions, 873 flow [2023-08-30 12:34:49,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=873, PETRI_PLACES=102, PETRI_TRANSITIONS=116} [2023-08-30 12:34:49,576 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 45 predicate places. [2023-08-30 12:34:49,577 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 116 transitions, 873 flow [2023-08-30 12:34:49,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.57142857142858) internal successors, (1474), 7 states have internal predecessors, (1474), 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 12:34:49,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:49,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:49,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 12:34:49,590 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:49,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:49,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1674976288, now seen corresponding path program 1 times [2023-08-30 12:34:49,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:49,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133556150] [2023-08-30 12:34:49,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:49,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:49,660 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 12:34:49,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:49,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133556150] [2023-08-30 12:34:49,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133556150] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:49,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:49,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 12:34:49,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599481037] [2023-08-30 12:34:49,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:49,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 12:34:49,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:49,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 12:34:49,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 12:34:49,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-08-30 12:34:49,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 116 transitions, 873 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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 12:34:49,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:49,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-08-30 12:34:49,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:49,843 INFO L130 PetriNetUnfolder]: 823/1615 cut-off events. [2023-08-30 12:34:49,844 INFO L131 PetriNetUnfolder]: For 1531/1531 co-relation queries the response was YES. [2023-08-30 12:34:49,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4512 conditions, 1615 events. 823/1615 cut-off events. For 1531/1531 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 9227 event pairs, 501 based on Foata normal form. 82/1510 useless extension candidates. Maximal degree in co-relation 3437. Up to 761 conditions per place. [2023-08-30 12:34:49,853 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 87 selfloop transitions, 2 changer transitions 6/104 dead transitions. [2023-08-30 12:34:49,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 104 transitions, 850 flow [2023-08-30 12:34:49,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 12:34:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 12:34:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2023-08-30 12:34:49,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5382331106161841 [2023-08-30 12:34:49,856 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 725 transitions. [2023-08-30 12:34:49,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 725 transitions. [2023-08-30 12:34:49,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:49,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 725 transitions. [2023-08-30 12:34:49,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 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 12:34:49,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 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 12:34:49,860 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 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 12:34:49,860 INFO L175 Difference]: Start difference. First operand has 102 places, 116 transitions, 873 flow. Second operand 3 states and 725 transitions. [2023-08-30 12:34:49,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 104 transitions, 850 flow [2023-08-30 12:34:49,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 104 transitions, 811 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-30 12:34:49,869 INFO L231 Difference]: Finished difference. Result has 102 places, 93 transitions, 597 flow [2023-08-30 12:34:49,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=597, PETRI_PLACES=102, PETRI_TRANSITIONS=93} [2023-08-30 12:34:49,871 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 45 predicate places. [2023-08-30 12:34:49,871 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 93 transitions, 597 flow [2023-08-30 12:34:49,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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 12:34:49,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:49,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:49,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 12:34:49,873 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:49,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:49,874 INFO L85 PathProgramCache]: Analyzing trace with hash 902890166, now seen corresponding path program 1 times [2023-08-30 12:34:49,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:49,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331750648] [2023-08-30 12:34:49,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:49,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:49,909 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 12:34:49,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:49,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331750648] [2023-08-30 12:34:49,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331750648] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:34:49,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:34:49,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 12:34:49,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490004583] [2023-08-30 12:34:49,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:34:49,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 12:34:49,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:49,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 12:34:49,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 12:34:49,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 449 [2023-08-30 12:34:49,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 93 transitions, 597 flow. Second operand has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 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 12:34:49,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:49,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 449 [2023-08-30 12:34:49,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:34:50,076 INFO L130 PetriNetUnfolder]: 624/1238 cut-off events. [2023-08-30 12:34:50,076 INFO L131 PetriNetUnfolder]: For 1141/1141 co-relation queries the response was YES. [2023-08-30 12:34:50,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3539 conditions, 1238 events. 624/1238 cut-off events. For 1141/1141 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 6313 event pairs, 434 based on Foata normal form. 8/1104 useless extension candidates. Maximal degree in co-relation 2950. Up to 879 conditions per place. [2023-08-30 12:34:50,084 INFO L137 encePairwiseOnDemand]: 444/449 looper letters, 85 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2023-08-30 12:34:50,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 99 transitions, 784 flow [2023-08-30 12:34:50,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 12:34:50,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 12:34:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 732 transitions. [2023-08-30 12:34:50,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5434298440979956 [2023-08-30 12:34:50,087 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 732 transitions. [2023-08-30 12:34:50,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 732 transitions. [2023-08-30 12:34:50,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:34:50,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 732 transitions. [2023-08-30 12:34:50,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 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 12:34:50,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 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 12:34:50,091 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 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 12:34:50,091 INFO L175 Difference]: Start difference. First operand has 102 places, 93 transitions, 597 flow. Second operand 3 states and 732 transitions. [2023-08-30 12:34:50,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 99 transitions, 784 flow [2023-08-30 12:34:50,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 99 transitions, 774 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 12:34:50,100 INFO L231 Difference]: Finished difference. Result has 102 places, 92 transitions, 601 flow [2023-08-30 12:34:50,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=102, PETRI_TRANSITIONS=92} [2023-08-30 12:34:50,102 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 45 predicate places. [2023-08-30 12:34:50,102 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 92 transitions, 601 flow [2023-08-30 12:34:50,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 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 12:34:50,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:34:50,103 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:34:50,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 12:34:50,103 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:34:50,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:34:50,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1852895279, now seen corresponding path program 1 times [2023-08-30 12:34:50,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:34:50,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884682759] [2023-08-30 12:34:50,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:50,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:34:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:50,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:34:50,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884682759] [2023-08-30 12:34:50,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884682759] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:34:50,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816959803] [2023-08-30 12:34:50,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:34:50,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:34:50,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:34:50,531 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 12:34:50,535 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 12:34:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:34:50,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 67 conjunts are in the unsatisfiable core [2023-08-30 12:34:50,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:34:50,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:34:50,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:34:50,822 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 12:34:50,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-30 12:34:50,846 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 12:34:50,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 12:34:50,977 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 36 treesize of output 29 [2023-08-30 12:34:51,159 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 32 treesize of output 27 [2023-08-30 12:34:51,347 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 44 treesize of output 37 [2023-08-30 12:34:51,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:34:51,415 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 33 treesize of output 35 [2023-08-30 12:34:51,533 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 47 treesize of output 40 [2023-08-30 12:34:51,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:34:51,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:34:54,338 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_408 Int) (v_ArrVal_406 Int) (v_ArrVal_410 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_406) .cse1 v_ArrVal_408)) |c_~#stored_elements~0.base| v_ArrVal_410) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_408) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< v_ArrVal_406 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) (< 0 (+ 2147483650 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_411) (+ 3208 |c_~#queue~0.offset|)))))))) is different from false [2023-08-30 12:34:54,371 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_408 Int) (v_ArrVal_406 Int) (v_ArrVal_410 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_406) .cse1 v_ArrVal_408)) |c_~#stored_elements~0.base| v_ArrVal_410) |c_~#queue~0.base|))) (or (< (+ v_ArrVal_406 2147483648) 0) (< (+ (select .cse0 .cse1) 1) v_ArrVal_408) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< 0 (+ 2147483650 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_411) (+ 3208 |c_~#queue~0.offset|)))))))) is different from false [2023-08-30 12:34:54,422 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_408 Int) (v_ArrVal_406 Int) (v_ArrVal_405 Int) (v_ArrVal_410 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_405)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_406) .cse2 v_ArrVal_408)) |c_~#stored_elements~0.base| v_ArrVal_410) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_411) (+ 3208 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_406 2147483648) 0) (< (+ 1 (select .cse1 .cse2)) v_ArrVal_408) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|))))) is different from false [2023-08-30 12:34:55,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-30 12:34:55,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816959803] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:34:55,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:34:55,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2023-08-30 12:34:55,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804030118] [2023-08-30 12:34:55,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:34:55,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 12:34:55,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:34:55,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 12:34:55,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=517, Unknown=21, NotChecked=156, Total=870 [2023-08-30 12:34:55,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 449 [2023-08-30 12:34:55,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 92 transitions, 601 flow. Second operand has 30 states, 30 states have (on average 171.5) internal successors, (5145), 30 states have internal predecessors, (5145), 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 12:34:55,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:34:55,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 449 [2023-08-30 12:34:55,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:35:24,139 INFO L130 PetriNetUnfolder]: 1853/3636 cut-off events. [2023-08-30 12:35:24,139 INFO L131 PetriNetUnfolder]: For 2322/2322 co-relation queries the response was YES. [2023-08-30 12:35:24,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9650 conditions, 3636 events. 1853/3636 cut-off events. For 2322/2322 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 23120 event pairs, 712 based on Foata normal form. 16/3271 useless extension candidates. Maximal degree in co-relation 7524. Up to 863 conditions per place. [2023-08-30 12:35:24,159 INFO L137 encePairwiseOnDemand]: 425/449 looper letters, 219 selfloop transitions, 131 changer transitions 4/360 dead transitions. [2023-08-30 12:35:24,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 360 transitions, 2327 flow [2023-08-30 12:35:24,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-08-30 12:35:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-08-30 12:35:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 6958 transitions. [2023-08-30 12:35:24,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39735023699388955 [2023-08-30 12:35:24,178 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 6958 transitions. [2023-08-30 12:35:24,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 6958 transitions. [2023-08-30 12:35:24,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:35:24,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 6958 transitions. [2023-08-30 12:35:24,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 178.4102564102564) internal successors, (6958), 39 states have internal predecessors, (6958), 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 12:35:24,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 449.0) internal successors, (17960), 40 states have internal predecessors, (17960), 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 12:35:24,218 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 449.0) internal successors, (17960), 40 states have internal predecessors, (17960), 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 12:35:24,218 INFO L175 Difference]: Start difference. First operand has 102 places, 92 transitions, 601 flow. Second operand 39 states and 6958 transitions. [2023-08-30 12:35:24,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 360 transitions, 2327 flow [2023-08-30 12:35:24,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 360 transitions, 2316 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 12:35:24,234 INFO L231 Difference]: Finished difference. Result has 154 places, 200 transitions, 1542 flow [2023-08-30 12:35:24,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=1542, PETRI_PLACES=154, PETRI_TRANSITIONS=200} [2023-08-30 12:35:24,235 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 97 predicate places. [2023-08-30 12:35:24,235 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 200 transitions, 1542 flow [2023-08-30 12:35:24,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 171.5) internal successors, (5145), 30 states have internal predecessors, (5145), 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 12:35:24,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:35:24,237 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:35:24,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-30 12:35:24,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-30 12:35:24,444 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:35:24,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:35:24,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1450758440, now seen corresponding path program 1 times [2023-08-30 12:35:24,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:35:24,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282993858] [2023-08-30 12:35:24,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:35:24,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:35:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:35:25,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:35:25,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:35:25,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282993858] [2023-08-30 12:35:25,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282993858] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:35:25,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704338762] [2023-08-30 12:35:25,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:35:25,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:35:25,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:35:25,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 12:35:25,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-30 12:35:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:35:25,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 75 conjunts are in the unsatisfiable core [2023-08-30 12:35:25,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:35:25,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:35:25,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:35:25,484 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 12:35:25,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-30 12:35:25,501 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 12:35:25,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 12:35:25,623 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 36 treesize of output 29 [2023-08-30 12:35:25,744 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 41 treesize of output 34 [2023-08-30 12:35:25,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-30 12:35:25,963 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 44 treesize of output 37 [2023-08-30 12:35:26,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:35:26,024 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 33 treesize of output 35 [2023-08-30 12:35:26,153 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 47 treesize of output 40 [2023-08-30 12:35:26,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:35:26,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:35:26,840 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 Int) (v_ArrVal_513 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_514 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_511)) |c_~#stored_elements~0.base| v_ArrVal_513) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_514) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_511) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|)))) is different from false [2023-08-30 12:35:26,943 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 Int) (v_ArrVal_513 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_514 Int) (v_ArrVal_510 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_510))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_511)) |c_~#stored_elements~0.base| v_ArrVal_513) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_514) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_511)))))) is different from false [2023-08-30 12:35:26,983 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 Int) (v_ArrVal_513 (Array Int Int)) (v_ArrVal_508 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_514 Int) (v_ArrVal_510 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_508)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_510))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_511)) |c_~#stored_elements~0.base| v_ArrVal_513) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_514) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_508) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_511)))))) is different from false [2023-08-30 12:35:27,018 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 Int) (v_ArrVal_513 (Array Int Int)) (v_ArrVal_508 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_514 Int) (v_ArrVal_510 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_508)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_510))) (let ((.cse1 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_511)) |c_~#stored_elements~0.base| v_ArrVal_513) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_514) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_511) (< (+ (select .cse3 .cse4) 1) v_ArrVal_508))))))) is different from false [2023-08-30 12:35:27,054 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 Int) (v_ArrVal_513 (Array Int Int)) (v_ArrVal_508 Int) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_514 Int) (v_ArrVal_510 (Array Int Int))) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_507)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_508)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_510))) (let ((.cse1 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_511)) |c_~#stored_elements~0.base| v_ArrVal_513) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_514) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_511) (< (+ 1 (select .cse3 .cse4)) v_ArrVal_508) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|))))))) is different from false [2023-08-30 12:35:27,095 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 Int) (v_ArrVal_513 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_41| Int) (v_ArrVal_508 Int) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_514 Int) (v_ArrVal_510 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_41|) |c_~#queue~0.offset|) v_ArrVal_507)) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse5 v_ArrVal_508)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_510))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_511)) |c_~#stored_elements~0.base| v_ArrVal_513) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_511) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_41|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_508) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_514) .cse5) 2147483647)))))))) is different from false [2023-08-30 12:35:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-30 12:35:27,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704338762] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:35:27,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:35:27,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2023-08-30 12:35:27,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30577306] [2023-08-30 12:35:27,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:35:27,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-30 12:35:27,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:35:27,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-30 12:35:27,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=624, Unknown=16, NotChecked=366, Total=1260 [2023-08-30 12:35:27,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-08-30 12:35:27,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 200 transitions, 1542 flow. Second operand has 36 states, 36 states have (on average 168.33333333333334) internal successors, (6060), 36 states have internal predecessors, (6060), 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 12:35:27,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:35:27,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-08-30 12:35:27,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:35:29,329 INFO L130 PetriNetUnfolder]: 2228/4387 cut-off events. [2023-08-30 12:35:29,330 INFO L131 PetriNetUnfolder]: For 26773/26775 co-relation queries the response was YES. [2023-08-30 12:35:29,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20236 conditions, 4387 events. 2228/4387 cut-off events. For 26773/26775 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 29582 event pairs, 787 based on Foata normal form. 0/3991 useless extension candidates. Maximal degree in co-relation 19257. Up to 2915 conditions per place. [2023-08-30 12:35:29,364 INFO L137 encePairwiseOnDemand]: 437/449 looper letters, 220 selfloop transitions, 57 changer transitions 3/286 dead transitions. [2023-08-30 12:35:29,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 286 transitions, 2971 flow [2023-08-30 12:35:29,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 12:35:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 12:35:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2481 transitions. [2023-08-30 12:35:29,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39468660515431114 [2023-08-30 12:35:29,372 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2481 transitions. [2023-08-30 12:35:29,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2481 transitions. [2023-08-30 12:35:29,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:35:29,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2481 transitions. [2023-08-30 12:35:29,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 177.21428571428572) internal successors, (2481), 14 states have internal predecessors, (2481), 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 12:35:29,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 449.0) internal successors, (6735), 15 states have internal predecessors, (6735), 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 12:35:29,386 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 449.0) internal successors, (6735), 15 states have internal predecessors, (6735), 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 12:35:29,386 INFO L175 Difference]: Start difference. First operand has 154 places, 200 transitions, 1542 flow. Second operand 14 states and 2481 transitions. [2023-08-30 12:35:29,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 286 transitions, 2971 flow [2023-08-30 12:35:29,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 286 transitions, 2790 flow, removed 72 selfloop flow, removed 11 redundant places. [2023-08-30 12:35:29,422 INFO L231 Difference]: Finished difference. Result has 162 places, 214 transitions, 1651 flow [2023-08-30 12:35:29,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=1360, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1651, PETRI_PLACES=162, PETRI_TRANSITIONS=214} [2023-08-30 12:35:29,423 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 105 predicate places. [2023-08-30 12:35:29,423 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 214 transitions, 1651 flow [2023-08-30 12:35:29,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 168.33333333333334) internal successors, (6060), 36 states have internal predecessors, (6060), 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 12:35:29,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:35:29,426 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:35:29,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 12:35:29,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-30 12:35:29,632 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:35:29,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:35:29,632 INFO L85 PathProgramCache]: Analyzing trace with hash 444195113, now seen corresponding path program 1 times [2023-08-30 12:35:29,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:35:29,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663659486] [2023-08-30 12:35:29,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:35:29,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:35:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:35:30,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:35:30,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:35:30,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663659486] [2023-08-30 12:35:30,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663659486] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:35:30,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941038708] [2023-08-30 12:35:30,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:35:30,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:35:30,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:35:30,071 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 12:35:30,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-30 12:35:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:35:30,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 74 conjunts are in the unsatisfiable core [2023-08-30 12:35:30,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:35:30,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:35:30,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:35:30,214 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 12:35:30,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-30 12:35:30,229 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 12:35:30,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 12:35:30,316 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 36 treesize of output 29 [2023-08-30 12:35:30,400 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 32 treesize of output 27 [2023-08-30 12:35:30,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-30 12:35:30,576 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 44 treesize of output 37 [2023-08-30 12:35:30,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:35:30,635 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 33 treesize of output 35 [2023-08-30 12:35:30,744 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 47 treesize of output 40 [2023-08-30 12:35:30,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:35:30,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:35:30,878 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_616 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_617 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_616) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (< 0 (+ 2147483650 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_617) (+ 3208 |c_~#queue~0.offset|))))))) is different from false [2023-08-30 12:35:30,902 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_616 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_617 Int) (v_ArrVal_614 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_614)) |c_~#stored_elements~0.base| v_ArrVal_616) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_614) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (< 0 (+ 2147483650 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_617) (+ 3208 |c_~#queue~0.offset|))))))) is different from false [2023-08-30 12:35:30,921 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_616 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_617 Int) (v_ArrVal_614 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_614)) |c_~#stored_elements~0.base| v_ArrVal_616) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (< 0 (+ 2147483650 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_617) (+ 3208 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_614))))) is different from false [2023-08-30 12:35:30,945 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_616 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_617 Int) (v_ArrVal_614 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_613))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_614)) |c_~#stored_elements~0.base| v_ArrVal_616) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_614) (< 0 (+ 2147483650 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_617) (+ 3208 |c_~#queue~0.offset|))))))))) is different from false [2023-08-30 12:35:30,983 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_616 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_617 Int) (v_ArrVal_614 Int) (v_ArrVal_611 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_611)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_613))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_614)) |c_~#stored_elements~0.base| v_ArrVal_616) |c_~#queue~0.base|))) (or (< v_ArrVal_611 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (< (+ 1 (select .cse1 .cse2)) v_ArrVal_614) (< 0 (+ (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_617) (+ 3208 |c_~#queue~0.offset|)) 2147483650))))))) is different from false [2023-08-30 12:35:31,010 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_616 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_617 Int) (v_ArrVal_614 Int) (v_ArrVal_611 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_611)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_613))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_614)) |c_~#stored_elements~0.base| v_ArrVal_616) |c_~#queue~0.base|))) (or (< (+ v_ArrVal_611 2147483648) 0) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (< (+ 1 (select .cse1 .cse2)) v_ArrVal_614) (< 0 (+ (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_617) (+ 3208 |c_~#queue~0.offset|)) 2147483650))))))) is different from false [2023-08-30 12:35:31,043 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_616 (Array Int Int)) (v_ArrVal_609 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_617 Int) (v_ArrVal_614 Int) (v_ArrVal_611 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_609) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_611)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_613))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_614)) |c_~#stored_elements~0.base| v_ArrVal_616) |c_~#queue~0.base|))) (or (< (+ v_ArrVal_611 2147483648) 0) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_614) (< 0 (+ 2147483650 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_617) (+ 3208 |c_~#queue~0.offset|))))))))) is different from false [2023-08-30 12:35:31,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-30 12:35:31,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941038708] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:35:31,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:35:31,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 31 [2023-08-30 12:35:31,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548719313] [2023-08-30 12:35:31,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:35:31,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-30 12:35:31,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:35:31,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-30 12:35:31,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=480, Unknown=13, NotChecked=378, Total=1056 [2023-08-30 12:35:31,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 449 [2023-08-30 12:35:31,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 214 transitions, 1651 flow. Second operand has 33 states, 33 states have (on average 167.45454545454547) internal successors, (5526), 33 states have internal predecessors, (5526), 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 12:35:31,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:35:31,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 449 [2023-08-30 12:35:31,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:36:01,149 INFO L130 PetriNetUnfolder]: 3437/6783 cut-off events. [2023-08-30 12:36:01,150 INFO L131 PetriNetUnfolder]: For 43914/43914 co-relation queries the response was YES. [2023-08-30 12:36:01,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31322 conditions, 6783 events. 3437/6783 cut-off events. For 43914/43914 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 48086 event pairs, 1003 based on Foata normal form. 97/6322 useless extension candidates. Maximal degree in co-relation 30902. Up to 2052 conditions per place. [2023-08-30 12:36:01,201 INFO L137 encePairwiseOnDemand]: 429/449 looper letters, 284 selfloop transitions, 171 changer transitions 3/464 dead transitions. [2023-08-30 12:36:01,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 464 transitions, 4930 flow [2023-08-30 12:36:01,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-08-30 12:36:01,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-08-30 12:36:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 5617 transitions. [2023-08-30 12:36:01,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3909381959910913 [2023-08-30 12:36:01,209 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 5617 transitions. [2023-08-30 12:36:01,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 5617 transitions. [2023-08-30 12:36:01,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:36:01,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 5617 transitions. [2023-08-30 12:36:01,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 175.53125) internal successors, (5617), 32 states have internal predecessors, (5617), 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 12:36:01,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 449.0) internal successors, (14817), 33 states have internal predecessors, (14817), 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 12:36:01,231 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 449.0) internal successors, (14817), 33 states have internal predecessors, (14817), 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 12:36:01,232 INFO L175 Difference]: Start difference. First operand has 162 places, 214 transitions, 1651 flow. Second operand 32 states and 5617 transitions. [2023-08-30 12:36:01,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 464 transitions, 4930 flow [2023-08-30 12:36:01,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 464 transitions, 4839 flow, removed 20 selfloop flow, removed 8 redundant places. [2023-08-30 12:36:01,290 INFO L231 Difference]: Finished difference. Result has 197 places, 294 transitions, 3015 flow [2023-08-30 12:36:01,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=1550, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=3015, PETRI_PLACES=197, PETRI_TRANSITIONS=294} [2023-08-30 12:36:01,291 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 140 predicate places. [2023-08-30 12:36:01,291 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 294 transitions, 3015 flow [2023-08-30 12:36:01,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 167.45454545454547) internal successors, (5526), 33 states have internal predecessors, (5526), 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 12:36:01,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:36:01,293 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:36:01,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-30 12:36:01,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:36:01,499 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:36:01,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:36:01,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1605465588, now seen corresponding path program 2 times [2023-08-30 12:36:01,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:36:01,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441295519] [2023-08-30 12:36:01,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:36:01,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:36:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:36:02,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:36:02,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:36:02,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441295519] [2023-08-30 12:36:02,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441295519] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:36:02,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176849589] [2023-08-30 12:36:02,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 12:36:02,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:36:02,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:36:02,361 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 12:36:02,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-30 12:36:02,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 12:36:02,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 12:36:02,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 77 conjunts are in the unsatisfiable core [2023-08-30 12:36:02,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:36:02,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:36:02,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:36:02,539 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 12:36:02,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-30 12:36:02,555 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 12:36:02,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 12:36:02,666 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 36 treesize of output 29 [2023-08-30 12:36:02,755 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 41 treesize of output 34 [2023-08-30 12:36:02,904 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 44 treesize of output 37 [2023-08-30 12:36:02,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:36:02,972 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 33 treesize of output 35 [2023-08-30 12:36:03,038 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 33 treesize of output 35 [2023-08-30 12:36:03,177 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 47 treesize of output 40 [2023-08-30 12:36:03,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:36:03,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:36:03,394 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_720 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_718) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_719) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_720) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-30 12:36:03,599 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_720 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_717 Int) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_717)) |c_~#stored_elements~0.base| v_ArrVal_718) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_719) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_717) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_720) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-08-30 12:36:15,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:36:15,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176849589] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:36:15,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:36:15,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2023-08-30 12:36:15,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611853232] [2023-08-30 12:36:15,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:36:15,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-30 12:36:15,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:36:15,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-30 12:36:15,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=830, Unknown=30, NotChecked=130, Total=1260 [2023-08-30 12:36:15,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-08-30 12:36:15,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 294 transitions, 3015 flow. Second operand has 36 states, 36 states have (on average 168.33333333333334) internal successors, (6060), 36 states have internal predecessors, (6060), 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 12:36:15,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:36:15,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-08-30 12:36:15,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:36:27,117 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 [0, 1] [2023-08-30 12:36:29,179 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 [0, 1] [2023-08-30 12:36:31,206 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 [0, 1] [2023-08-30 12:36:33,215 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 [0, 1] [2023-08-30 12:36:44,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:36:46,290 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 12:36:48,297 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 12:36:50,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:36:51,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:36:53,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:36:55,549 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 12:36:58,150 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 12:37:00,756 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 12:37:02,768 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 [0, 1] [2023-08-30 12:37:05,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 12:37:07,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 12:37:12,732 INFO L130 PetriNetUnfolder]: 3879/7644 cut-off events. [2023-08-30 12:37:12,732 INFO L131 PetriNetUnfolder]: For 174312/174350 co-relation queries the response was YES. [2023-08-30 12:37:12,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51069 conditions, 7644 events. 3879/7644 cut-off events. For 174312/174350 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 55836 event pairs, 1503 based on Foata normal form. 28/7036 useless extension candidates. Maximal degree in co-relation 45886. Up to 4712 conditions per place. [2023-08-30 12:37:12,798 INFO L137 encePairwiseOnDemand]: 428/449 looper letters, 358 selfloop transitions, 119 changer transitions 3/486 dead transitions. [2023-08-30 12:37:12,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 486 transitions, 7230 flow [2023-08-30 12:37:12,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-30 12:37:12,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-30 12:37:12,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4760 transitions. [2023-08-30 12:37:12,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39264208529241934 [2023-08-30 12:37:12,805 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4760 transitions. [2023-08-30 12:37:12,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4760 transitions. [2023-08-30 12:37:12,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:37:12,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4760 transitions. [2023-08-30 12:37:12,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 176.2962962962963) internal successors, (4760), 27 states have internal predecessors, (4760), 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 12:37:12,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 449.0) internal successors, (12572), 28 states have internal predecessors, (12572), 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 12:37:12,820 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 449.0) internal successors, (12572), 28 states have internal predecessors, (12572), 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 12:37:12,820 INFO L175 Difference]: Start difference. First operand has 197 places, 294 transitions, 3015 flow. Second operand 27 states and 4760 transitions. [2023-08-30 12:37:12,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 486 transitions, 7230 flow [2023-08-30 12:37:12,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 486 transitions, 6583 flow, removed 286 selfloop flow, removed 12 redundant places. [2023-08-30 12:37:12,939 INFO L231 Difference]: Finished difference. Result has 220 places, 336 transitions, 3391 flow [2023-08-30 12:37:12,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=2486, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=3391, PETRI_PLACES=220, PETRI_TRANSITIONS=336} [2023-08-30 12:37:12,940 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 163 predicate places. [2023-08-30 12:37:12,940 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 336 transitions, 3391 flow [2023-08-30 12:37:12,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 168.33333333333334) internal successors, (6060), 36 states have internal predecessors, (6060), 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 12:37:12,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:37:12,941 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:37:12,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-30 12:37:13,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:37:13,147 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:37:13,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:37:13,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1605177288, now seen corresponding path program 3 times [2023-08-30 12:37:13,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:37:13,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523668428] [2023-08-30 12:37:13,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:37:13,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:37:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:37:14,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:37:14,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:37:14,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523668428] [2023-08-30 12:37:14,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523668428] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:37:14,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441302070] [2023-08-30 12:37:14,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 12:37:14,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:37:14,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:37:14,050 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 12:37:14,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-30 12:37:14,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 12:37:14,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 12:37:14,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 77 conjunts are in the unsatisfiable core [2023-08-30 12:37:14,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:37:14,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:37:14,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:37:14,251 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 12:37:14,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-30 12:37:14,268 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 12:37:14,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 12:37:14,377 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 36 treesize of output 29 [2023-08-30 12:37:14,498 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 41 treesize of output 34 [2023-08-30 12:37:14,655 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 44 treesize of output 37 [2023-08-30 12:37:14,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:37:14,724 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 33 treesize of output 35 [2023-08-30 12:37:14,826 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 47 treesize of output 40 [2023-08-30 12:37:14,963 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 38 treesize of output 40 [2023-08-30 12:37:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:37:15,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:37:15,106 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_824 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_824) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) is different from false [2023-08-30 12:37:15,154 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_824 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_822 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_822)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_824) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-30 12:37:15,164 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_824 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_822 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_822)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_824) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|))))) is different from false [2023-08-30 12:37:15,177 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_819 Int) (v_ArrVal_824 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_822 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_819)) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_822)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_824) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_819))))) is different from false [2023-08-30 12:37:15,193 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_819 Int) (v_ArrVal_824 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_822 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_819)) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_822)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_824) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_819)))))) is different from false [2023-08-30 12:37:15,231 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_819 Int) (v_ArrVal_824 (Array Int Int)) (v_ArrVal_817 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_822 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_817) .cse3 v_ArrVal_819)) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_822)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_824) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_819) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_817)))))) is different from false [2023-08-30 12:37:15,257 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_819 Int) (v_ArrVal_824 (Array Int Int)) (v_ArrVal_817 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_822 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_817) .cse4 v_ArrVal_819)) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_817) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_822)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_824) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse4) 1) v_ArrVal_819)))))) is different from false [2023-08-30 12:37:15,288 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_819 Int) (v_ArrVal_824 (Array Int Int)) (v_ArrVal_817 Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_822 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_816)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse4 v_ArrVal_817) .cse3 v_ArrVal_819)) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_822)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_824) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_819) (< (+ (select .cse2 .cse4) 1) v_ArrVal_817)))))) is different from false [2023-08-30 12:37:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-30 12:37:15,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441302070] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:37:15,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:37:15,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2023-08-30 12:37:15,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440910622] [2023-08-30 12:37:15,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:37:15,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-30 12:37:15,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:37:15,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-30 12:37:15,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=558, Unknown=10, NotChecked=472, Total=1260 [2023-08-30 12:37:15,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-08-30 12:37:15,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 336 transitions, 3391 flow. Second operand has 36 states, 36 states have (on average 168.33333333333334) internal successors, (6060), 36 states have internal predecessors, (6060), 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 12:37:15,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:37:15,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-08-30 12:37:15,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:37:25,291 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 [0, 1] [2023-08-30 12:37:25,356 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_819 Int) (v_ArrVal_824 (Array Int Int)) (v_ArrVal_817 Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int) (v_ArrVal_822 Int)) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_816))) (let ((.cse0 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_817) .cse4 v_ArrVal_819)) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_822)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_824) |c_~#queue~0.base|) .cse2) 2147483647) (< (+ (select .cse3 .cse2) 1) v_ArrVal_817) (< (+ (select .cse3 .cse4) 1) v_ArrVal_819) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (< (select .cse1 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|))))))) (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_819 Int) (v_ArrVal_824 (Array Int Int)) (v_ArrVal_817 Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_822 Int)) (let ((.cse8 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_816)) (.cse10 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse10 v_ArrVal_817) .cse9 v_ArrVal_819)) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_822)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_824) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse7 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) (< (+ (select .cse8 .cse9) 1) v_ArrVal_819) (< (+ (select .cse8 .cse10) 1) v_ArrVal_817)))))))) is different from false [2023-08-30 12:37:33,837 WARN L222 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 99 DAG size of output: 89 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 12:37:40,894 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 [0, 1] [2023-08-30 12:37:42,599 INFO L130 PetriNetUnfolder]: 4272/8309 cut-off events. [2023-08-30 12:37:42,599 INFO L131 PetriNetUnfolder]: For 243883/245475 co-relation queries the response was YES. [2023-08-30 12:37:42,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61204 conditions, 8309 events. 4272/8309 cut-off events. For 243883/245475 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 60763 event pairs, 1626 based on Foata normal form. 41/7665 useless extension candidates. Maximal degree in co-relation 60880. Up to 5862 conditions per place. [2023-08-30 12:37:42,673 INFO L137 encePairwiseOnDemand]: 428/449 looper letters, 347 selfloop transitions, 182 changer transitions 3/538 dead transitions. [2023-08-30 12:37:42,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 538 transitions, 8467 flow [2023-08-30 12:37:42,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-08-30 12:37:42,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-08-30 12:37:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 5435 transitions. [2023-08-30 12:37:42,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39047345355269775 [2023-08-30 12:37:42,677 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 5435 transitions. [2023-08-30 12:37:42,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 5435 transitions. [2023-08-30 12:37:42,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:37:42,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 5435 transitions. [2023-08-30 12:37:42,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 175.32258064516128) internal successors, (5435), 31 states have internal predecessors, (5435), 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 12:37:42,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 449.0) internal successors, (14368), 32 states have internal predecessors, (14368), 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 12:37:42,690 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 449.0) internal successors, (14368), 32 states have internal predecessors, (14368), 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 12:37:42,690 INFO L175 Difference]: Start difference. First operand has 220 places, 336 transitions, 3391 flow. Second operand 31 states and 5435 transitions. [2023-08-30 12:37:42,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 538 transitions, 8467 flow [2023-08-30 12:37:42,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 538 transitions, 7449 flow, removed 457 selfloop flow, removed 11 redundant places. [2023-08-30 12:37:42,804 INFO L231 Difference]: Finished difference. Result has 255 places, 428 transitions, 5139 flow [2023-08-30 12:37:42,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=2989, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=5139, PETRI_PLACES=255, PETRI_TRANSITIONS=428} [2023-08-30 12:37:42,804 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 198 predicate places. [2023-08-30 12:37:42,805 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 428 transitions, 5139 flow [2023-08-30 12:37:42,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 168.33333333333334) internal successors, (6060), 36 states have internal predecessors, (6060), 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 12:37:42,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:37:42,805 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:37:42,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-30 12:37:43,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-30 12:37:43,006 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:37:43,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:37:43,007 INFO L85 PathProgramCache]: Analyzing trace with hash 325569059, now seen corresponding path program 1 times [2023-08-30 12:37:43,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:37:43,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95780453] [2023-08-30 12:37:43,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:37:43,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:37:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:37:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:37:43,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:37:43,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95780453] [2023-08-30 12:37:43,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95780453] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:37:43,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922077587] [2023-08-30 12:37:43,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:37:43,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:37:43,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:37:43,847 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 12:37:43,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-30 12:37:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:37:43,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 56 conjunts are in the unsatisfiable core [2023-08-30 12:37:43,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:37:43,988 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 12:37:43,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 12:37:44,147 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 12:37:44,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:37:44,187 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 24 treesize of output 24 [2023-08-30 12:37:44,265 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-30 12:37:44,266 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2023-08-30 12:37:44,301 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 24 treesize of output 24 [2023-08-30 12:37:44,329 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 29 treesize of output 24 [2023-08-30 12:37:44,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:37:44,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:37:44,618 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 12:37:44,619 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 62 [2023-08-30 12:37:44,630 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 12:37:44,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 112 [2023-08-30 12:37:44,638 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 88 treesize of output 80 [2023-08-30 12:37:44,650 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 51 treesize of output 39 [2023-08-30 12:37:44,668 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 17 treesize of output 9 [2023-08-30 12:37:44,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 12:37:44,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 62 [2023-08-30 12:37:44,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:37:44,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922077587] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:37:44,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:37:44,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2023-08-30 12:37:44,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015498766] [2023-08-30 12:37:44,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:37:44,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 12:37:44,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:37:44,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 12:37:44,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=753, Unknown=13, NotChecked=0, Total=930 [2023-08-30 12:37:46,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 449 [2023-08-30 12:37:46,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 428 transitions, 5139 flow. Second operand has 31 states, 31 states have (on average 174.83870967741936) internal successors, (5420), 31 states have internal predecessors, (5420), 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 12:37:46,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:37:46,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 449 [2023-08-30 12:37:46,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:37:48,686 INFO L130 PetriNetUnfolder]: 4825/9481 cut-off events. [2023-08-30 12:37:48,686 INFO L131 PetriNetUnfolder]: For 491469/493978 co-relation queries the response was YES. [2023-08-30 12:37:48,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83974 conditions, 9481 events. 4825/9481 cut-off events. For 491469/493978 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 68992 event pairs, 1681 based on Foata normal form. 171/8841 useless extension candidates. Maximal degree in co-relation 83539. Up to 2978 conditions per place. [2023-08-30 12:37:48,792 INFO L137 encePairwiseOnDemand]: 436/449 looper letters, 439 selfloop transitions, 121 changer transitions 3/569 dead transitions. [2023-08-30 12:37:48,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 569 transitions, 8752 flow [2023-08-30 12:37:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-30 12:37:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-30 12:37:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2975 transitions. [2023-08-30 12:37:48,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4141146993318486 [2023-08-30 12:37:48,794 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2975 transitions. [2023-08-30 12:37:48,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2975 transitions. [2023-08-30 12:37:48,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:37:48,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2975 transitions. [2023-08-30 12:37:48,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 185.9375) internal successors, (2975), 16 states have internal predecessors, (2975), 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 12:37:48,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 449.0) internal successors, (7633), 17 states have internal predecessors, (7633), 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 12:37:48,802 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 449.0) internal successors, (7633), 17 states have internal predecessors, (7633), 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 12:37:48,802 INFO L175 Difference]: Start difference. First operand has 255 places, 428 transitions, 5139 flow. Second operand 16 states and 2975 transitions. [2023-08-30 12:37:48,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 569 transitions, 8752 flow [2023-08-30 12:37:48,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 569 transitions, 7865 flow, removed 407 selfloop flow, removed 9 redundant places. [2023-08-30 12:37:48,988 INFO L231 Difference]: Finished difference. Result has 263 places, 427 transitions, 4583 flow [2023-08-30 12:37:48,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=4047, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4583, PETRI_PLACES=263, PETRI_TRANSITIONS=427} [2023-08-30 12:37:48,989 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 206 predicate places. [2023-08-30 12:37:48,989 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 427 transitions, 4583 flow [2023-08-30 12:37:48,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 174.83870967741936) internal successors, (5420), 31 states have internal predecessors, (5420), 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 12:37:48,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:37:48,990 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:37:48,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-30 12:37:49,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-30 12:37:49,190 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:37:49,191 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:37:49,191 INFO L85 PathProgramCache]: Analyzing trace with hash -661451598, now seen corresponding path program 1 times [2023-08-30 12:37:49,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:37:49,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820207602] [2023-08-30 12:37:49,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:37:49,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:37:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:37:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:37:49,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:37:49,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820207602] [2023-08-30 12:37:49,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820207602] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:37:49,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:37:49,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 12:37:49,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266431681] [2023-08-30 12:37:49,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:37:49,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 12:37:49,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:37:49,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 12:37:49,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 12:37:49,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 449 [2023-08-30 12:37:49,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 427 transitions, 4583 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 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 12:37:49,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:37:49,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 449 [2023-08-30 12:37:49,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:37:50,620 INFO L130 PetriNetUnfolder]: 4627/9187 cut-off events. [2023-08-30 12:37:50,620 INFO L131 PetriNetUnfolder]: For 465705/467715 co-relation queries the response was YES. [2023-08-30 12:37:50,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78741 conditions, 9187 events. 4627/9187 cut-off events. For 465705/467715 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 67114 event pairs, 2463 based on Foata normal form. 27/8494 useless extension candidates. Maximal degree in co-relation 78474. Up to 8467 conditions per place. [2023-08-30 12:37:50,730 INFO L137 encePairwiseOnDemand]: 447/449 looper letters, 388 selfloop transitions, 1 changer transitions 3/428 dead transitions. [2023-08-30 12:37:50,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 428 transitions, 5469 flow [2023-08-30 12:37:50,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 12:37:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 12:37:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2023-08-30 12:37:50,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5367483296213809 [2023-08-30 12:37:50,732 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 723 transitions. [2023-08-30 12:37:50,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 723 transitions. [2023-08-30 12:37:50,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:37:50,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 723 transitions. [2023-08-30 12:37:50,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 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 12:37:50,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 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 12:37:50,734 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 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 12:37:50,734 INFO L175 Difference]: Start difference. First operand has 263 places, 427 transitions, 4583 flow. Second operand 3 states and 723 transitions. [2023-08-30 12:37:50,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 428 transitions, 5469 flow [2023-08-30 12:37:50,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 428 transitions, 5347 flow, removed 35 selfloop flow, removed 7 redundant places. [2023-08-30 12:37:50,897 INFO L231 Difference]: Finished difference. Result has 257 places, 420 transitions, 4370 flow [2023-08-30 12:37:50,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=4368, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4370, PETRI_PLACES=257, PETRI_TRANSITIONS=420} [2023-08-30 12:37:50,898 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 200 predicate places. [2023-08-30 12:37:50,898 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 420 transitions, 4370 flow [2023-08-30 12:37:50,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 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 12:37:50,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:37:50,899 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 12:37:50,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 12:37:50,899 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:37:50,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:37:50,899 INFO L85 PathProgramCache]: Analyzing trace with hash -661451597, now seen corresponding path program 1 times [2023-08-30 12:37:50,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:37:50,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560459228] [2023-08-30 12:37:50,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:37:50,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:37:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:37:50,940 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 12:37:50,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:37:50,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560459228] [2023-08-30 12:37:50,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560459228] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 12:37:50,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 12:37:50,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 12:37:50,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197970014] [2023-08-30 12:37:50,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 12:37:50,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 12:37:50,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:37:50,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 12:37:50,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 12:37:50,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-08-30 12:37:50,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 420 transitions, 4370 flow. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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 12:37:50,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:37:50,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-08-30 12:37:50,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:37:52,265 INFO L130 PetriNetUnfolder]: 4511/9009 cut-off events. [2023-08-30 12:37:52,265 INFO L131 PetriNetUnfolder]: For 442528/445449 co-relation queries the response was YES. [2023-08-30 12:37:52,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75602 conditions, 9009 events. 4511/9009 cut-off events. For 442528/445449 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 65887 event pairs, 2715 based on Foata normal form. 82/8380 useless extension candidates. Maximal degree in co-relation 75393. Up to 5817 conditions per place. [2023-08-30 12:37:52,380 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 355 selfloop transitions, 32 changer transitions 0/423 dead transitions. [2023-08-30 12:37:52,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 423 transitions, 5299 flow [2023-08-30 12:37:52,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 12:37:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 12:37:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2023-08-30 12:37:52,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532293986636971 [2023-08-30 12:37:52,381 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 717 transitions. [2023-08-30 12:37:52,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 717 transitions. [2023-08-30 12:37:52,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:37:52,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 717 transitions. [2023-08-30 12:37:52,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 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 12:37:52,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 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 12:37:52,383 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 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 12:37:52,383 INFO L175 Difference]: Start difference. First operand has 257 places, 420 transitions, 4370 flow. Second operand 3 states and 717 transitions. [2023-08-30 12:37:52,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 423 transitions, 5299 flow [2023-08-30 12:37:52,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 423 transitions, 5290 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-30 12:37:52,510 INFO L231 Difference]: Finished difference. Result has 257 places, 415 transitions, 4372 flow [2023-08-30 12:37:52,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=4308, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4372, PETRI_PLACES=257, PETRI_TRANSITIONS=415} [2023-08-30 12:37:52,511 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 200 predicate places. [2023-08-30 12:37:52,511 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 415 transitions, 4372 flow [2023-08-30 12:37:52,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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 12:37:52,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:37:52,511 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] [2023-08-30 12:37:52,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 12:37:52,512 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:37:52,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:37:52,512 INFO L85 PathProgramCache]: Analyzing trace with hash 855812906, now seen corresponding path program 1 times [2023-08-30 12:37:52,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:37:52,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026577245] [2023-08-30 12:37:52,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:37:52,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:37:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:37:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:37:52,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:37:52,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026577245] [2023-08-30 12:37:52,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026577245] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:37:52,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389136826] [2023-08-30 12:37:52,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:37:52,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:37:52,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:37:52,564 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 12:37:52,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-30 12:37:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:37:52,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 12:37:52,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:37:52,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:37:52,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:37:52,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:37:52,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389136826] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:37:52,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:37:52,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-30 12:37:52,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904271817] [2023-08-30 12:37:52,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:37:52,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 12:37:52,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:37:52,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 12:37:52,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 12:37:52,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-08-30 12:37:52,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 415 transitions, 4372 flow. Second operand has 7 states, 7 states have (on average 227.71428571428572) internal successors, (1594), 7 states have internal predecessors, (1594), 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 12:37:52,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:37:52,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-08-30 12:37:52,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:37:54,119 INFO L130 PetriNetUnfolder]: 3492/6961 cut-off events. [2023-08-30 12:37:54,119 INFO L131 PetriNetUnfolder]: For 386072/388700 co-relation queries the response was YES. [2023-08-30 12:37:54,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65955 conditions, 6961 events. 3492/6961 cut-off events. For 386072/388700 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 47024 event pairs, 1738 based on Foata normal form. 108/6606 useless extension candidates. Maximal degree in co-relation 65795. Up to 3385 conditions per place. [2023-08-30 12:37:54,202 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 385 selfloop transitions, 25 changer transitions 0/446 dead transitions. [2023-08-30 12:37:54,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 446 transitions, 6103 flow [2023-08-30 12:37:54,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 12:37:54,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 12:37:54,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1423 transitions. [2023-08-30 12:37:54,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5282108389012621 [2023-08-30 12:37:54,204 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1423 transitions. [2023-08-30 12:37:54,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1423 transitions. [2023-08-30 12:37:54,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:37:54,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1423 transitions. [2023-08-30 12:37:54,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 237.16666666666666) internal successors, (1423), 6 states have internal predecessors, (1423), 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 12:37:54,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 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 12:37:54,207 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 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 12:37:54,207 INFO L175 Difference]: Start difference. First operand has 257 places, 415 transitions, 4372 flow. Second operand 6 states and 1423 transitions. [2023-08-30 12:37:54,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 446 transitions, 6103 flow [2023-08-30 12:37:54,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 446 transitions, 6031 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-30 12:37:54,344 INFO L231 Difference]: Finished difference. Result has 260 places, 408 transitions, 4366 flow [2023-08-30 12:37:54,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=4157, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4366, PETRI_PLACES=260, PETRI_TRANSITIONS=408} [2023-08-30 12:37:54,345 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 203 predicate places. [2023-08-30 12:37:54,345 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 408 transitions, 4366 flow [2023-08-30 12:37:54,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 227.71428571428572) internal successors, (1594), 7 states have internal predecessors, (1594), 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 12:37:54,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:37:54,345 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 12:37:54,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-30 12:37:54,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:37:54,546 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:37:54,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:37:54,546 INFO L85 PathProgramCache]: Analyzing trace with hash -66120868, now seen corresponding path program 4 times [2023-08-30 12:37:54,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:37:54,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470157131] [2023-08-30 12:37:54,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:37:54,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:37:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:37:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:37:56,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:37:56,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470157131] [2023-08-30 12:37:56,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470157131] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:37:56,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655310069] [2023-08-30 12:37:56,040 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 12:37:56,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:37:56,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:37:56,045 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 12:37:56,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-30 12:37:56,205 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 12:37:56,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 12:37:56,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 99 conjunts are in the unsatisfiable core [2023-08-30 12:37:56,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:37:56,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:37:56,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:37:56,244 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 12:37:56,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-30 12:37:56,259 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 12:37:56,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 12:37:56,359 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 36 treesize of output 29 [2023-08-30 12:37:56,470 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 41 treesize of output 34 [2023-08-30 12:37:56,592 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 44 treesize of output 37 [2023-08-30 12:37:56,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:37:56,647 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 33 treesize of output 35 [2023-08-30 12:37:56,738 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 47 treesize of output 40 [2023-08-30 12:37:56,957 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 52 treesize of output 45 [2023-08-30 12:37:57,095 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 41 treesize of output 43 [2023-08-30 12:37:57,495 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 55 treesize of output 48 [2023-08-30 12:37:57,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:37:57,781 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 44 treesize of output 46 [2023-08-30 12:37:58,378 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 58 treesize of output 51 [2023-08-30 12:38:01,170 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:38:01,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:38:01,311 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1208 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71| Int) (v_ArrVal_1209 Int) (v_ArrVal_1206 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1206)) |c_~#stored_elements~0.base| v_ArrVal_1208) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) |c_~#queue~0.offset|) v_ArrVal_1209) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1206)))) is different from false [2023-08-30 12:38:01,463 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1208 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71| Int) (v_ArrVal_1209 Int) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1206 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1205))) (let ((.cse2 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1206)) |c_~#stored_elements~0.base| v_ArrVal_1208) |c_~#queue~0.base|)) (.cse1 (select .cse2 .cse3))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) |c_~#queue~0.offset|) v_ArrVal_1209) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) (< (+ .cse1 1) v_ArrVal_1206) (= 800 .cse1)))))) is different from false [2023-08-30 12:38:01,494 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1208 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71| Int) (v_ArrVal_1209 Int) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1204 Int) (v_ArrVal_1206 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1204)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1205))) (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4)) (.cse1 (select (store (store .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1206)) |c_~#stored_elements~0.base| v_ArrVal_1208) |c_~#queue~0.base|))) (or (= .cse0 800) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) (< (+ .cse0 1) v_ArrVal_1206) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1204) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) |c_~#queue~0.offset|) v_ArrVal_1209) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2023-08-30 12:38:01,521 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1208 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71| Int) (v_ArrVal_1209 Int) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1204 Int) (v_ArrVal_1206 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1204)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1205))) (let ((.cse5 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse5 .cse6)) (.cse1 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1206)) |c_~#stored_elements~0.base| v_ArrVal_1208) |c_~#queue~0.base|))) (or (= .cse0 800) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) (< (+ .cse0 1) v_ArrVal_1206) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) |c_~#queue~0.offset|) v_ArrVal_1209) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1204))))))) is different from false [2023-08-30 12:38:01,560 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1208 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71| Int) (v_ArrVal_1209 Int) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1201 Int) (v_ArrVal_1204 Int) (v_ArrVal_1206 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1201)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1204)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1205))) (let ((.cse4 (select .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1206)) |c_~#stored_elements~0.base| v_ArrVal_1208) |c_~#queue~0.base|)) (.cse3 (select .cse4 .cse5))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1204) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) |c_~#queue~0.offset|) v_ArrVal_1209) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (= .cse3 800) (< (+ .cse3 1) v_ArrVal_1206))))))) is different from false [2023-08-30 12:38:01,599 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1208 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71| Int) (v_ArrVal_1209 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1201 Int) (v_ArrVal_1204 Int) (v_ArrVal_1206 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1201)) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse5 v_ArrVal_1204)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1205))) (let ((.cse7 (select .cse6 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse7 .cse2)) (.cse1 (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 .cse2 v_ArrVal_1206)) |c_~#stored_elements~0.base| v_ArrVal_1208) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_1206) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1204) (= .cse0 800) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) |c_~#queue~0.offset|) v_ArrVal_1209) .cse5) 2147483647)))))))) is different from false [2023-08-30 12:38:01,637 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1208 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71| Int) (v_ArrVal_1209 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1200 (Array Int Int)) (v_ArrVal_1201 Int) (v_ArrVal_1204 Int) (v_ArrVal_1206 Int)) (let ((.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1200))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse1 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1201)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse8 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_1204)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1205))) (let ((.cse7 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse7 .cse4)) (.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 .cse4 v_ArrVal_1206)) |c_~#stored_elements~0.base| v_ArrVal_1208) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_1206) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1204) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) (= .cse0 800) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) |c_~#queue~0.offset|) v_ArrVal_1209) .cse2) 2147483647))))))))) is different from false [2023-08-30 12:38:01,684 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1208 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71| Int) (v_ArrVal_1209 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1198 Int) (v_ArrVal_1200 (Array Int Int)) (v_ArrVal_1201 Int) (v_ArrVal_1204 Int) (v_ArrVal_1206 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1198)) |c_~#stored_elements~0.base| v_ArrVal_1200))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1201)) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store .cse3 .cse4 v_ArrVal_1204)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1205))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store .cse6 .cse1 v_ArrVal_1206)) |c_~#stored_elements~0.base| v_ArrVal_1208) |c_~#queue~0.base|)) (.cse2 (select .cse6 .cse1))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1198) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) (< (+ .cse2 1) v_ArrVal_1206) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1204) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) |c_~#queue~0.offset|) v_ArrVal_1209) .cse4) 2147483647) (= .cse2 800) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|))))))))) is different from false [2023-08-30 12:38:01,737 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1208 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71| Int) (v_ArrVal_1209 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1198 Int) (v_ArrVal_1200 (Array Int Int)) (v_ArrVal_1201 Int) (v_ArrVal_1204 Int) (v_ArrVal_1206 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1198)) |c_~#stored_elements~0.base| v_ArrVal_1200))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1201)) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse3 .cse4 v_ArrVal_1204)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1205))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store .cse8 .cse1 v_ArrVal_1206)) |c_~#stored_elements~0.base| v_ArrVal_1208) |c_~#queue~0.base|)) (.cse2 (select .cse8 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) (< (+ .cse2 1) v_ArrVal_1206) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1204) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) |c_~#queue~0.offset|) v_ArrVal_1209) .cse4) 2147483647) (= .cse2 800) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1198) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|)))))))))) is different from false [2023-08-30 12:38:01,829 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1208 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71| Int) (v_ArrVal_1209 Int) (v_ArrVal_1196 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1198 Int) (v_ArrVal_1200 (Array Int Int)) (v_ArrVal_1201 Int) (v_ArrVal_1204 Int) (v_ArrVal_1206 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1196) .cse6 v_ArrVal_1198)) |c_~#stored_elements~0.base| v_ArrVal_1200))) (let ((.cse3 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1201)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (store .cse7 .cse2 v_ArrVal_1204)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1205))) (let ((.cse9 (select .cse8 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse9 .cse4)) (.cse1 (select (store (store .cse8 |c_~#queue~0.base| (store .cse9 .cse4 v_ArrVal_1206)) |c_~#stored_elements~0.base| v_ArrVal_1208) |c_~#queue~0.base|))) (or (= .cse0 800) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1196) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) |c_~#queue~0.offset|) v_ArrVal_1209) .cse2) 2147483647) (< (+ .cse0 1) v_ArrVal_1206) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) (< (select .cse1 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1198) (< (+ (select .cse7 .cse2) 1) v_ArrVal_1204)))))))))) is different from false [2023-08-30 12:38:01,886 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1208 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71| Int) (v_ArrVal_1209 Int) (v_ArrVal_1196 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1198 Int) (v_ArrVal_1200 (Array Int Int)) (v_ArrVal_1201 Int) (v_ArrVal_1204 Int) (v_ArrVal_1206 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1196) .cse7 v_ArrVal_1198)) |c_~#stored_elements~0.base| v_ArrVal_1200))) (let ((.cse3 (select .cse11 |c_~#queue~0.base|))) (let ((.cse8 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1201)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse11 |c_~#queue~0.base| (store .cse8 .cse2 v_ArrVal_1204)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1205))) (let ((.cse10 (select .cse9 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse10 .cse4)) (.cse1 (select (store (store .cse9 |c_~#queue~0.base| (store .cse10 .cse4 v_ArrVal_1206)) |c_~#stored_elements~0.base| v_ArrVal_1208) |c_~#queue~0.base|))) (or (= .cse0 800) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) |c_~#queue~0.offset|) v_ArrVal_1209) .cse2) 2147483647) (< (+ .cse0 1) v_ArrVal_1206) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) (< (select .cse1 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1196) (< (+ (select .cse5 .cse7) 1) v_ArrVal_1198) (< (+ (select .cse8 .cse2) 1) v_ArrVal_1204)))))))))) is different from false [2023-08-30 12:38:01,942 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1208 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71| Int) (v_ArrVal_1209 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1200 (Array Int Int)) (v_ArrVal_1194 Int) (v_ArrVal_1196 Int) (v_ArrVal_1198 Int) (v_ArrVal_1201 Int) (v_ArrVal_1204 Int) (v_ArrVal_1206 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1194)) (.cse8 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse8 v_ArrVal_1196) .cse2 v_ArrVal_1198)) |c_~#stored_elements~0.base| v_ArrVal_1200))) (let ((.cse3 (select .cse11 |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1201)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse11 |c_~#queue~0.base| (store .cse5 .cse6 v_ArrVal_1204)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1205))) (let ((.cse10 (select .cse9 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse10 .cse4)) (.cse7 (select (store (store .cse9 |c_~#queue~0.base| (store .cse10 .cse4 v_ArrVal_1206)) |c_~#stored_elements~0.base| v_ArrVal_1208) |c_~#queue~0.base|))) (or (= .cse0 800) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1198) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1204) (< (select .cse7 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) (< (+ .cse0 1) v_ArrVal_1206) (< (select (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) |c_~#queue~0.offset|) v_ArrVal_1209) .cse6) 2147483647) (< (+ (select .cse1 .cse8) 1) v_ArrVal_1196)))))))))) is different from false [2023-08-30 12:38:02,007 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1208 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71| Int) (v_ArrVal_1209 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1205 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_1200 (Array Int Int)) (v_ArrVal_1194 Int) (v_ArrVal_1196 Int) (v_ArrVal_1198 Int) (v_ArrVal_1201 Int) (v_ArrVal_1204 Int) (v_ArrVal_1206 Int)) (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_1194)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse10 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1196) .cse3 v_ArrVal_1198)) |c_~#stored_elements~0.base| v_ArrVal_1200))) (let ((.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1201))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1204)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1205))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (select (store (store .cse9 |c_~#queue~0.base| (store .cse8 .cse3 v_ArrVal_1206)) |c_~#stored_elements~0.base| v_ArrVal_1208) |c_~#queue~0.base|)) (.cse6 (select .cse8 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1204) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1198) (< (+ 1 (select .cse5 .cse1)) v_ArrVal_1196) (< (+ .cse6 1) v_ArrVal_1206) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_71|) |c_~#queue~0.offset|) v_ArrVal_1209) .cse1) 2147483647) (= .cse6 800))))))))))) is different from false [2023-08-30 12:38:02,153 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2023-08-30 12:38:02,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655310069] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:38:02,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:38:02,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 54 [2023-08-30 12:38:02,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318026883] [2023-08-30 12:38:02,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:38:02,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-08-30 12:38:02,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:38:02,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-08-30 12:38:02,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=1333, Unknown=23, NotChecked=1222, Total=3080 [2023-08-30 12:38:04,230 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 [0] [2023-08-30 12:38:04,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-08-30 12:38:04,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 408 transitions, 4366 flow. Second operand has 56 states, 56 states have (on average 168.28571428571428) internal successors, (9424), 56 states have internal predecessors, (9424), 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 12:38:04,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:38:04,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-08-30 12:38:04,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:38:17,032 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 [0] [2023-08-30 12:38:19,987 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 [0] [2023-08-30 12:38:27,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:38:44,358 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 [0] [2023-08-30 12:38:46,373 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 [0] [2023-08-30 12:38:48,448 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 [0] [2023-08-30 12:38:49,614 INFO L130 PetriNetUnfolder]: 3640/7161 cut-off events. [2023-08-30 12:38:49,614 INFO L131 PetriNetUnfolder]: For 423537/425772 co-relation queries the response was YES. [2023-08-30 12:38:49,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70558 conditions, 7161 events. 3640/7161 cut-off events. For 423537/425772 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 48052 event pairs, 1525 based on Foata normal form. 57/6777 useless extension candidates. Maximal degree in co-relation 69916. Up to 4837 conditions per place. [2023-08-30 12:38:49,693 INFO L137 encePairwiseOnDemand]: 432/449 looper letters, 330 selfloop transitions, 177 changer transitions 3/516 dead transitions. [2023-08-30 12:38:49,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 516 transitions, 9501 flow [2023-08-30 12:38:49,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-30 12:38:49,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-30 12:38:49,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4705 transitions. [2023-08-30 12:38:49,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38810525447496497 [2023-08-30 12:38:49,698 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4705 transitions. [2023-08-30 12:38:49,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4705 transitions. [2023-08-30 12:38:49,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 12:38:49,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4705 transitions. [2023-08-30 12:38:49,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 174.25925925925927) internal successors, (4705), 27 states have internal predecessors, (4705), 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 12:38:49,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 449.0) internal successors, (12572), 28 states have internal predecessors, (12572), 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 12:38:49,711 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 449.0) internal successors, (12572), 28 states have internal predecessors, (12572), 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 12:38:49,711 INFO L175 Difference]: Start difference. First operand has 260 places, 408 transitions, 4366 flow. Second operand 27 states and 4705 transitions. [2023-08-30 12:38:49,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 516 transitions, 9501 flow [2023-08-30 12:38:49,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 516 transitions, 9474 flow, removed 11 selfloop flow, removed 1 redundant places. [2023-08-30 12:38:49,857 INFO L231 Difference]: Finished difference. Result has 290 places, 422 transitions, 5107 flow [2023-08-30 12:38:49,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=4321, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=5107, PETRI_PLACES=290, PETRI_TRANSITIONS=422} [2023-08-30 12:38:49,857 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 233 predicate places. [2023-08-30 12:38:49,857 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 422 transitions, 5107 flow [2023-08-30 12:38:49,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 168.28571428571428) internal successors, (9424), 56 states have internal predecessors, (9424), 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 12:38:49,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 12:38:49,859 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 12:38:49,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-30 12:38:50,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:38:50,059 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-08-30 12:38:50,060 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 12:38:50,060 INFO L85 PathProgramCache]: Analyzing trace with hash -228871586, now seen corresponding path program 5 times [2023-08-30 12:38:50,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 12:38:50,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568518611] [2023-08-30 12:38:50,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 12:38:50,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 12:38:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 12:38:51,464 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:38:51,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 12:38:51,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568518611] [2023-08-30 12:38:51,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568518611] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 12:38:51,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355609949] [2023-08-30 12:38:51,465 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 12:38:51,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 12:38:51,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 12:38:51,466 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 12:38:51,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-30 12:38:51,621 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-30 12:38:51,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 12:38:51,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 100 conjunts are in the unsatisfiable core [2023-08-30 12:38:51,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 12:38:51,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:38:51,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:38:51,655 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 12:38:51,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-30 12:38:51,668 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 12:38:51,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 12:38:51,763 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 36 treesize of output 29 [2023-08-30 12:38:51,856 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 41 treesize of output 34 [2023-08-30 12:38:51,979 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 44 treesize of output 37 [2023-08-30 12:38:52,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:38:52,037 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 33 treesize of output 35 [2023-08-30 12:38:52,149 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 47 treesize of output 40 [2023-08-30 12:38:52,635 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 52 treesize of output 45 [2023-08-30 12:38:52,863 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 55 treesize of output 48 [2023-08-30 12:38:55,109 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 44 treesize of output 46 [2023-08-30 12:38:55,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 12:38:55,410 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 44 treesize of output 46 [2023-08-30 12:38:56,186 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 58 treesize of output 51 [2023-08-30 12:39:01,259 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 12:39:01,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 12:39:01,349 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1336 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1334) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) |c_~#queue~0.offset|) v_ArrVal_1336) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|)))) is different from false [2023-08-30 12:39:01,357 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1333 (Array Int Int)) (v_ArrVal_1336 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1333) |c_~#stored_elements~0.base| v_ArrVal_1334) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) |c_~#queue~0.offset|) v_ArrVal_1336) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|)))) is different from false [2023-08-30 12:39:15,799 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1331 Int) (v_ArrVal_1333 (Array Int Int)) (v_ArrVal_1336 Int) (v_ArrVal_1327 Int) (v_ArrVal_1329 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80| Int)) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1326))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1327)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1329) .cse1 v_ArrVal_1331)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1333) |c_~#stored_elements~0.base| v_ArrVal_1334) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) |c_~#queue~0.offset|) v_ArrVal_1336) .cse3) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1329) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1331))))))) is different from false [2023-08-30 12:39:15,832 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1331 Int) (v_ArrVal_1333 (Array Int Int)) (v_ArrVal_1325 Int) (v_ArrVal_1336 Int) (v_ArrVal_1327 Int) (v_ArrVal_1329 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80| Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1325)) |c_~#stored_elements~0.base| v_ArrVal_1326))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1327)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_1329) .cse1 v_ArrVal_1331)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1333) |c_~#stored_elements~0.base| v_ArrVal_1334) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1331) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1325) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1329) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) |c_~#queue~0.offset|) v_ArrVal_1336) .cse4) 2147483647))))))) is different from false [2023-08-30 12:39:15,864 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1331 Int) (v_ArrVal_1333 (Array Int Int)) (v_ArrVal_1325 Int) (v_ArrVal_1336 Int) (v_ArrVal_1327 Int) (v_ArrVal_1329 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1325)) |c_~#stored_elements~0.base| v_ArrVal_1326))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1327)) (.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_1329) .cse1 v_ArrVal_1331)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1333) |c_~#stored_elements~0.base| v_ArrVal_1334) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1331) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1325) (< (+ (select .cse2 .cse6) 1) v_ArrVal_1329) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) |c_~#queue~0.offset|) v_ArrVal_1336) .cse6) 2147483647)))))))) is different from false [2023-08-30 12:39:15,958 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1331 Int) (v_ArrVal_1333 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1325 Int) (v_ArrVal_1336 Int) (v_ArrVal_1327 Int) (v_ArrVal_1329 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1322) .cse3 v_ArrVal_1325)) |c_~#stored_elements~0.base| v_ArrVal_1326))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1327)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (select (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1329) .cse4 v_ArrVal_1331)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1333) |c_~#stored_elements~0.base| v_ArrVal_1334) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1329) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1325) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1331) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) |c_~#queue~0.offset|) v_ArrVal_1336) .cse1) 2147483647) (< (select .cse6 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1322)))))))) is different from false [2023-08-30 12:39:16,020 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1331 Int) (v_ArrVal_1333 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1325 Int) (v_ArrVal_1336 Int) (v_ArrVal_1327 Int) (v_ArrVal_1329 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse7 v_ArrVal_1322) .cse3 v_ArrVal_1325)) |c_~#stored_elements~0.base| v_ArrVal_1326))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1327)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1329) .cse4 v_ArrVal_1331)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1333) |c_~#stored_elements~0.base| v_ArrVal_1334) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1329) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1325) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1331) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) |c_~#queue~0.offset|) v_ArrVal_1336) .cse1) 2147483647) (< (select .cse6 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) (< (+ (select .cse2 .cse7) 1) v_ArrVal_1322)))))))) is different from false [2023-08-30 12:39:16,095 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1333 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80| Int) (v_ArrVal_1320 Int) (v_ArrVal_1331 Int) (v_ArrVal_1322 Int) (v_ArrVal_1325 Int) (v_ArrVal_1336 Int) (v_ArrVal_1327 Int) (v_ArrVal_1329 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1320)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1322) .cse6 v_ArrVal_1325)) |c_~#stored_elements~0.base| v_ArrVal_1326))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1327)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1329) .cse1 v_ArrVal_1331)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1333) |c_~#stored_elements~0.base| v_ArrVal_1334) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1331) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1322) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) |c_~#queue~0.offset|) v_ArrVal_1336) .cse5) 2147483647) (< (+ (select .cse0 .cse5) 1) v_ArrVal_1329) (< (+ (select .cse2 .cse6) 1) v_ArrVal_1325) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|)))))))) is different from false [2023-08-30 12:39:32,069 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-08-30 12:39:32,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355609949] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 12:39:32,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 12:39:32,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 53 [2023-08-30 12:39:32,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753695939] [2023-08-30 12:39:32,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 12:39:32,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-08-30 12:39:32,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 12:39:32,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-08-30 12:39:32,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=527, Invalid=1621, Unknown=46, NotChecked=776, Total=2970 [2023-08-30 12:39:32,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-08-30 12:39:32,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 422 transitions, 5107 flow. Second operand has 55 states, 55 states have (on average 168.3090909090909) internal successors, (9257), 55 states have internal predecessors, (9257), 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 12:39:32,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 12:39:32,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-08-30 12:39:32,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 12:39:57,261 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 [0] [2023-08-30 12:39:59,285 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 [0] [2023-08-30 12:40:04,961 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 [0] [2023-08-30 12:40:28,519 WARN L222 SmtUtils]: Spent 10.38s on a formula simplification. DAG size of input: 124 DAG size of output: 81 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 12:40:30,523 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 [0] [2023-08-30 12:40:32,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 [0] [2023-08-30 12:40:36,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 12:40:38,634 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 [0] [2023-08-30 12:40:55,506 WARN L222 SmtUtils]: Spent 8.42s on a formula simplification. DAG size of input: 91 DAG size of output: 83 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 12:41:00,023 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 [0] [2023-08-30 12:41:15,510 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 [0] [2023-08-30 12:41:24,644 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 [0, 1] [2023-08-30 12:41:26,651 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 [0, 1] [2023-08-30 12:41:28,656 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 [0, 1] [2023-08-30 12:41:30,663 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 [0, 1] [2023-08-30 12:41:32,669 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 [0, 1] [2023-08-30 12:41:34,678 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 [0, 1] [2023-08-30 12:41:36,699 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 [0, 1] [2023-08-30 12:41:38,706 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 [0, 1] [2023-08-30 12:41:40,711 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 [0, 1] [2023-08-30 12:41:42,718 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 [0, 1] [2023-08-30 12:41:44,726 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 [0, 1] [2023-08-30 12:41:46,844 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 [0, 1] [2023-08-30 12:41:48,850 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 [0, 1] [2023-08-30 12:41:50,859 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 [0, 1] [2023-08-30 12:41:52,865 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 [0, 1] [2023-08-30 12:41:54,877 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 [0, 1] [2023-08-30 12:42:26,042 WARN L222 SmtUtils]: Spent 14.97s on a formula simplification. DAG size of input: 207 DAG size of output: 139 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 12:42:28,465 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 [0, 1] [2023-08-30 12:42:30,471 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 [0, 1] [2023-08-30 12:42:32,478 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 [0, 1] [2023-08-30 12:42:34,487 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 [0, 1] [2023-08-30 12:42:46,272 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 [0] [2023-08-30 12:42:50,752 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 [0, 1] [2023-08-30 12:42:52,776 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 [0, 1] [2023-08-30 12:42:55,042 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 [0, 1] [2023-08-30 12:43:06,197 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 [0, 1] [2023-08-30 12:43:08,207 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 [0, 1] [2023-08-30 12:43:10,218 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 [0, 1] [2023-08-30 12:43:12,226 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 [0, 1] [2023-08-30 12:43:14,235 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 [0, 1] [2023-08-30 12:43:16,242 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 [0, 1] [2023-08-30 12:43:18,250 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 [0, 1] [2023-08-30 12:43:20,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 12:43:22,397 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 [0, 1] [2023-08-30 12:43:24,405 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 [0, 1] [2023-08-30 12:43:26,413 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 [0, 1] [2023-08-30 12:43:28,422 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 [0, 1] [2023-08-30 12:43:30,435 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 [0, 1] [2023-08-30 12:43:32,445 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 [0, 1] [2023-08-30 12:43:34,458 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 [0, 1] [2023-08-30 12:43:36,469 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 [0, 1] [2023-08-30 12:43:38,488 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 [0, 1] [2023-08-30 12:43:40,499 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 [0, 1] [2023-08-30 12:43:42,520 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 [0] [2023-08-30 12:43:52,793 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 [0, 1] [2023-08-30 12:43:54,800 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 [0, 1] [2023-08-30 12:43:56,809 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 [0, 1] [2023-08-30 12:43:58,817 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 [0, 1] [2023-08-30 12:44:00,826 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 [0, 1] [2023-08-30 12:44:02,836 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 [0, 1] [2023-08-30 12:44:04,844 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 [0, 1] [2023-08-30 12:44:06,851 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 [0, 1] [2023-08-30 12:44:08,876 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 [0, 1] [2023-08-30 12:44:10,888 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 [0, 1] [2023-08-30 12:44:12,896 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 [0, 1] [2023-08-30 12:44:14,908 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 [0, 1] [2023-08-30 12:44:48,581 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 [0] [2023-08-30 12:44:58,773 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 [0] [2023-08-30 12:45:25,790 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 [0, 1] [2023-08-30 12:45:27,797 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 [0, 1] [2023-08-30 12:45:29,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 [0, 1] [2023-08-30 12:45:31,817 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 [0, 1] [2023-08-30 12:45:33,837 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 [0, 1] [2023-08-30 12:45:35,844 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 [0, 1] [2023-08-30 12:45:37,853 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 [0, 1] [2023-08-30 12:45:39,868 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 [0, 1] [2023-08-30 12:45:41,881 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 [0, 1] [2023-08-30 12:45:43,890 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 [0, 1] [2023-08-30 12:45:45,898 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 [0, 1] [2023-08-30 12:45:47,913 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 [0, 1] [2023-08-30 12:45:49,933 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 [0] [2023-08-30 12:45:51,946 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 [0] [2023-08-30 12:45:53,962 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 [0, 1] [2023-08-30 12:45:55,981 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 [0, 1] [2023-08-30 12:46:10,848 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 [0, 1] [2023-08-30 12:46:12,857 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 [0, 1] [2023-08-30 12:46:14,864 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 [0, 1] [2023-08-30 12:46:16,872 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 [0, 1] [2023-08-30 12:46:18,880 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 [0, 1] [2023-08-30 12:46:20,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 [0, 1] [2023-08-30 12:46:22,897 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 [0, 1] [2023-08-30 12:46:24,904 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 [0, 1] [2023-08-30 12:46:41,797 WARN L222 SmtUtils]: Spent 8.18s on a formula simplification. DAG size of input: 168 DAG size of output: 127 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 12:46:43,815 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 [0] [2023-08-30 12:46:45,839 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 [0] [2023-08-30 12:46:58,740 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ (select .cse4 .cse5) 1)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1331 Int) (v_ArrVal_1333 (Array Int Int)) (v_ArrVal_1336 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80| Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1331)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1333) |c_~#stored_elements~0.base| v_ArrVal_1334) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) (< .cse2 v_ArrVal_1331) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) |c_~#queue~0.offset|) v_ArrVal_1336) .cse3) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1331 Int) (v_ArrVal_1333 (Array Int Int)) (v_ArrVal_1325 Int) (v_ArrVal_1336 Int) (v_ArrVal_1327 Int) (v_ArrVal_1329 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80| Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1325)) |c_~#stored_elements~0.base| v_ArrVal_1326))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1327))) (let ((.cse6 (select (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_1329) .cse1 v_ArrVal_1331)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1333) |c_~#stored_elements~0.base| v_ArrVal_1334) |c_~#queue~0.base|))) (or (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1331) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (< .cse2 v_ArrVal_1325) (< (+ (select .cse7 .cse3) 1) v_ArrVal_1329) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_80|) |c_~#queue~0.offset|) v_ArrVal_1336) .cse3) 2147483647)))))))))) is different from false [2023-08-30 12:47:13,892 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 [0] [2023-08-30 12:47:15,905 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 [0] [2023-08-30 12:47:28,317 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 [0, 1] [2023-08-30 12:47:30,327 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 [0, 1] [2023-08-30 12:47:32,336 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 [0, 1] Killed by 15