./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/pthread-complex/safestack_relacy.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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-complex/safestack_relacy.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 1d61eb304445c3cb39dfadfa4748d680ea5f0f4958f8bc176e8bc3c77c47e674 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 08:55:38,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 08:55:38,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 08:55:38,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 08:55:38,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 08:55:38,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 08:55:38,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 08:55:38,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 08:55:38,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 08:55:38,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 08:55:38,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 08:55:38,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 08:55:38,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 08:55:38,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 08:55:38,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 08:55:38,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 08:55:38,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 08:55:38,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 08:55:38,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 08:55:38,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 08:55:38,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 08:55:38,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 08:55:38,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 08:55:38,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 08:55:38,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 08:55:38,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 08:55:38,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 08:55:38,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 08:55:38,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 08:55:38,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 08:55:38,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 08:55:38,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 08:55:38,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 08:55:38,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 08:55:38,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 08:55:38,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 08:55:38,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 08:55:38,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 08:55:38,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 08:55:38,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 08:55:38,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 08:55:38,108 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-08-30 08:55:38,133 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 08:55:38,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 08:55:38,136 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 08:55:38,136 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 08:55:38,137 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 08:55:38,137 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 08:55:38,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 08:55:38,138 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 08:55:38,138 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 08:55:38,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 08:55:38,139 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 08:55:38,139 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 08:55:38,139 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 08:55:38,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 08:55:38,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 08:55:38,140 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 08:55:38,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 08:55:38,140 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 08:55:38,140 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-08-30 08:55:38,140 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 08:55:38,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 08:55:38,141 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 08:55:38,141 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 08:55:38,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 08:55:38,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 08:55:38,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 08:55:38,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 08:55:38,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 08:55:38,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 08:55:38,142 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 08:55:38,143 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 08:55:38,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 08:55:38,143 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 08:55:38,143 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 08:55:38,143 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 08:55:38,144 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 08:55:38,144 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 08:55:38,144 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 -> 1d61eb304445c3cb39dfadfa4748d680ea5f0f4958f8bc176e8bc3c77c47e674 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 08:55:38,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 08:55:38,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 08:55:38,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 08:55:38,447 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 08:55:38,447 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 08:55:38,448 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-complex/safestack_relacy.i [2023-08-30 08:55:39,553 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 08:55:39,791 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 08:55:39,791 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/safestack_relacy.i [2023-08-30 08:55:39,807 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90e781b73/9dc168d7b9b04f7989b218fd94478fb5/FLAGfbbb0b456 [2023-08-30 08:55:39,820 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90e781b73/9dc168d7b9b04f7989b218fd94478fb5 [2023-08-30 08:55:39,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 08:55:39,823 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 08:55:39,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 08:55:39,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 08:55:39,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 08:55:39,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:55:39" (1/1) ... [2023-08-30 08:55:39,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d81391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:55:39, skipping insertion in model container [2023-08-30 08:55:39,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:55:39" (1/1) ... [2023-08-30 08:55:39,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 08:55:39,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 08:55:40,423 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-complex/safestack_relacy.i[78860,78873] [2023-08-30 08:55:40,427 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 08:55:40,435 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 08:55:40,475 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-complex/safestack_relacy.i[78860,78873] [2023-08-30 08:55:40,477 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 08:55:40,572 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 08:55:40,573 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 08:55:40,578 INFO L208 MainTranslator]: Completed translation [2023-08-30 08:55:40,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:55:40 WrapperNode [2023-08-30 08:55:40,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 08:55:40,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 08:55:40,580 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 08:55:40,580 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 08:55:40,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:55:40" (1/1) ... [2023-08-30 08:55:40,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:55:40" (1/1) ... [2023-08-30 08:55:40,649 INFO L138 Inliner]: procedures = 481, calls = 74, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 299 [2023-08-30 08:55:40,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 08:55:40,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 08:55:40,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 08:55:40,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 08:55:40,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:55:40" (1/1) ... [2023-08-30 08:55:40,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:55:40" (1/1) ... [2023-08-30 08:55:40,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:55:40" (1/1) ... [2023-08-30 08:55:40,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:55:40" (1/1) ... [2023-08-30 08:55:40,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:55:40" (1/1) ... [2023-08-30 08:55:40,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:55:40" (1/1) ... [2023-08-30 08:55:40,684 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:55:40" (1/1) ... [2023-08-30 08:55:40,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:55:40" (1/1) ... [2023-08-30 08:55:40,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 08:55:40,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 08:55:40,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 08:55:40,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 08:55:40,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:55:40" (1/1) ... [2023-08-30 08:55:40,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 08:55:40,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:55:40,740 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 08:55:40,759 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 08:55:40,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 08:55:40,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 08:55:40,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 08:55:40,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 08:55:40,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 08:55:40,774 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-08-30 08:55:40,775 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-08-30 08:55:40,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 08:55:40,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 08:55:40,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 08:55:40,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 08:55:40,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 08:55:40,776 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 08:55:41,102 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 08:55:41,104 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 08:55:41,507 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 08:55:41,574 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 08:55:41,574 INFO L302 CfgBuilder]: Removed 7 assume(true) statements. [2023-08-30 08:55:41,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:55:41 BoogieIcfgContainer [2023-08-30 08:55:41,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 08:55:41,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 08:55:41,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 08:55:41,583 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 08:55:41,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 08:55:39" (1/3) ... [2023-08-30 08:55:41,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30dbfd14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:55:41, skipping insertion in model container [2023-08-30 08:55:41,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:55:40" (2/3) ... [2023-08-30 08:55:41,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30dbfd14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:55:41, skipping insertion in model container [2023-08-30 08:55:41,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:55:41" (3/3) ... [2023-08-30 08:55:41,586 INFO L112 eAbstractionObserver]: Analyzing ICFG safestack_relacy.i [2023-08-30 08:55:41,593 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 08:55:41,600 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 08:55:41,600 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-08-30 08:55:41,600 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 08:55:41,715 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-30 08:55:41,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 275 transitions, 558 flow [2023-08-30 08:55:41,875 INFO L130 PetriNetUnfolder]: 19/289 cut-off events. [2023-08-30 08:55:41,876 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 08:55:41,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 289 events. 19/289 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 520 event pairs, 0 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 189. Up to 4 conditions per place. [2023-08-30 08:55:41,884 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 275 transitions, 558 flow [2023-08-30 08:55:41,891 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 258 places, 271 transitions, 550 flow [2023-08-30 08:55:41,895 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 08:55:41,907 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 258 places, 271 transitions, 550 flow [2023-08-30 08:55:41,910 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 258 places, 271 transitions, 550 flow [2023-08-30 08:55:41,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 271 transitions, 550 flow [2023-08-30 08:55:41,961 INFO L130 PetriNetUnfolder]: 18/285 cut-off events. [2023-08-30 08:55:41,962 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 08:55:41,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 285 events. 18/285 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 506 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 189. Up to 4 conditions per place. [2023-08-30 08:55:41,970 INFO L119 LiptonReduction]: Number of co-enabled transitions 7968 [2023-08-30 08:55:49,330 INFO L134 LiptonReduction]: Checked pairs total: 8858 [2023-08-30 08:55:49,331 INFO L136 LiptonReduction]: Total number of compositions: 276 [2023-08-30 08:55:49,342 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 08:55:49,348 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;@783e4e87, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 08:55:49,348 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2023-08-30 08:55:49,350 INFO L130 PetriNetUnfolder]: 1/2 cut-off events. [2023-08-30 08:55:49,350 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 08:55:49,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:55:49,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 08:55:49,351 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:55:49,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:55:49,355 INFO L85 PathProgramCache]: Analyzing trace with hash 38518, now seen corresponding path program 1 times [2023-08-30 08:55:49,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:55:49,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804128352] [2023-08-30 08:55:49,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:55:49,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:55:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:55:49,776 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 08:55:49,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:55:49,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804128352] [2023-08-30 08:55:49,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804128352] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:55:49,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:55:49,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 08:55:49,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398215114] [2023-08-30 08:55:49,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:55:49,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 08:55:49,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:55:49,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 08:55:49,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 08:55:49,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 551 [2023-08-30 08:55:49,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 52 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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 08:55:49,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:55:49,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 551 [2023-08-30 08:55:49,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:55:49,943 INFO L130 PetriNetUnfolder]: 147/294 cut-off events. [2023-08-30 08:55:49,944 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 08:55:49,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 294 events. 147/294 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 986 event pairs, 110 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 566. Up to 293 conditions per place. [2023-08-30 08:55:49,947 INFO L137 encePairwiseOnDemand]: 540/551 looper letters, 40 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2023-08-30 08:55:49,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 174 flow [2023-08-30 08:55:49,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 08:55:49,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 08:55:49,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2023-08-30 08:55:49,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791288566243194 [2023-08-30 08:55:49,962 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 792 transitions. [2023-08-30 08:55:49,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 792 transitions. [2023-08-30 08:55:49,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:55:49,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 792 transitions. [2023-08-30 08:55:49,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 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 08:55:49,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 551.0) internal successors, (2204), 4 states have internal predecessors, (2204), 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 08:55:49,976 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 551.0) internal successors, (2204), 4 states have internal predecessors, (2204), 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 08:55:49,977 INFO L175 Difference]: Start difference. First operand has 46 places, 52 transitions, 112 flow. Second operand 3 states and 792 transitions. [2023-08-30 08:55:49,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 174 flow [2023-08-30 08:55:49,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 08:55:49,981 INFO L231 Difference]: Finished difference. Result has 40 places, 42 transitions, 94 flow [2023-08-30 08:55:49,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=551, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=40, PETRI_TRANSITIONS=42} [2023-08-30 08:55:49,985 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -6 predicate places. [2023-08-30 08:55:49,986 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 42 transitions, 94 flow [2023-08-30 08:55:49,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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 08:55:49,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:55:49,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 08:55:49,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 08:55:49,987 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:55:49,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:55:49,988 INFO L85 PathProgramCache]: Analyzing trace with hash 39024, now seen corresponding path program 1 times [2023-08-30 08:55:49,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:55:49,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033253895] [2023-08-30 08:55:49,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:55:49,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:55:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:55:50,049 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 08:55:50,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:55:50,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033253895] [2023-08-30 08:55:50,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033253895] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:55:50,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:55:50,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 08:55:50,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248280839] [2023-08-30 08:55:50,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:55:50,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 08:55:50,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:55:50,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 08:55:50,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 08:55:50,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 551 [2023-08-30 08:55:50,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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 08:55:50,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:55:50,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 551 [2023-08-30 08:55:50,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:55:50,252 INFO L130 PetriNetUnfolder]: 293/586 cut-off events. [2023-08-30 08:55:50,252 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 08:55:50,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 586 events. 293/586 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2519 event pairs, 220 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 1176. Up to 294 conditions per place. [2023-08-30 08:55:50,255 INFO L137 encePairwiseOnDemand]: 548/551 looper letters, 78 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2023-08-30 08:55:50,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 81 transitions, 338 flow [2023-08-30 08:55:50,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 08:55:50,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 08:55:50,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 822 transitions. [2023-08-30 08:55:50,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49727767695099817 [2023-08-30 08:55:50,258 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 822 transitions. [2023-08-30 08:55:50,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 822 transitions. [2023-08-30 08:55:50,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:55:50,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 822 transitions. [2023-08-30 08:55:50,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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 08:55:50,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 551.0) internal successors, (2204), 4 states have internal predecessors, (2204), 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 08:55:50,264 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 551.0) internal successors, (2204), 4 states have internal predecessors, (2204), 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 08:55:50,264 INFO L175 Difference]: Start difference. First operand has 40 places, 42 transitions, 94 flow. Second operand 3 states and 822 transitions. [2023-08-30 08:55:50,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 81 transitions, 338 flow [2023-08-30 08:55:50,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 81 transitions, 337 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 08:55:50,267 INFO L231 Difference]: Finished difference. Result has 42 places, 43 transitions, 105 flow [2023-08-30 08:55:50,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=551, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=42, PETRI_TRANSITIONS=43} [2023-08-30 08:55:50,268 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2023-08-30 08:55:50,268 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 43 transitions, 105 flow [2023-08-30 08:55:50,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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 08:55:50,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:55:50,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 08:55:50,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 08:55:50,269 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:55:50,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:55:50,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1213273, now seen corresponding path program 1 times [2023-08-30 08:55:50,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:55:50,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874826426] [2023-08-30 08:55:50,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:55:50,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:55:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:55:50,355 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 08:55:50,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:55:50,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874826426] [2023-08-30 08:55:50,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874826426] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:55:50,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084360947] [2023-08-30 08:55:50,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:55:50,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:55:50,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:55:50,365 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 08:55:50,376 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 08:55:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:55:50,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 08:55:50,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:55:50,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:55:50,535 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 08:55:50,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084360947] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:55:50,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 08:55:50,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2023-08-30 08:55:50,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036788714] [2023-08-30 08:55:50,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:55:50,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 08:55:50,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:55:50,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 08:55:50,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 08:55:50,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 551 [2023-08-30 08:55:50,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 43 transitions, 105 flow. Second operand has 4 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 08:55:50,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:55:50,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 551 [2023-08-30 08:55:50,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:55:50,752 INFO L130 PetriNetUnfolder]: 293/585 cut-off events. [2023-08-30 08:55:50,753 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 08:55:50,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 585 events. 293/585 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2515 event pairs, 220 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 1177. Up to 292 conditions per place. [2023-08-30 08:55:50,756 INFO L137 encePairwiseOnDemand]: 548/551 looper letters, 77 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2023-08-30 08:55:50,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 80 transitions, 341 flow [2023-08-30 08:55:50,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 08:55:50,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 08:55:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1068 transitions. [2023-08-30 08:55:50,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484573502722323 [2023-08-30 08:55:50,759 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1068 transitions. [2023-08-30 08:55:50,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1068 transitions. [2023-08-30 08:55:50,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:55:50,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1068 transitions. [2023-08-30 08:55:50,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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 08:55:50,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 551.0) internal successors, (2755), 5 states have internal predecessors, (2755), 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 08:55:50,766 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 551.0) internal successors, (2755), 5 states have internal predecessors, (2755), 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 08:55:50,766 INFO L175 Difference]: Start difference. First operand has 42 places, 43 transitions, 105 flow. Second operand 4 states and 1068 transitions. [2023-08-30 08:55:50,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 80 transitions, 341 flow [2023-08-30 08:55:50,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 80 transitions, 339 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 08:55:50,768 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 103 flow [2023-08-30 08:55:50,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=551, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2023-08-30 08:55:50,769 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2023-08-30 08:55:50,769 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 103 flow [2023-08-30 08:55:50,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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 08:55:50,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:55:50,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 08:55:50,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 08:55:50,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:55:50,977 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:55:50,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:55:50,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1166078042, now seen corresponding path program 1 times [2023-08-30 08:55:50,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:55:50,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359209444] [2023-08-30 08:55:50,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:55:50,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:55:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:55:51,061 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 08:55:51,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:55:51,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359209444] [2023-08-30 08:55:51,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359209444] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:55:51,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:55:51,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 08:55:51,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348958626] [2023-08-30 08:55:51,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:55:51,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 08:55:51,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:55:51,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 08:55:51,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 08:55:51,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 551 [2023-08-30 08:55:51,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 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 08:55:51,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:55:51,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 551 [2023-08-30 08:55:51,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:55:51,202 INFO L130 PetriNetUnfolder]: 147/294 cut-off events. [2023-08-30 08:55:51,202 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 08:55:51,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 294 events. 147/294 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 985 event pairs, 110 based on Foata normal form. 1/164 useless extension candidates. Maximal degree in co-relation 592. Up to 293 conditions per place. [2023-08-30 08:55:51,204 INFO L137 encePairwiseOnDemand]: 548/551 looper letters, 39 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-08-30 08:55:51,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 185 flow [2023-08-30 08:55:51,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 08:55:51,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 08:55:51,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 768 transitions. [2023-08-30 08:55:51,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4646098003629764 [2023-08-30 08:55:51,207 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 768 transitions. [2023-08-30 08:55:51,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 768 transitions. [2023-08-30 08:55:51,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:55:51,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 768 transitions. [2023-08-30 08:55:51,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 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 08:55:51,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 551.0) internal successors, (2204), 4 states have internal predecessors, (2204), 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 08:55:51,213 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 551.0) internal successors, (2204), 4 states have internal predecessors, (2204), 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 08:55:51,213 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 103 flow. Second operand 3 states and 768 transitions. [2023-08-30 08:55:51,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 185 flow [2023-08-30 08:55:51,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 180 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 08:55:51,215 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 106 flow [2023-08-30 08:55:51,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=551, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2023-08-30 08:55:51,216 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2023-08-30 08:55:51,216 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 106 flow [2023-08-30 08:55:51,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 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 08:55:51,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:55:51,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 08:55:51,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 08:55:51,217 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:55:51,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:55:51,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1788391633, now seen corresponding path program 1 times [2023-08-30 08:55:51,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:55:51,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119459489] [2023-08-30 08:55:51,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:55:51,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:55:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:55:51,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 08:55:51,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:55:51,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119459489] [2023-08-30 08:55:51,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119459489] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:55:51,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:55:51,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 08:55:51,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720530544] [2023-08-30 08:55:51,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:55:51,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 08:55:51,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:55:51,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 08:55:51,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 08:55:51,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 551 [2023-08-30 08:55:51,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 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 08:55:51,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:55:51,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 551 [2023-08-30 08:55:51,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:55:51,397 INFO L130 PetriNetUnfolder]: 91/211 cut-off events. [2023-08-30 08:55:51,397 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 08:55:51,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 211 events. 91/211 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 776 event pairs, 22 based on Foata normal form. 1/149 useless extension candidates. Maximal degree in co-relation 428. Up to 106 conditions per place. [2023-08-30 08:55:51,398 INFO L137 encePairwiseOnDemand]: 544/551 looper letters, 60 selfloop transitions, 3 changer transitions 3/67 dead transitions. [2023-08-30 08:55:51,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 67 transitions, 288 flow [2023-08-30 08:55:51,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 08:55:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 08:55:51,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 793 transitions. [2023-08-30 08:55:51,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47973381730187536 [2023-08-30 08:55:51,401 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 793 transitions. [2023-08-30 08:55:51,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 793 transitions. [2023-08-30 08:55:51,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:55:51,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 793 transitions. [2023-08-30 08:55:51,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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 08:55:51,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 551.0) internal successors, (2204), 4 states have internal predecessors, (2204), 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 08:55:51,407 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 551.0) internal successors, (2204), 4 states have internal predecessors, (2204), 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 08:55:51,407 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 106 flow. Second operand 3 states and 793 transitions. [2023-08-30 08:55:51,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 67 transitions, 288 flow [2023-08-30 08:55:51,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 67 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 08:55:51,410 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 93 flow [2023-08-30 08:55:51,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=551, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2023-08-30 08:55:51,411 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -6 predicate places. [2023-08-30 08:55:51,411 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 93 flow [2023-08-30 08:55:51,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 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 08:55:51,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:55:51,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:55:51,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 08:55:51,412 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:55:51,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:55:51,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1289355177, now seen corresponding path program 1 times [2023-08-30 08:55:51,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:55:51,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861975627] [2023-08-30 08:55:51,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:55:51,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:55:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:55:51,548 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 08:55:51,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:55:51,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861975627] [2023-08-30 08:55:51,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861975627] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:55:51,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023530406] [2023-08-30 08:55:51,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:55:51,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:55:51,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:55:51,550 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 08:55:51,558 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 08:55:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:55:51,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 08:55:51,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:55:51,720 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 08:55:51,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:55:51,738 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 08:55:51,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023530406] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:55:51,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:55:51,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2023-08-30 08:55:51,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939695256] [2023-08-30 08:55:51,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:55:51,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 08:55:51,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:55:51,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 08:55:51,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-08-30 08:55:51,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 551 [2023-08-30 08:55:51,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 93 flow. Second operand has 8 states, 8 states have (on average 242.5) internal successors, (1940), 8 states have internal predecessors, (1940), 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 08:55:51,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:55:51,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 551 [2023-08-30 08:55:51,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:55:51,937 INFO L130 PetriNetUnfolder]: 88/182 cut-off events. [2023-08-30 08:55:51,938 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2023-08-30 08:55:51,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 182 events. 88/182 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 486 event pairs, 63 based on Foata normal form. 1/147 useless extension candidates. Maximal degree in co-relation 414. Up to 180 conditions per place. [2023-08-30 08:55:51,940 INFO L137 encePairwiseOnDemand]: 548/551 looper letters, 33 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2023-08-30 08:55:51,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 169 flow [2023-08-30 08:55:51,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 08:55:51,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 08:55:51,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 997 transitions. [2023-08-30 08:55:51,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45235934664246824 [2023-08-30 08:55:51,944 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 997 transitions. [2023-08-30 08:55:51,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 997 transitions. [2023-08-30 08:55:51,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:55:51,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 997 transitions. [2023-08-30 08:55:51,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 249.25) internal successors, (997), 4 states have internal predecessors, (997), 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 08:55:51,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 551.0) internal successors, (2755), 5 states have internal predecessors, (2755), 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 08:55:51,951 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 551.0) internal successors, (2755), 5 states have internal predecessors, (2755), 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 08:55:51,951 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 93 flow. Second operand 4 states and 997 transitions. [2023-08-30 08:55:51,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 169 flow [2023-08-30 08:55:51,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 08:55:51,953 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 106 flow [2023-08-30 08:55:51,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=551, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-08-30 08:55:51,956 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2023-08-30 08:55:51,956 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 106 flow [2023-08-30 08:55:51,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 242.5) internal successors, (1940), 8 states have internal predecessors, (1940), 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 08:55:51,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:55:51,958 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:55:51,967 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 08:55:52,167 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,SelfDestructingSolverStorable5 [2023-08-30 08:55:52,167 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:55:52,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:55:52,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1801595630, now seen corresponding path program 2 times [2023-08-30 08:55:52,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:55:52,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869467971] [2023-08-30 08:55:52,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:55:52,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:55:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:55:53,294 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 08:55:53,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:55:53,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869467971] [2023-08-30 08:55:53,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869467971] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:55:53,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132131268] [2023-08-30 08:55:53,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 08:55:53,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:55:53,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:55:53,296 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 08:55:53,323 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 08:55:53,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 08:55:53,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 08:55:53,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 08:55:53,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:55:53,596 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-30 08:55:53,596 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 1 case distinctions, treesize of input 19 treesize of output 22 [2023-08-30 08:55:53,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:55:53,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-30 08:55:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 08:55:53,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 08:55:53,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132131268] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:55:53,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 08:55:53,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 14 [2023-08-30 08:55:53,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315031241] [2023-08-30 08:55:53,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:55:53,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 08:55:53,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:55:53,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 08:55:53,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2023-08-30 08:55:53,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 551 [2023-08-30 08:55:53,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 106 flow. Second operand has 8 states, 8 states have (on average 237.75) internal successors, (1902), 8 states have internal predecessors, (1902), 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 08:55:53,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:55:53,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 551 [2023-08-30 08:55:53,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:55:54,162 INFO L130 PetriNetUnfolder]: 90/195 cut-off events. [2023-08-30 08:55:54,162 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2023-08-30 08:55:54,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 195 events. 90/195 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 589 event pairs, 41 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 422. Up to 139 conditions per place. [2023-08-30 08:55:54,164 INFO L137 encePairwiseOnDemand]: 540/551 looper letters, 45 selfloop transitions, 12 changer transitions 0/58 dead transitions. [2023-08-30 08:55:54,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 270 flow [2023-08-30 08:55:54,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 08:55:54,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 08:55:54,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1945 transitions. [2023-08-30 08:55:54,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4412431941923775 [2023-08-30 08:55:54,168 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1945 transitions. [2023-08-30 08:55:54,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1945 transitions. [2023-08-30 08:55:54,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:55:54,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1945 transitions. [2023-08-30 08:55:54,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 243.125) internal successors, (1945), 8 states have internal predecessors, (1945), 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 08:55:54,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 551.0) internal successors, (4959), 9 states have internal predecessors, (4959), 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 08:55:54,181 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 551.0) internal successors, (4959), 9 states have internal predecessors, (4959), 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 08:55:54,181 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 106 flow. Second operand 8 states and 1945 transitions. [2023-08-30 08:55:54,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 270 flow [2023-08-30 08:55:54,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 262 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 08:55:54,184 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 181 flow [2023-08-30 08:55:54,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=551, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=181, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2023-08-30 08:55:54,185 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2023-08-30 08:55:54,185 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 181 flow [2023-08-30 08:55:54,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 237.75) internal successors, (1902), 8 states have internal predecessors, (1902), 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 08:55:54,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:55:54,186 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:55:54,199 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 08:55:54,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:55:54,393 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:55:54,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:55:54,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1801595629, now seen corresponding path program 1 times [2023-08-30 08:55:54,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:55:54,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808742196] [2023-08-30 08:55:54,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:55:54,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:55:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:55:54,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 08:55:54,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:55:54,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808742196] [2023-08-30 08:55:54,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808742196] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:55:54,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:55:54,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 08:55:54,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133739855] [2023-08-30 08:55:54,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:55:54,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 08:55:54,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:55:54,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 08:55:54,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 08:55:55,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 551 [2023-08-30 08:55:55,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 241.8) internal successors, (1209), 5 states have internal predecessors, (1209), 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 08:55:55,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:55:55,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 551 [2023-08-30 08:55:55,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:55:55,233 INFO L130 PetriNetUnfolder]: 159/338 cut-off events. [2023-08-30 08:55:55,234 INFO L131 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2023-08-30 08:55:55,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 338 events. 159/338 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1235 event pairs, 27 based on Foata normal form. 4/319 useless extension candidates. Maximal degree in co-relation 895. Up to 137 conditions per place. [2023-08-30 08:55:55,236 INFO L137 encePairwiseOnDemand]: 541/551 looper letters, 67 selfloop transitions, 20 changer transitions 0/88 dead transitions. [2023-08-30 08:55:55,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 88 transitions, 491 flow [2023-08-30 08:55:55,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 08:55:55,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 08:55:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1272 transitions. [2023-08-30 08:55:55,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4617059891107078 [2023-08-30 08:55:55,240 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1272 transitions. [2023-08-30 08:55:55,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1272 transitions. [2023-08-30 08:55:55,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:55:55,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1272 transitions. [2023-08-30 08:55:55,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 254.4) internal successors, (1272), 5 states have internal predecessors, (1272), 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 08:55:55,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 551.0) internal successors, (3306), 6 states have internal predecessors, (3306), 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 08:55:55,248 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 551.0) internal successors, (3306), 6 states have internal predecessors, (3306), 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 08:55:55,248 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 181 flow. Second operand 5 states and 1272 transitions. [2023-08-30 08:55:55,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 88 transitions, 491 flow [2023-08-30 08:55:55,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 88 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 08:55:55,251 INFO L231 Difference]: Finished difference. Result has 57 places, 61 transitions, 338 flow [2023-08-30 08:55:55,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=551, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=338, PETRI_PLACES=57, PETRI_TRANSITIONS=61} [2023-08-30 08:55:55,251 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2023-08-30 08:55:55,252 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 61 transitions, 338 flow [2023-08-30 08:55:55,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 241.8) internal successors, (1209), 5 states have internal predecessors, (1209), 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 08:55:55,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:55:55,252 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:55:55,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 08:55:55,253 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:55:55,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:55:55,253 INFO L85 PathProgramCache]: Analyzing trace with hash -745237774, now seen corresponding path program 1 times [2023-08-30 08:55:55,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:55:55,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301355071] [2023-08-30 08:55:55,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:55:55,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:55:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:55:55,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 08:55:55,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:55:55,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301355071] [2023-08-30 08:55:55,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301355071] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:55:55,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:55:55,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 08:55:55,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288384856] [2023-08-30 08:55:55,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:55:55,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 08:55:55,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:55:55,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 08:55:55,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-08-30 08:55:56,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 551 [2023-08-30 08:55:56,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 61 transitions, 338 flow. Second operand has 9 states, 9 states have (on average 231.77777777777777) internal successors, (2086), 9 states have internal predecessors, (2086), 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 08:55:56,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:55:56,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 551 [2023-08-30 08:55:56,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:55:56,804 INFO L130 PetriNetUnfolder]: 168/355 cut-off events. [2023-08-30 08:55:56,804 INFO L131 PetriNetUnfolder]: For 399/399 co-relation queries the response was YES. [2023-08-30 08:55:56,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1151 conditions, 355 events. 168/355 cut-off events. For 399/399 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1230 event pairs, 22 based on Foata normal form. 4/345 useless extension candidates. Maximal degree in co-relation 1129. Up to 214 conditions per place. [2023-08-30 08:55:56,806 INFO L137 encePairwiseOnDemand]: 541/551 looper letters, 57 selfloop transitions, 18 changer transitions 0/76 dead transitions. [2023-08-30 08:55:56,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 76 transitions, 550 flow [2023-08-30 08:55:56,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 08:55:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 08:55:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1663 transitions. [2023-08-30 08:55:56,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4311641171895255 [2023-08-30 08:55:56,811 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1663 transitions. [2023-08-30 08:55:56,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1663 transitions. [2023-08-30 08:55:56,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:55:56,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1663 transitions. [2023-08-30 08:55:56,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 237.57142857142858) internal successors, (1663), 7 states have internal predecessors, (1663), 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 08:55:56,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 551.0) internal successors, (4408), 8 states have internal predecessors, (4408), 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 08:55:56,833 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 551.0) internal successors, (4408), 8 states have internal predecessors, (4408), 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 08:55:56,833 INFO L175 Difference]: Start difference. First operand has 57 places, 61 transitions, 338 flow. Second operand 7 states and 1663 transitions. [2023-08-30 08:55:56,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 76 transitions, 550 flow [2023-08-30 08:55:56,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 76 transitions, 550 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 08:55:56,839 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 413 flow [2023-08-30 08:55:56,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=551, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=413, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2023-08-30 08:55:56,840 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 20 predicate places. [2023-08-30 08:55:56,840 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 413 flow [2023-08-30 08:55:56,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 231.77777777777777) internal successors, (2086), 9 states have internal predecessors, (2086), 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 08:55:56,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:55:56,842 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:55:56,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 08:55:56,842 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:55:56,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:55:56,843 INFO L85 PathProgramCache]: Analyzing trace with hash -771155943, now seen corresponding path program 1 times [2023-08-30 08:55:56,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:55:56,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012116214] [2023-08-30 08:55:56,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:55:56,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:55:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:55:57,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 08:55:57,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:55:57,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012116214] [2023-08-30 08:55:57,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012116214] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:55:57,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:55:57,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 08:55:57,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164338487] [2023-08-30 08:55:57,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:55:57,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 08:55:57,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:55:57,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 08:55:57,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 08:55:57,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 551 [2023-08-30 08:55:57,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 413 flow. Second operand has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 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 08:55:57,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:55:57,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 551 [2023-08-30 08:55:57,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:55:58,000 INFO L130 PetriNetUnfolder]: 181/417 cut-off events. [2023-08-30 08:55:58,001 INFO L131 PetriNetUnfolder]: For 661/661 co-relation queries the response was YES. [2023-08-30 08:55:58,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 417 events. 181/417 cut-off events. For 661/661 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1745 event pairs, 41 based on Foata normal form. 1/406 useless extension candidates. Maximal degree in co-relation 1435. Up to 143 conditions per place. [2023-08-30 08:55:58,003 INFO L137 encePairwiseOnDemand]: 541/551 looper letters, 87 selfloop transitions, 23 changer transitions 0/111 dead transitions. [2023-08-30 08:55:58,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 111 transitions, 918 flow [2023-08-30 08:55:58,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 08:55:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 08:55:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1468 transitions. [2023-08-30 08:55:58,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4440411373260738 [2023-08-30 08:55:58,008 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1468 transitions. [2023-08-30 08:55:58,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1468 transitions. [2023-08-30 08:55:58,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:55:58,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1468 transitions. [2023-08-30 08:55:58,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 244.66666666666666) internal successors, (1468), 6 states have internal predecessors, (1468), 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 08:55:58,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 551.0) internal successors, (3857), 7 states have internal predecessors, (3857), 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 08:55:58,016 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 551.0) internal successors, (3857), 7 states have internal predecessors, (3857), 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 08:55:58,016 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 413 flow. Second operand 6 states and 1468 transitions. [2023-08-30 08:55:58,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 111 transitions, 918 flow [2023-08-30 08:55:58,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 111 transitions, 893 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 08:55:58,021 INFO L231 Difference]: Finished difference. Result has 72 places, 73 transitions, 592 flow [2023-08-30 08:55:58,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=551, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=592, PETRI_PLACES=72, PETRI_TRANSITIONS=73} [2023-08-30 08:55:58,022 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 26 predicate places. [2023-08-30 08:55:58,022 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 73 transitions, 592 flow [2023-08-30 08:55:58,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 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 08:55:58,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:55:58,023 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:55:58,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 08:55:58,023 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:55:58,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:55:58,024 INFO L85 PathProgramCache]: Analyzing trace with hash -744297543, now seen corresponding path program 2 times [2023-08-30 08:55:58,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:55:58,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943065238] [2023-08-30 08:55:58,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:55:58,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:55:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:55:58,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 08:55:58,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:55:58,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943065238] [2023-08-30 08:55:58,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943065238] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:55:58,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540142072] [2023-08-30 08:55:58,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 08:55:58,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:55:58,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:55:58,566 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 08:55:58,569 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 08:55:58,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 08:55:58,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 08:55:58,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 115 conjunts are in the unsatisfiable core [2023-08-30 08:55:58,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:55:58,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:55:58,756 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 0 case distinctions, treesize of input 14 treesize of output 15 [2023-08-30 08:55:58,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-30 08:55:58,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-30 08:55:58,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-30 08:55:58,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:55:58,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-30 08:55:59,143 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-08-30 08:55:59,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 35 [2023-08-30 08:55:59,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-08-30 08:55:59,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:55:59,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 08:55:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:55:59,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:56:12,057 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_254 Int) (v_ArrVal_252 Int) (v_ArrVal_250 Int) (v_ArrVal_251 (Array Int Int)) (|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_41| Int) (v_ArrVal_256 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_~#stack~0.base| (store (select |c_#memory_int| |c_~#stack~0.base|) (+ (* |c_ULTIMATE.start_Init_~pushCount#1| 8) (- 4) |c_~#stack~0.offset|) v_ArrVal_250)) |c_~#threads~0.base| v_ArrVal_251))) (let ((.cse1 (select .cse0 |c_~#stack~0.base|)) (.cse2 (+ |c_~#stack~0.offset| 24))) (or (< (select (select (store (store .cse0 |c_~#stack~0.base| (store (store .cse1 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_41| v_ArrVal_252) .cse2 v_ArrVal_254)) |c_~#threads~0.base| v_ArrVal_256) |c_~#stack~0.base|) (+ |c_~#stack~0.offset| 28)) 2147483649) (< (+ (* 8 (select .cse1 .cse2)) |c_~#stack~0.offset| 4) |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_41|))))) is different from false [2023-08-30 08:56:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-30 08:56:30,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540142072] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:56:30,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:56:30,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 12] total 28 [2023-08-30 08:56:30,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082237074] [2023-08-30 08:56:30,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:56:30,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 08:56:30,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:56:30,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 08:56:30,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=637, Unknown=41, NotChecked=54, Total=870 [2023-08-30 08:56:32,458 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 08:56:34,744 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 08:56:36,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 [1] [2023-08-30 08:56:36,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 551 [2023-08-30 08:56:36,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 592 flow. Second operand has 30 states, 30 states have (on average 152.66666666666666) internal successors, (4580), 30 states have internal predecessors, (4580), 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 08:56:36,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:56:36,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 551 [2023-08-30 08:56:36,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:56:52,562 WARN L222 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 83 DAG size of output: 80 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 08:57:05,506 WARN L222 SmtUtils]: Spent 8.24s on a formula simplification. DAG size of input: 84 DAG size of output: 81 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 08:57:15,902 WARN L222 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 94 DAG size of output: 85 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 08:57:33,553 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 08:57:47,094 WARN L222 SmtUtils]: Spent 6.34s on a formula simplification. DAG size of input: 112 DAG size of output: 85 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 08:58:06,674 WARN L222 SmtUtils]: Spent 10.22s on a formula simplification. DAG size of input: 95 DAG size of output: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 08:58:16,954 WARN L222 SmtUtils]: Spent 9.90s on a formula simplification. DAG size of input: 102 DAG size of output: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 08:58:25,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:58:27,725 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 08:58:29,746 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 08:58:34,582 INFO L130 PetriNetUnfolder]: 266/622 cut-off events. [2023-08-30 08:58:34,582 INFO L131 PetriNetUnfolder]: For 1788/1788 co-relation queries the response was YES. [2023-08-30 08:58:34,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2458 conditions, 622 events. 266/622 cut-off events. For 1788/1788 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3121 event pairs, 15 based on Foata normal form. 21/631 useless extension candidates. Maximal degree in co-relation 2427. Up to 118 conditions per place. [2023-08-30 08:58:34,587 INFO L137 encePairwiseOnDemand]: 531/551 looper letters, 128 selfloop transitions, 112 changer transitions 0/241 dead transitions. [2023-08-30 08:58:34,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 241 transitions, 2245 flow [2023-08-30 08:58:34,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-30 08:58:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-30 08:58:34,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 5940 transitions. [2023-08-30 08:58:34,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28369471773808386 [2023-08-30 08:58:34,603 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 5940 transitions. [2023-08-30 08:58:34,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 5940 transitions. [2023-08-30 08:58:34,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:58:34,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 5940 transitions. [2023-08-30 08:58:34,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 156.31578947368422) internal successors, (5940), 38 states have internal predecessors, (5940), 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 08:58:34,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 551.0) internal successors, (21489), 39 states have internal predecessors, (21489), 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 08:58:34,641 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 551.0) internal successors, (21489), 39 states have internal predecessors, (21489), 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 08:58:34,641 INFO L175 Difference]: Start difference. First operand has 72 places, 73 transitions, 592 flow. Second operand 38 states and 5940 transitions. [2023-08-30 08:58:34,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 241 transitions, 2245 flow [2023-08-30 08:58:34,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 241 transitions, 2228 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-30 08:58:34,654 INFO L231 Difference]: Finished difference. Result has 129 places, 170 transitions, 1899 flow [2023-08-30 08:58:34,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=551, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=1899, PETRI_PLACES=129, PETRI_TRANSITIONS=170} [2023-08-30 08:58:34,655 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 83 predicate places. [2023-08-30 08:58:34,655 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 170 transitions, 1899 flow [2023-08-30 08:58:34,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 152.66666666666666) internal successors, (4580), 30 states have internal predecessors, (4580), 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 08:58:34,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:58:34,657 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:58:34,665 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 08:58:34,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:58:34,863 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:58:34,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:58:34,863 INFO L85 PathProgramCache]: Analyzing trace with hash 351019813, now seen corresponding path program 1 times [2023-08-30 08:58:34,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:58:34,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911405798] [2023-08-30 08:58:34,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:58:34,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:58:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:58:35,191 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 08:58:35,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:58:35,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911405798] [2023-08-30 08:58:35,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911405798] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:58:35,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:58:35,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 08:58:35,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254975695] [2023-08-30 08:58:35,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:58:35,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 08:58:35,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:58:35,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 08:58:35,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 08:58:35,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 551 [2023-08-30 08:58:35,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 170 transitions, 1899 flow. Second operand has 6 states, 6 states have (on average 228.66666666666666) internal successors, (1372), 6 states have internal predecessors, (1372), 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 08:58:35,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:58:35,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 551 [2023-08-30 08:58:35,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:58:36,293 INFO L130 PetriNetUnfolder]: 291/720 cut-off events. [2023-08-30 08:58:36,293 INFO L131 PetriNetUnfolder]: For 3986/3986 co-relation queries the response was YES. [2023-08-30 08:58:36,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3581 conditions, 720 events. 291/720 cut-off events. For 3986/3986 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3511 event pairs, 23 based on Foata normal form. 19/727 useless extension candidates. Maximal degree in co-relation 3527. Up to 303 conditions per place. [2023-08-30 08:58:36,301 INFO L137 encePairwiseOnDemand]: 540/551 looper letters, 133 selfloop transitions, 88 changer transitions 0/222 dead transitions. [2023-08-30 08:58:36,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 222 transitions, 2725 flow [2023-08-30 08:58:36,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 08:58:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 08:58:36,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1643 transitions. [2023-08-30 08:58:36,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42597873995333163 [2023-08-30 08:58:36,306 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1643 transitions. [2023-08-30 08:58:36,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1643 transitions. [2023-08-30 08:58:36,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:58:36,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1643 transitions. [2023-08-30 08:58:36,309 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 08:58:36,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 551.0) internal successors, (4408), 8 states have internal predecessors, (4408), 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 08:58:36,314 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 551.0) internal successors, (4408), 8 states have internal predecessors, (4408), 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 08:58:36,314 INFO L175 Difference]: Start difference. First operand has 129 places, 170 transitions, 1899 flow. Second operand 7 states and 1643 transitions. [2023-08-30 08:58:36,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 222 transitions, 2725 flow [2023-08-30 08:58:36,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 222 transitions, 2636 flow, removed 40 selfloop flow, removed 5 redundant places. [2023-08-30 08:58:36,335 INFO L231 Difference]: Finished difference. Result has 136 places, 194 transitions, 2431 flow [2023-08-30 08:58:36,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=551, PETRI_DIFFERENCE_MINUEND_FLOW=1632, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2431, PETRI_PLACES=136, PETRI_TRANSITIONS=194} [2023-08-30 08:58:36,337 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 90 predicate places. [2023-08-30 08:58:36,337 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 194 transitions, 2431 flow [2023-08-30 08:58:36,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 228.66666666666666) internal successors, (1372), 6 states have internal predecessors, (1372), 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 08:58:36,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:58:36,338 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:58:36,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 08:58:36,338 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:58:36,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:58:36,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1891548189, now seen corresponding path program 1 times [2023-08-30 08:58:36,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:58:36,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579465660] [2023-08-30 08:58:36,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:58:36,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:58:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:58:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 08:58:37,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:58:37,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579465660] [2023-08-30 08:58:37,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579465660] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:58:37,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:58:37,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-08-30 08:58:37,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735390429] [2023-08-30 08:58:37,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:58:37,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 08:58:37,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:58:37,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 08:58:37,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2023-08-30 08:58:40,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 551 [2023-08-30 08:58:40,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 194 transitions, 2431 flow. Second operand has 14 states, 14 states have (on average 210.57142857142858) internal successors, (2948), 14 states have internal predecessors, (2948), 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 08:58:40,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:58:40,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 551 [2023-08-30 08:58:40,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:58:46,482 INFO L130 PetriNetUnfolder]: 448/1089 cut-off events. [2023-08-30 08:58:46,482 INFO L131 PetriNetUnfolder]: For 7686/7686 co-relation queries the response was YES. [2023-08-30 08:58:46,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6218 conditions, 1089 events. 448/1089 cut-off events. For 7686/7686 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5927 event pairs, 0 based on Foata normal form. 0/1064 useless extension candidates. Maximal degree in co-relation 6162. Up to 187 conditions per place. [2023-08-30 08:58:46,494 INFO L137 encePairwiseOnDemand]: 530/551 looper letters, 317 selfloop transitions, 222 changer transitions 0/540 dead transitions. [2023-08-30 08:58:46,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 540 transitions, 6857 flow [2023-08-30 08:58:46,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-08-30 08:58:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2023-08-30 08:58:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 13248 transitions. [2023-08-30 08:58:46,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38779930917393596 [2023-08-30 08:58:46,524 INFO L72 ComplementDD]: Start complementDD. Operand 62 states and 13248 transitions. [2023-08-30 08:58:46,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 13248 transitions. [2023-08-30 08:58:46,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:58:46,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 62 states and 13248 transitions. [2023-08-30 08:58:46,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 63 states, 62 states have (on average 213.67741935483872) internal successors, (13248), 62 states have internal predecessors, (13248), 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 08:58:46,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 63 states, 63 states have (on average 551.0) internal successors, (34713), 63 states have internal predecessors, (34713), 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 08:58:46,581 INFO L81 ComplementDD]: Finished complementDD. Result has 63 states, 63 states have (on average 551.0) internal successors, (34713), 63 states have internal predecessors, (34713), 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 08:58:46,581 INFO L175 Difference]: Start difference. First operand has 136 places, 194 transitions, 2431 flow. Second operand 62 states and 13248 transitions. [2023-08-30 08:58:46,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 540 transitions, 6857 flow [2023-08-30 08:58:46,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 540 transitions, 6811 flow, removed 23 selfloop flow, removed 0 redundant places. [2023-08-30 08:58:46,624 INFO L231 Difference]: Finished difference. Result has 211 places, 350 transitions, 4638 flow [2023-08-30 08:58:46,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=551, PETRI_DIFFERENCE_MINUEND_FLOW=2405, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=4638, PETRI_PLACES=211, PETRI_TRANSITIONS=350} [2023-08-30 08:58:46,625 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 165 predicate places. [2023-08-30 08:58:46,625 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 350 transitions, 4638 flow [2023-08-30 08:58:46,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 210.57142857142858) internal successors, (2948), 14 states have internal predecessors, (2948), 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 08:58:46,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:58:46,626 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:58:46,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 08:58:46,626 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:58:46,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:58:46,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1891548190, now seen corresponding path program 1 times [2023-08-30 08:58:46,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:58:46,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193642937] [2023-08-30 08:58:46,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:58:46,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:58:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:58:47,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 08:58:47,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:58:47,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193642937] [2023-08-30 08:58:47,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193642937] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:58:47,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:58:47,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 08:58:47,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815545078] [2023-08-30 08:58:47,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:58:47,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 08:58:47,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:58:47,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 08:58:47,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-30 08:58:48,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 551 [2023-08-30 08:58:48,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 350 transitions, 4638 flow. Second operand has 9 states, 9 states have (on average 231.44444444444446) internal successors, (2083), 9 states have internal predecessors, (2083), 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 08:58:48,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:58:48,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 551 [2023-08-30 08:58:48,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:58:50,559 INFO L130 PetriNetUnfolder]: 702/1614 cut-off events. [2023-08-30 08:58:50,559 INFO L131 PetriNetUnfolder]: For 15562/15562 co-relation queries the response was YES. [2023-08-30 08:58:50,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10545 conditions, 1614 events. 702/1614 cut-off events. For 15562/15562 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 8833 event pairs, 20 based on Foata normal form. 5/1609 useless extension candidates. Maximal degree in co-relation 10473. Up to 368 conditions per place. [2023-08-30 08:58:50,577 INFO L137 encePairwiseOnDemand]: 536/551 looper letters, 369 selfloop transitions, 232 changer transitions 0/602 dead transitions. [2023-08-30 08:58:50,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 602 transitions, 8816 flow [2023-08-30 08:58:50,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-30 08:58:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-30 08:58:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 8023 transitions. [2023-08-30 08:58:50,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42825878082630514 [2023-08-30 08:58:50,587 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 8023 transitions. [2023-08-30 08:58:50,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 8023 transitions. [2023-08-30 08:58:50,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:58:50,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 8023 transitions. [2023-08-30 08:58:50,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 235.97058823529412) internal successors, (8023), 34 states have internal predecessors, (8023), 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 08:58:50,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 551.0) internal successors, (19285), 35 states have internal predecessors, (19285), 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 08:58:50,613 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 551.0) internal successors, (19285), 35 states have internal predecessors, (19285), 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 08:58:50,613 INFO L175 Difference]: Start difference. First operand has 211 places, 350 transitions, 4638 flow. Second operand 34 states and 8023 transitions. [2023-08-30 08:58:50,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 602 transitions, 8816 flow [2023-08-30 08:58:50,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 602 transitions, 8395 flow, removed 158 selfloop flow, removed 7 redundant places. [2023-08-30 08:58:50,701 INFO L231 Difference]: Finished difference. Result has 246 places, 434 transitions, 6450 flow [2023-08-30 08:58:50,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=551, PETRI_DIFFERENCE_MINUEND_FLOW=4352, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=6450, PETRI_PLACES=246, PETRI_TRANSITIONS=434} [2023-08-30 08:58:50,702 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 200 predicate places. [2023-08-30 08:58:50,702 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 434 transitions, 6450 flow [2023-08-30 08:58:50,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 231.44444444444446) internal successors, (2083), 9 states have internal predecessors, (2083), 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 08:58:50,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:58:50,703 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:58:50,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 08:58:50,704 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:58:50,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:58:50,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1539433171, now seen corresponding path program 1 times [2023-08-30 08:58:50,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:58:50,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655674304] [2023-08-30 08:58:50,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:58:50,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:58:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:58:51,532 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-30 08:58:51,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:58:51,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655674304] [2023-08-30 08:58:51,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655674304] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:58:51,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106941985] [2023-08-30 08:58:51,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:58:51,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:58:51,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:58:51,536 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 08:58:51,538 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 08:58:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:58:51,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 66 conjunts are in the unsatisfiable core [2023-08-30 08:58:51,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:58:51,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-08-30 08:58:51,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 08:58:51,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:58:51,833 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 19 treesize of output 18 [2023-08-30 08:58:51,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:58:51,910 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 19 treesize of output 18 [2023-08-30 08:58:51,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:58:51,975 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 19 treesize of output 18 [2023-08-30 08:58:52,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:58:52,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 08:58:52,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-30 08:58:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:58:52,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:58:52,462 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_atomic_store_~obj#1.offset_94| Int) (v_ArrVal_421 Int) (v_ArrVal_422 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_~#stack~0.base| (store (select |c_#memory_int| |c_~#stack~0.base|) |v_ULTIMATE.start_atomic_store_~obj#1.offset_94| v_ArrVal_421)) |c_~#threads~0.base| v_ArrVal_422) |c_~#stack~0.base|) (+ |c_~#stack~0.offset| 24)) 1)) (< (+ (* |c_ULTIMATE.start_Init_~pushCount#1| 8) |c_~#stack~0.offset|) (+ |v_ULTIMATE.start_atomic_store_~obj#1.offset_94| 4)))) is different from false [2023-08-30 08:58:52,487 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_atomic_store_~obj#1.offset_95| Int) (|v_ULTIMATE.start_atomic_store_~obj#1.offset_94| Int) (v_ArrVal_421 Int) (v_ArrVal_418 Int) (v_ArrVal_422 (Array Int Int))) (or (< (+ (* |c_ULTIMATE.start_Init_~pushCount#1| 8) |c_~#stack~0.offset|) (+ |v_ULTIMATE.start_atomic_store_~obj#1.offset_94| 4)) (< (+ |c_~#stack~0.offset| 4 (* |c_ULTIMATE.start_Init_~i~0#1| 8)) |v_ULTIMATE.start_atomic_store_~obj#1.offset_95|) (< 0 (+ 1 (select (select (store (store |c_#memory_int| |c_~#stack~0.base| (store (store (select |c_#memory_int| |c_~#stack~0.base|) |v_ULTIMATE.start_atomic_store_~obj#1.offset_95| v_ArrVal_418) |v_ULTIMATE.start_atomic_store_~obj#1.offset_94| v_ArrVal_421)) |c_~#threads~0.base| v_ArrVal_422) |c_~#stack~0.base|) (+ |c_~#stack~0.offset| 24)))))) is different from false [2023-08-30 08:58:52,534 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_atomic_store_~obj#1.offset_96| Int) (|v_ULTIMATE.start_atomic_store_~obj#1.offset_95| Int) (|v_ULTIMATE.start_atomic_store_~obj#1.offset_94| Int) (v_ArrVal_421 Int) (v_ArrVal_418 Int) (v_ArrVal_416 Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse0 (* |c_ULTIMATE.start_Init_~i~0#1| 8))) (or (< (+ |c_~#stack~0.offset| 4 .cse0) |v_ULTIMATE.start_atomic_store_~obj#1.offset_96|) (< 0 (+ (select (select (store (store |c_#memory_int| |c_~#stack~0.base| (store (store (store (select |c_#memory_int| |c_~#stack~0.base|) |v_ULTIMATE.start_atomic_store_~obj#1.offset_96| v_ArrVal_416) |v_ULTIMATE.start_atomic_store_~obj#1.offset_95| v_ArrVal_418) |v_ULTIMATE.start_atomic_store_~obj#1.offset_94| v_ArrVal_421)) |c_~#threads~0.base| v_ArrVal_422) |c_~#stack~0.base|) (+ |c_~#stack~0.offset| 24)) 1)) (< (+ (* |c_ULTIMATE.start_Init_~pushCount#1| 8) |c_~#stack~0.offset|) (+ |v_ULTIMATE.start_atomic_store_~obj#1.offset_94| 4)) (< (+ 12 |c_~#stack~0.offset| .cse0) |v_ULTIMATE.start_atomic_store_~obj#1.offset_95|)))) is different from false [2023-08-30 08:58:52,537 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-30 08:58:52,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106941985] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:58:52,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:58:52,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 25 [2023-08-30 08:58:52,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334375743] [2023-08-30 08:58:52,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:58:52,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-30 08:58:52,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:58:52,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-30 08:58:52,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=425, Unknown=7, NotChecked=132, Total=650 [2023-08-30 08:58:52,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 551 [2023-08-30 08:58:52,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 434 transitions, 6450 flow. Second operand has 26 states, 26 states have (on average 165.34615384615384) internal successors, (4299), 26 states have internal predecessors, (4299), 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 08:58:52,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:58:52,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 551 [2023-08-30 08:58:52,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:59:07,336 INFO L130 PetriNetUnfolder]: 740/1727 cut-off events. [2023-08-30 08:59:07,337 INFO L131 PetriNetUnfolder]: For 16656/16656 co-relation queries the response was YES. [2023-08-30 08:59:07,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11076 conditions, 1727 events. 740/1727 cut-off events. For 16656/16656 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9758 event pairs, 22 based on Foata normal form. 9/1716 useless extension candidates. Maximal degree in co-relation 10999. Up to 363 conditions per place. [2023-08-30 08:59:07,356 INFO L137 encePairwiseOnDemand]: 533/551 looper letters, 438 selfloop transitions, 152 changer transitions 0/591 dead transitions. [2023-08-30 08:59:07,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 591 transitions, 8866 flow [2023-08-30 08:59:07,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-08-30 08:59:07,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-08-30 08:59:07,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 5364 transitions. [2023-08-30 08:59:07,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30421960072595283 [2023-08-30 08:59:07,364 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 5364 transitions. [2023-08-30 08:59:07,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 5364 transitions. [2023-08-30 08:59:07,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:59:07,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 5364 transitions. [2023-08-30 08:59:07,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 167.625) internal successors, (5364), 32 states have internal predecessors, (5364), 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 08:59:07,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 551.0) internal successors, (18183), 33 states have internal predecessors, (18183), 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 08:59:07,386 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 551.0) internal successors, (18183), 33 states have internal predecessors, (18183), 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 08:59:07,386 INFO L175 Difference]: Start difference. First operand has 246 places, 434 transitions, 6450 flow. Second operand 32 states and 5364 transitions. [2023-08-30 08:59:07,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 591 transitions, 8866 flow [2023-08-30 08:59:07,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 591 transitions, 8709 flow, removed 36 selfloop flow, removed 8 redundant places. [2023-08-30 08:59:07,493 INFO L231 Difference]: Finished difference. Result has 274 places, 458 transitions, 6822 flow [2023-08-30 08:59:07,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=551, PETRI_DIFFERENCE_MINUEND_FLOW=6097, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=6822, PETRI_PLACES=274, PETRI_TRANSITIONS=458} [2023-08-30 08:59:07,494 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 228 predicate places. [2023-08-30 08:59:07,494 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 458 transitions, 6822 flow [2023-08-30 08:59:07,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 165.34615384615384) internal successors, (4299), 26 states have internal predecessors, (4299), 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 08:59:07,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:59:07,495 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:59:07,510 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 08:59:07,708 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 08:59:07,708 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:59:07,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:59:07,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1289040235, now seen corresponding path program 1 times [2023-08-30 08:59:07,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:59:07,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736742186] [2023-08-30 08:59:07,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:59:07,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:59:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:59:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:59:09,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:59:09,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736742186] [2023-08-30 08:59:09,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736742186] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:59:09,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530232719] [2023-08-30 08:59:09,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:59:09,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:59:09,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:59:09,359 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 08:59:09,361 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 08:59:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:59:09,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 131 conjunts are in the unsatisfiable core [2023-08-30 08:59:09,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:59:09,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-08-30 08:59:09,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:59:09,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:59:09,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-30 08:59:09,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:59:09,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:59:09,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-30 08:59:09,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:59:09,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:59:09,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-30 08:59:09,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:59:09,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 21 treesize of output 21 [2023-08-30 08:59:10,026 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-08-30 08:59:10,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 31 [2023-08-30 08:59:10,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2023-08-30 08:59:10,289 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 28 treesize of output 16 [2023-08-30 08:59:10,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-30 08:59:10,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:59:10,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 08:59:10,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:59:10,554 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 19 treesize of output 18 [2023-08-30 08:59:10,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:59:10,625 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 19 treesize of output 18 [2023-08-30 08:59:10,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:59:10,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:59:19,830 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_24| Int) (v_ArrVal_510 Int) (|v_threadThread1of1ForFork0_atomic_compare_and_exchange_~obj#1.offset_60| Int) (|v_threadThread1of1ForFork0_~elem~0#1_64| Int) (v_ArrVal_508 Int) (v_ArrVal_509 (Array Int Int)) (v_ArrVal_505 Int) (v_ArrVal_512 Int)) (let ((.cse1 (* 8 |v_threadThread1of1ForFork0_~elem~0#1_64|)) (.cse2 (select |c_#memory_int| |c_threadThread1of1ForFork0_atomic_fetch_sub_#in~obj#1.base|))) (or (< (select (store (store (select (store (let ((.cse0 (store |c_#memory_int| |c_threadThread1of1ForFork0_atomic_fetch_sub_#in~obj#1.base| (store .cse2 |c_threadThread1of1ForFork0_atomic_fetch_sub_#in~obj#1.offset| v_ArrVal_505)))) (store .cse0 |c_~#stack~0.base| (store (select .cse0 |c_~#stack~0.base|) (+ |c_~#stack~0.offset| .cse1) v_ArrVal_508))) |c_~#threads~0.base| v_ArrVal_509) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_24| v_ArrVal_510) |v_threadThread1of1ForFork0_atomic_compare_and_exchange_~obj#1.offset_60| v_ArrVal_512) (+ |c_~#stack~0.offset| 28)) 2147483647) (< (+ |c_~#stack~0.offset| 24) |v_threadThread1of1ForFork0_atomic_compare_and_exchange_~obj#1.offset_60|) (< (+ |c_~#stack~0.offset| 4 .cse1) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_24|) (< (select .cse2 |c_threadThread1of1ForFork0_atomic_fetch_sub_#in~obj#1.offset|) (+ v_ArrVal_505 |c_threadThread1of1ForFork0_atomic_fetch_sub_#in~v#1|)) (< |c_threadThread1of1ForFork0_Pop_~head1~0#1| |v_threadThread1of1ForFork0_~elem~0#1_64|)))) is different from false [2023-08-30 08:59:30,816 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_46| Int) (v_ArrVal_508 Int) (v_ArrVal_505 Int) (v_ArrVal_503 Int) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_501 Int) (v_ArrVal_512 Int) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_24| Int) (v_ArrVal_510 Int) (|v_threadThread1of1ForFork0_atomic_compare_and_exchange_~obj#1.offset_60| Int) (|v_threadThread1of1ForFork0_~elem~0#1_64| Int) (v_ArrVal_509 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_~#threads~0.base| v_ArrVal_500))) (let ((.cse6 (select .cse1 |c_~#stack~0.base|)) (.cse3 (+ |c_~#stack~0.offset| 24))) (let ((.cse0 (select .cse6 .cse3)) (.cse2 (store .cse6 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_46| v_ArrVal_501)) (.cse4 (+ |c_~#stack~0.offset| 28)) (.cse5 (* 8 |v_threadThread1of1ForFork0_~elem~0#1_64|))) (or (< (+ (* .cse0 8) |c_~#stack~0.offset| 4) |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_46|) (< .cse0 |v_threadThread1of1ForFork0_~elem~0#1_64|) (< (select (store (store (select (store (store .cse1 |c_~#stack~0.base| (store (store (store .cse2 .cse3 v_ArrVal_503) .cse4 v_ArrVal_505) (+ |c_~#stack~0.offset| .cse5) v_ArrVal_508)) |c_~#threads~0.base| v_ArrVal_509) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_24| v_ArrVal_510) |v_threadThread1of1ForFork0_atomic_compare_and_exchange_~obj#1.offset_60| v_ArrVal_512) .cse4) 2147483647) (< (select .cse2 .cse4) (+ v_ArrVal_505 1)) (< .cse3 |v_threadThread1of1ForFork0_atomic_compare_and_exchange_~obj#1.offset_60|) (< (+ |c_~#stack~0.offset| 4 .cse5) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_24|)))))) is different from false [2023-08-30 08:59:30,897 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_atomic_store_~obj#1.offset_97| Int) (|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_46| Int) (v_ArrVal_508 Int) (v_ArrVal_505 Int) (v_ArrVal_503 Int) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_501 Int) (v_ArrVal_512 Int) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_24| Int) (v_ArrVal_510 Int) (|v_threadThread1of1ForFork0_atomic_compare_and_exchange_~obj#1.offset_60| Int) (v_ArrVal_498 Int) (|v_threadThread1of1ForFork0_~elem~0#1_64| Int) (v_ArrVal_509 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_~#stack~0.base| (store (select |c_#memory_int| |c_~#stack~0.base|) |v_ULTIMATE.start_atomic_store_~obj#1.offset_97| v_ArrVal_498)) |c_~#threads~0.base| v_ArrVal_500))) (let ((.cse0 (+ |c_~#stack~0.offset| 24)) (.cse6 (select .cse5 |c_~#stack~0.base|))) (let ((.cse1 (store .cse6 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_46| v_ArrVal_501)) (.cse3 (* 8 |v_threadThread1of1ForFork0_~elem~0#1_64|)) (.cse2 (+ |c_~#stack~0.offset| 28)) (.cse4 (select .cse6 .cse0))) (or (< .cse0 |v_threadThread1of1ForFork0_atomic_compare_and_exchange_~obj#1.offset_60|) (< (select .cse1 .cse2) (+ v_ArrVal_505 1)) (< (+ |c_~#stack~0.offset| 4 .cse3) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_24|) (< (+ (* |c_ULTIMATE.start_Init_~pushCount#1| 8) |c_~#stack~0.offset|) (+ |v_ULTIMATE.start_atomic_store_~obj#1.offset_97| 4)) (< .cse4 |v_threadThread1of1ForFork0_~elem~0#1_64|) (< (select (store (store (select (store (store .cse5 |c_~#stack~0.base| (store (store (store .cse1 .cse0 v_ArrVal_503) .cse2 v_ArrVal_505) (+ |c_~#stack~0.offset| .cse3) v_ArrVal_508)) |c_~#threads~0.base| v_ArrVal_509) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_24| v_ArrVal_510) |v_threadThread1of1ForFork0_atomic_compare_and_exchange_~obj#1.offset_60| v_ArrVal_512) .cse2) 2147483647) (< (+ (* .cse4 8) |c_~#stack~0.offset| 4) |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_46|)))))) is different from false [2023-08-30 08:59:35,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-30 08:59:35,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530232719] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:59:35,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:59:35,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 17] total 47 [2023-08-30 08:59:35,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316963779] [2023-08-30 08:59:35,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:59:35,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-08-30 08:59:35,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:59:35,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-08-30 08:59:35,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1805, Unknown=119, NotChecked=270, Total=2352 [2023-08-30 08:59:36,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 551 [2023-08-30 08:59:36,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 458 transitions, 6822 flow. Second operand has 49 states, 49 states have (on average 158.53061224489795) internal successors, (7768), 49 states have internal predecessors, (7768), 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 08:59:36,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:59:36,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 551 [2023-08-30 08:59:36,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:00:28,189 WARN L222 SmtUtils]: Spent 8.30s on a formula simplification. DAG size of input: 108 DAG size of output: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 09:00:36,846 WARN L222 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 86 DAG size of output: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 09:00:54,440 WARN L222 SmtUtils]: Spent 8.26s on a formula simplification. DAG size of input: 72 DAG size of output: 69 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 09:01:01,197 WARN L222 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 94 DAG size of output: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 09:01:25,779 WARN L222 SmtUtils]: Spent 7.16s on a formula simplification. DAG size of input: 116 DAG size of output: 91 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 09:01:44,942 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 09:01:47,017 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 09:01:55,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 [1] [2023-08-30 09:02:12,989 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 09:02:37,419 INFO L130 PetriNetUnfolder]: 995/2282 cut-off events. [2023-08-30 09:02:37,419 INFO L131 PetriNetUnfolder]: For 23879/23879 co-relation queries the response was YES. [2023-08-30 09:02:37,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16243 conditions, 2282 events. 995/2282 cut-off events. For 23879/23879 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 13614 event pairs, 20 based on Foata normal form. 0/2261 useless extension candidates. Maximal degree in co-relation 16161. Up to 940 conditions per place. [2023-08-30 09:02:37,448 INFO L137 encePairwiseOnDemand]: 527/551 looper letters, 516 selfloop transitions, 292 changer transitions 0/809 dead transitions. [2023-08-30 09:02:37,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 809 transitions, 12778 flow [2023-08-30 09:02:37,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-08-30 09:02:37,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-08-30 09:02:37,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 8724 transitions. [2023-08-30 09:02:37,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2932042750554547 [2023-08-30 09:02:37,459 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 8724 transitions. [2023-08-30 09:02:37,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 8724 transitions. [2023-08-30 09:02:37,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:02:37,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 8724 transitions. [2023-08-30 09:02:37,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 161.55555555555554) internal successors, (8724), 54 states have internal predecessors, (8724), 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 09:02:37,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 551.0) internal successors, (30305), 55 states have internal predecessors, (30305), 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 09:02:37,494 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 551.0) internal successors, (30305), 55 states have internal predecessors, (30305), 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 09:02:37,494 INFO L175 Difference]: Start difference. First operand has 274 places, 458 transitions, 6822 flow. Second operand 54 states and 8724 transitions. [2023-08-30 09:02:37,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 809 transitions, 12778 flow [2023-08-30 09:02:37,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 809 transitions, 12275 flow, removed 79 selfloop flow, removed 12 redundant places. [2023-08-30 09:02:37,667 INFO L231 Difference]: Finished difference. Result has 331 places, 620 transitions, 10052 flow [2023-08-30 09:02:37,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=551, PETRI_DIFFERENCE_MINUEND_FLOW=6493, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=10052, PETRI_PLACES=331, PETRI_TRANSITIONS=620} [2023-08-30 09:02:37,668 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 285 predicate places. [2023-08-30 09:02:37,668 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 620 transitions, 10052 flow [2023-08-30 09:02:37,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 158.53061224489795) internal successors, (7768), 49 states have internal predecessors, (7768), 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 09:02:37,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:02:37,669 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:02:37,677 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 09:02:37,875 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 09:02:37,876 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 09:02:37,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:02:37,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1289040236, now seen corresponding path program 1 times [2023-08-30 09:02:37,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:02:37,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867854805] [2023-08-30 09:02:37,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:02:37,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:02:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:02:38,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 09:02:38,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:02:38,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867854805] [2023-08-30 09:02:38,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867854805] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:02:38,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:02:38,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-30 09:02:38,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395497340] [2023-08-30 09:02:38,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:02:38,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 09:02:38,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:02:38,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 09:02:38,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-08-30 09:02:40,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 551 [2023-08-30 09:02:40,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 620 transitions, 10052 flow. Second operand has 11 states, 11 states have (on average 229.1818181818182) internal successors, (2521), 11 states have internal predecessors, (2521), 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 09:02:40,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:02:40,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 551 [2023-08-30 09:02:40,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:02:42,100 INFO L130 PetriNetUnfolder]: 1030/2478 cut-off events. [2023-08-30 09:02:42,100 INFO L131 PetriNetUnfolder]: For 27333/27333 co-relation queries the response was YES. [2023-08-30 09:02:42,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17890 conditions, 2478 events. 1030/2478 cut-off events. For 27333/27333 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 15846 event pairs, 26 based on Foata normal form. 2/2457 useless extension candidates. Maximal degree in co-relation 17796. Up to 1085 conditions per place. [2023-08-30 09:02:42,123 INFO L137 encePairwiseOnDemand]: 536/551 looper letters, 519 selfloop transitions, 262 changer transitions 0/782 dead transitions. [2023-08-30 09:02:42,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 782 transitions, 13605 flow [2023-08-30 09:02:42,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-30 09:02:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-30 09:02:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4465 transitions. [2023-08-30 09:02:42,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.426497277676951 [2023-08-30 09:02:42,127 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 4465 transitions. [2023-08-30 09:02:42,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 4465 transitions. [2023-08-30 09:02:42,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:02:42,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 4465 transitions. [2023-08-30 09:02:42,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 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 09:02:42,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 551.0) internal successors, (11020), 20 states have internal predecessors, (11020), 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 09:02:42,140 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 551.0) internal successors, (11020), 20 states have internal predecessors, (11020), 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 09:02:42,140 INFO L175 Difference]: Start difference. First operand has 331 places, 620 transitions, 10052 flow. Second operand 19 states and 4465 transitions. [2023-08-30 09:02:42,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 782 transitions, 13605 flow [2023-08-30 09:02:42,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 782 transitions, 13390 flow, removed 43 selfloop flow, removed 12 redundant places. [2023-08-30 09:02:42,335 INFO L231 Difference]: Finished difference. Result has 342 places, 665 transitions, 11554 flow [2023-08-30 09:02:42,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=551, PETRI_DIFFERENCE_MINUEND_FLOW=9865, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=218, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=11554, PETRI_PLACES=342, PETRI_TRANSITIONS=665} [2023-08-30 09:02:42,337 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 296 predicate places. [2023-08-30 09:02:42,337 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 665 transitions, 11554 flow [2023-08-30 09:02:42,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 229.1818181818182) internal successors, (2521), 11 states have internal predecessors, (2521), 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 09:02:42,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:02:42,337 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:02:42,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 09:02:42,338 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 09:02:42,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:02:42,338 INFO L85 PathProgramCache]: Analyzing trace with hash -940056934, now seen corresponding path program 2 times [2023-08-30 09:02:42,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:02:42,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287683005] [2023-08-30 09:02:42,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:02:42,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:02:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:02:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 09:02:43,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:02:43,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287683005] [2023-08-30 09:02:43,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287683005] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:02:43,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174360211] [2023-08-30 09:02:43,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 09:02:43,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:02:43,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:02:43,305 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 09:02:43,338 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 09:02:43,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 09:02:43,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 09:02:43,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 116 conjunts are in the unsatisfiable core [2023-08-30 09:02:43,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:02:43,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-08-30 09:02:43,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 09:02:43,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:02:43,607 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 19 treesize of output 18 [2023-08-30 09:02:43,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:02:43,689 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 19 treesize of output 18 [2023-08-30 09:02:43,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:02:43,731 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 19 treesize of output 18 [2023-08-30 09:02:43,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:02:43,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 09:02:43,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-30 09:02:44,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 09:02:44,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-08-30 09:02:44,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:02:44,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-30 09:02:44,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-30 09:02:44,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:02:44,326 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 16 treesize of output 18 [2023-08-30 09:02:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 09:02:44,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:02:44,389 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_~#threads~0.base| v_ArrVal_632) |c_threadThread1of1ForFork0_atomic_fetch_add_#in~obj#1.base|) |c_threadThread1of1ForFork0_atomic_fetch_add_#in~obj#1.offset|) |c_threadThread1of1ForFork0_atomic_fetch_add_#in~v#1|))) is different from false [2023-08-30 09:02:55,890 INFO L321 Elim1Store]: treesize reduction 57, result has 49.1 percent of original size [2023-08-30 09:02:55,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 69 [2023-08-30 09:02:55,934 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 09:02:55,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 74 treesize of output 94 [2023-08-30 09:02:56,047 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 9 treesize of output 5 [2023-08-30 09:02:58,494 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_atomic_store_~obj#1.offset_100| Int)) (or (forall ((v_ArrVal_622 Int)) (< (select (store (select |c_#memory_int| |c_~#stack~0.base|) |v_ULTIMATE.start_atomic_store_~obj#1.offset_100| v_ArrVal_622) (+ |c_~#stack~0.offset| 24)) 3)) (< (+ (* |c_ULTIMATE.start_Init_~pushCount#1| 8) |c_~#stack~0.offset|) (+ 4 |v_ULTIMATE.start_atomic_store_~obj#1.offset_100|)))) (not (= |c_~#threads~0.base| |c_~#stack~0.base|))) is different from false [2023-08-30 09:03:00,541 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#threads~0.base| |c_~#stack~0.base|)) (forall ((|v_ULTIMATE.start_atomic_store_~obj#1.offset_101| Int)) (or (forall ((|v_ULTIMATE.start_atomic_store_~obj#1.offset_100| Int) (v_ArrVal_619 Int)) (or (< (+ (* |c_ULTIMATE.start_Init_~pushCount#1| 8) |c_~#stack~0.offset|) (+ 4 |v_ULTIMATE.start_atomic_store_~obj#1.offset_100|)) (forall ((v_ArrVal_622 Int)) (< (select (store (store (select |c_#memory_int| |c_~#stack~0.base|) |v_ULTIMATE.start_atomic_store_~obj#1.offset_101| v_ArrVal_619) |v_ULTIMATE.start_atomic_store_~obj#1.offset_100| v_ArrVal_622) (+ |c_~#stack~0.offset| 24)) 3)))) (< (+ |c_~#stack~0.offset| 4 (* |c_ULTIMATE.start_Init_~i~0#1| 8)) |v_ULTIMATE.start_atomic_store_~obj#1.offset_101|)))) is different from false [2023-08-30 09:03:02,643 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#threads~0.base| |c_~#stack~0.base|)) (forall ((|v_ULTIMATE.start_atomic_store_~obj#1.offset_102| Int)) (let ((.cse0 (* |c_ULTIMATE.start_Init_~i~0#1| 8))) (or (< (+ |c_~#stack~0.offset| 4 .cse0) |v_ULTIMATE.start_atomic_store_~obj#1.offset_102|) (forall ((|v_ULTIMATE.start_atomic_store_~obj#1.offset_101| Int) (|v_ULTIMATE.start_atomic_store_~obj#1.offset_100| Int) (v_ArrVal_619 Int) (v_ArrVal_617 Int) (v_ArrVal_622 Int)) (or (< (+ 12 |c_~#stack~0.offset| .cse0) |v_ULTIMATE.start_atomic_store_~obj#1.offset_101|) (< (+ (* |c_ULTIMATE.start_Init_~pushCount#1| 8) |c_~#stack~0.offset|) (+ 4 |v_ULTIMATE.start_atomic_store_~obj#1.offset_100|)) (< (select (store (store (store (select |c_#memory_int| |c_~#stack~0.base|) |v_ULTIMATE.start_atomic_store_~obj#1.offset_102| v_ArrVal_617) |v_ULTIMATE.start_atomic_store_~obj#1.offset_101| v_ArrVal_619) |v_ULTIMATE.start_atomic_store_~obj#1.offset_100| v_ArrVal_622) (+ |c_~#stack~0.offset| 24)) 3))))))) is different from false [2023-08-30 09:03:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-08-30 09:03:02,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174360211] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:03:02,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:03:02,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 37 [2023-08-30 09:03:02,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914850757] [2023-08-30 09:03:02,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:03:02,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-08-30 09:03:02,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:03:02,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-08-30 09:03:02,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1041, Unknown=22, NotChecked=276, Total=1482 [2023-08-30 09:03:02,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 551 [2023-08-30 09:03:02,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 665 transitions, 11554 flow. Second operand has 39 states, 39 states have (on average 157.89743589743588) internal successors, (6158), 39 states have internal predecessors, (6158), 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 09:03:02,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:03:02,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 551 [2023-08-30 09:03:02,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:04:28,747 INFO L130 PetriNetUnfolder]: 1214/3060 cut-off events. [2023-08-30 09:04:28,747 INFO L131 PetriNetUnfolder]: For 38328/38328 co-relation queries the response was YES. [2023-08-30 09:04:28,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22873 conditions, 3060 events. 1214/3060 cut-off events. For 38328/38328 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 21117 event pairs, 20 based on Foata normal form. 7/3036 useless extension candidates. Maximal degree in co-relation 22773. Up to 610 conditions per place. [2023-08-30 09:04:28,779 INFO L137 encePairwiseOnDemand]: 525/551 looper letters, 684 selfloop transitions, 493 changer transitions 0/1178 dead transitions. [2023-08-30 09:04:28,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 1178 transitions, 20447 flow [2023-08-30 09:04:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2023-08-30 09:04:28,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2023-08-30 09:04:28,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 17797 transitions. [2023-08-30 09:04:28,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2909860859044162 [2023-08-30 09:04:28,803 INFO L72 ComplementDD]: Start complementDD. Operand 111 states and 17797 transitions. [2023-08-30 09:04:28,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 17797 transitions. [2023-08-30 09:04:28,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:04:28,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 111 states and 17797 transitions. [2023-08-30 09:04:28,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 112 states, 111 states have (on average 160.33333333333334) internal successors, (17797), 111 states have internal predecessors, (17797), 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 09:04:28,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 112 states, 112 states have (on average 551.0) internal successors, (61712), 112 states have internal predecessors, (61712), 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 09:04:28,893 INFO L81 ComplementDD]: Finished complementDD. Result has 112 states, 112 states have (on average 551.0) internal successors, (61712), 112 states have internal predecessors, (61712), 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 09:04:28,893 INFO L175 Difference]: Start difference. First operand has 342 places, 665 transitions, 11554 flow. Second operand 111 states and 17797 transitions. [2023-08-30 09:04:28,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 1178 transitions, 20447 flow [2023-08-30 09:04:29,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 1178 transitions, 20266 flow, removed 46 selfloop flow, removed 8 redundant places. [2023-08-30 09:04:29,129 INFO L231 Difference]: Finished difference. Result has 470 places, 826 transitions, 15597 flow [2023-08-30 09:04:29,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=551, PETRI_DIFFERENCE_MINUEND_FLOW=11432, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=337, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=111, PETRI_FLOW=15597, PETRI_PLACES=470, PETRI_TRANSITIONS=826} [2023-08-30 09:04:29,130 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 424 predicate places. [2023-08-30 09:04:29,130 INFO L495 AbstractCegarLoop]: Abstraction has has 470 places, 826 transitions, 15597 flow [2023-08-30 09:04:29,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 157.89743589743588) internal successors, (6158), 39 states have internal predecessors, (6158), 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 09:04:29,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:04:29,131 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:04:29,136 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 09:04:29,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:04:29,331 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 09:04:29,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:04:29,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1157449108, now seen corresponding path program 1 times [2023-08-30 09:04:29,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:04:29,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222326699] [2023-08-30 09:04:29,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:04:29,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:04:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:04:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 09:04:29,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:04:29,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222326699] [2023-08-30 09:04:29,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222326699] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:04:29,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:04:29,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 09:04:29,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062095963] [2023-08-30 09:04:29,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:04:29,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 09:04:29,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:04:29,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 09:04:29,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 09:04:30,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 551 [2023-08-30 09:04:30,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 826 transitions, 15597 flow. Second operand has 6 states, 6 states have (on average 238.16666666666666) internal successors, (1429), 6 states have internal predecessors, (1429), 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 09:04:30,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:04:30,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 551 [2023-08-30 09:04:30,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:04:31,594 INFO L130 PetriNetUnfolder]: 842/2295 cut-off events. [2023-08-30 09:04:31,594 INFO L131 PetriNetUnfolder]: For 34491/34491 co-relation queries the response was YES. [2023-08-30 09:04:31,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18572 conditions, 2295 events. 842/2295 cut-off events. For 34491/34491 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 14979 event pairs, 22 based on Foata normal form. 23/2318 useless extension candidates. Maximal degree in co-relation 18446. Up to 1927 conditions per place. [2023-08-30 09:04:31,614 INFO L137 encePairwiseOnDemand]: 544/551 looper letters, 208 selfloop transitions, 122 changer transitions 374/705 dead transitions. [2023-08-30 09:04:31,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 705 transitions, 14420 flow [2023-08-30 09:04:31,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 09:04:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 09:04:31,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1689 transitions. [2023-08-30 09:04:31,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43790510759657764 [2023-08-30 09:04:31,619 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1689 transitions. [2023-08-30 09:04:31,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1689 transitions. [2023-08-30 09:04:31,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:04:31,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1689 transitions. [2023-08-30 09:04:31,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 241.28571428571428) internal successors, (1689), 7 states have internal predecessors, (1689), 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 09:04:31,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 551.0) internal successors, (4408), 8 states have internal predecessors, (4408), 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 09:04:31,623 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 551.0) internal successors, (4408), 8 states have internal predecessors, (4408), 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 09:04:31,623 INFO L175 Difference]: Start difference. First operand has 470 places, 826 transitions, 15597 flow. Second operand 7 states and 1689 transitions. [2023-08-30 09:04:31,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 705 transitions, 14420 flow [2023-08-30 09:04:31,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 705 transitions, 13802 flow, removed 102 selfloop flow, removed 64 redundant places. [2023-08-30 09:04:31,896 INFO L231 Difference]: Finished difference. Result has 388 places, 330 transitions, 5597 flow [2023-08-30 09:04:31,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=551, PETRI_DIFFERENCE_MINUEND_FLOW=12235, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5597, PETRI_PLACES=388, PETRI_TRANSITIONS=330} [2023-08-30 09:04:31,897 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 342 predicate places. [2023-08-30 09:04:31,897 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 330 transitions, 5597 flow [2023-08-30 09:04:31,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 238.16666666666666) internal successors, (1429), 6 states have internal predecessors, (1429), 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 09:04:31,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:04:31,898 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:04:31,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 09:04:31,898 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 09:04:31,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:04:31,898 INFO L85 PathProgramCache]: Analyzing trace with hash -707558246, now seen corresponding path program 1 times [2023-08-30 09:04:31,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:04:31,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189728215] [2023-08-30 09:04:31,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:04:31,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:04:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:04:32,877 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 09:04:32,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:04:32,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189728215] [2023-08-30 09:04:32,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189728215] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:04:32,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322699576] [2023-08-30 09:04:32,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:04:32,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:04:32,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:04:32,881 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 09:04:32,885 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 09:04:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:04:33,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 75 conjunts are in the unsatisfiable core [2023-08-30 09:04:33,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:04:33,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 09:04:33,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 09:04:33,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 09:04:33,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 09:04:33,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 09:04:33,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:04:33,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:04:33,807 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 09:04:33,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2023-08-30 09:04:33,927 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-08-30 09:04:33,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 25 [2023-08-30 09:04:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 09:04:34,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:04:35,137 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 09:04:35,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 92 [2023-08-30 09:04:35,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 09:04:35,190 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 9448 treesize of output 9300 [2023-08-30 09:04:35,316 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 09:04:35,316 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 1420 treesize of output 1214 [2023-08-30 09:04:35,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1188 treesize of output 1168 [2023-08-30 09:04:43,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:04:43,544 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 5 treesize of output 3 [2023-08-30 09:04:43,560 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 22 treesize of output 20 [2023-08-30 09:04:43,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2023-08-30 09:04:43,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 09:04:43,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322699576] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:04:43,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:04:43,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 15] total 33 [2023-08-30 09:04:43,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635120955] [2023-08-30 09:04:43,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:04:43,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-30 09:04:43,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:04:43,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-30 09:04:43,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=900, Unknown=21, NotChecked=0, Total=1122 [2023-08-30 09:04:45,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 551 [2023-08-30 09:04:45,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 330 transitions, 5597 flow. Second operand has 34 states, 34 states have (on average 162.11764705882354) internal successors, (5512), 34 states have internal predecessors, (5512), 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 09:04:45,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:04:45,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 551 [2023-08-30 09:04:45,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:04:48,234 INFO L130 PetriNetUnfolder]: 521/1671 cut-off events. [2023-08-30 09:04:48,234 INFO L131 PetriNetUnfolder]: For 26022/26022 co-relation queries the response was YES. [2023-08-30 09:04:48,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13682 conditions, 1671 events. 521/1671 cut-off events. For 26022/26022 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 11572 event pairs, 19 based on Foata normal form. 18/1689 useless extension candidates. Maximal degree in co-relation 13573. Up to 494 conditions per place. [2023-08-30 09:04:48,249 INFO L137 encePairwiseOnDemand]: 538/551 looper letters, 527 selfloop transitions, 341 changer transitions 24/893 dead transitions. [2023-08-30 09:04:48,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 893 transitions, 17646 flow [2023-08-30 09:04:48,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-30 09:04:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-30 09:04:48,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4455 transitions. [2023-08-30 09:04:48,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29945553539019965 [2023-08-30 09:04:48,261 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4455 transitions. [2023-08-30 09:04:48,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4455 transitions. [2023-08-30 09:04:48,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:04:48,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4455 transitions. [2023-08-30 09:04:48,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 165.0) internal successors, (4455), 27 states have internal predecessors, (4455), 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 09:04:48,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 551.0) internal successors, (15428), 28 states have internal predecessors, (15428), 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 09:04:48,275 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 551.0) internal successors, (15428), 28 states have internal predecessors, (15428), 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 09:04:48,275 INFO L175 Difference]: Start difference. First operand has 388 places, 330 transitions, 5597 flow. Second operand 27 states and 4455 transitions. [2023-08-30 09:04:48,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 893 transitions, 17646 flow [2023-08-30 09:04:48,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 893 transitions, 13273 flow, removed 132 selfloop flow, removed 79 redundant places. [2023-08-30 09:04:48,405 INFO L231 Difference]: Finished difference. Result has 276 places, 618 transitions, 9230 flow [2023-08-30 09:04:48,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=551, PETRI_DIFFERENCE_MINUEND_FLOW=3990, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=9230, PETRI_PLACES=276, PETRI_TRANSITIONS=618} [2023-08-30 09:04:48,406 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 230 predicate places. [2023-08-30 09:04:48,406 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 618 transitions, 9230 flow [2023-08-30 09:04:48,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 162.11764705882354) internal successors, (5512), 34 states have internal predecessors, (5512), 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 09:04:48,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:04:48,407 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:04:48,414 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 09:04:48,614 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 09:04:48,614 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting threadErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 09:04:48,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:04:48,614 INFO L85 PathProgramCache]: Analyzing trace with hash -799909375, now seen corresponding path program 1 times [2023-08-30 09:04:48,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:04:48,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339088706] [2023-08-30 09:04:48,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:04:48,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:04:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:04:49,573 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 09:04:49,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:04:49,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339088706] [2023-08-30 09:04:49,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339088706] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:04:49,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950871876] [2023-08-30 09:04:49,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:04:49,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:04:49,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:04:49,574 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 09:04:49,576 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 09:04:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:04:49,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 75 conjunts are in the unsatisfiable core [2023-08-30 09:04:49,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:04:49,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 09:04:49,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 09:04:50,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 09:04:50,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 09:04:50,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 09:04:50,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:04:50,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:04:50,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 09:04:50,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2023-08-30 09:04:50,449 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-08-30 09:04:50,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 25 [2023-08-30 09:04:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 09:04:50,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:04:51,740 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 09:04:51,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 92 [2023-08-30 09:04:51,778 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 09:04:51,779 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 11238 treesize of output 10884 [2023-08-30 09:04:51,869 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 892 treesize of output 876 [2023-08-30 09:04:51,901 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 09:04:51,901 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 1472 treesize of output 1250 [2023-08-30 09:05:14,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2023-08-30 09:05:14,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-08-30 09:05:14,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:05:14,370 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 5 treesize of output 3 [2023-08-30 09:05:14,379 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 09:05:14,391 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 09:05:14,398 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 09:05:16,700 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 09:05:16,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950871876] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:05:16,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:05:16,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 15] total 34 [2023-08-30 09:05:16,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686379384] [2023-08-30 09:05:16,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:05:16,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-30 09:05:16,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:05:16,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-30 09:05:16,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=970, Unknown=21, NotChecked=0, Total=1190 [2023-08-30 09:05:20,803 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 09:05:25,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:05:31,233 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 09:05:31,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 551 [2023-08-30 09:05:31,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 618 transitions, 9230 flow. Second operand has 35 states, 35 states have (on average 174.0857142857143) internal successors, (6093), 35 states have internal predecessors, (6093), 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 09:05:31,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:05:31,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 551 [2023-08-30 09:05:31,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:05:54,317 WARN L222 SmtUtils]: Spent 22.06s on a formula simplification. DAG size of input: 65 DAG size of output: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 09:05:55,589 INFO L130 PetriNetUnfolder]: 540/1764 cut-off events. [2023-08-30 09:05:55,589 INFO L131 PetriNetUnfolder]: For 13039/13039 co-relation queries the response was YES. [2023-08-30 09:05:55,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12121 conditions, 1764 events. 540/1764 cut-off events. For 13039/13039 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 12456 event pairs, 24 based on Foata normal form. 9/1770 useless extension candidates. Maximal degree in co-relation 12042. Up to 835 conditions per place. [2023-08-30 09:05:55,603 INFO L137 encePairwiseOnDemand]: 538/551 looper letters, 540 selfloop transitions, 244 changer transitions 10/795 dead transitions. [2023-08-30 09:05:55,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 795 transitions, 13426 flow [2023-08-30 09:05:55,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-30 09:05:55,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-30 09:05:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3022 transitions. [2023-08-30 09:05:55,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32262197074837196 [2023-08-30 09:05:55,605 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3022 transitions. [2023-08-30 09:05:55,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3022 transitions. [2023-08-30 09:05:55,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:05:55,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3022 transitions. [2023-08-30 09:05:55,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 177.76470588235293) internal successors, (3022), 17 states have internal predecessors, (3022), 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 09:05:55,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 551.0) internal successors, (9918), 18 states have internal predecessors, (9918), 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 09:05:55,615 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 551.0) internal successors, (9918), 18 states have internal predecessors, (9918), 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 09:05:55,615 INFO L175 Difference]: Start difference. First operand has 276 places, 618 transitions, 9230 flow. Second operand 17 states and 3022 transitions. [2023-08-30 09:05:55,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 795 transitions, 13426 flow [2023-08-30 09:05:55,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 795 transitions, 13304 flow, removed 33 selfloop flow, removed 6 redundant places. [2023-08-30 09:05:55,723 INFO L231 Difference]: Finished difference. Result has 290 places, 673 transitions, 10752 flow [2023-08-30 09:05:55,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=551, PETRI_DIFFERENCE_MINUEND_FLOW=9114, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=189, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=10752, PETRI_PLACES=290, PETRI_TRANSITIONS=673} [2023-08-30 09:05:55,724 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 244 predicate places. [2023-08-30 09:05:55,724 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 673 transitions, 10752 flow [2023-08-30 09:05:55,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 174.0857142857143) internal successors, (6093), 35 states have internal predecessors, (6093), 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 09:05:55,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:05:55,725 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:05:55,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-30 09:05:55,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:05:55,931 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 09:05:55,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:05:55,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1791381232, now seen corresponding path program 2 times [2023-08-30 09:05:55,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:05:55,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501885402] [2023-08-30 09:05:55,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:05:55,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:05:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:05:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 09:05:56,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:05:56,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501885402] [2023-08-30 09:05:56,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501885402] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:05:56,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719294113] [2023-08-30 09:05:56,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 09:05:56,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:05:56,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:05:56,965 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:05:56,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-30 09:05:57,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 09:05:57,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 09:05:57,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 210 conjunts are in the unsatisfiable core [2023-08-30 09:05:57,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:05:57,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-08-30 09:05:57,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-30 09:05:57,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-30 09:05:57,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-30 09:05:57,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:05:57,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-30 09:05:57,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:05:57,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:05:57,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-30 09:05:57,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-08-30 09:05:57,900 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 28 treesize of output 16 [2023-08-30 09:05:57,965 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 19 treesize of output 18 [2023-08-30 09:05:58,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:05:58,472 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-30 09:05:58,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 32 [2023-08-30 09:05:58,484 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 9 treesize of output 7 [2023-08-30 09:05:58,604 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 09:05:58,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 39 [2023-08-30 09:05:58,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:05:58,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-08-30 09:05:58,723 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 10 treesize of output 8 [2023-08-30 09:05:58,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:05:58,906 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 19 treesize of output 18 [2023-08-30 09:05:58,993 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 19 treesize of output 18 [2023-08-30 09:05:59,056 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 09:05:59,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:05:59,717 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| Int) (v_ArrVal_933 (Array Int Int)) (v_ArrVal_934 Int) (v_ArrVal_932 Int)) (let ((.cse0 (store |c_#memory_int| |c_threadThread1of1ForFork0_atomic_store_~obj#1.base| (store (select |c_#memory_int| |c_threadThread1of1ForFork0_atomic_store_~obj#1.base|) |c_threadThread1of1ForFork0_atomic_store_~obj#1.offset| v_ArrVal_932)))) (or (< (+ (* 8 |c_threadThread1of1ForFork0_Push_~index#1|) |c_~#stack~0.offset| 4) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34|) (< (select (store (select (store .cse0 |c_threadThread1of1ForFork0_Push_~#head1~1#1.base| v_ArrVal_933) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| v_ArrVal_934) (+ |c_~#stack~0.offset| 28)) 2147483647) (= (select (select .cse0 |c_threadThread1of1ForFork0_Push_~#head1~1#1.base|) |c_threadThread1of1ForFork0_Push_~#head1~1#1.offset|) (select (select .cse0 |c_~#stack~0.base|) (+ |c_~#stack~0.offset| 24)))))) is different from false [2023-08-30 09:05:59,746 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_930 (Array Int Int)) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| Int) (v_ArrVal_933 (Array Int Int)) (v_ArrVal_934 Int) (v_ArrVal_932 Int)) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_~#threads~0.base| v_ArrVal_930))) (store .cse1 |c_threadThread1of1ForFork0_atomic_store_~obj#1.base| (store (select .cse1 |c_threadThread1of1ForFork0_atomic_store_~obj#1.base|) |c_threadThread1of1ForFork0_atomic_store_~obj#1.offset| v_ArrVal_932))))) (or (< (+ (* 8 |c_threadThread1of1ForFork0_Push_~index#1|) |c_~#stack~0.offset| 4) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34|) (< (select (store (select (store .cse0 |c_threadThread1of1ForFork0_Push_~#head1~1#1.base| v_ArrVal_933) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| v_ArrVal_934) (+ |c_~#stack~0.offset| 28)) 2147483647) (= (select (select .cse0 |c_~#stack~0.base|) (+ |c_~#stack~0.offset| 24)) (select (select .cse0 |c_threadThread1of1ForFork0_Push_~#head1~1#1.base|) |c_threadThread1of1ForFork0_Push_~#head1~1#1.offset|))))) (<= 3 |c_ULTIMATE.start_main_~i~2#1|)) is different from false [2023-08-30 09:06:00,590 WARN L839 $PredicateComparison]: unable to prove that (or (<= 2 |c_ULTIMATE.start_main_~i~2#1|) (forall ((v_ArrVal_930 (Array Int Int)) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| Int) (v_ArrVal_933 (Array Int Int)) (v_ArrVal_934 Int) (v_ArrVal_932 Int) (|v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| Int)) (let ((.cse4 (store |c_#memory_int| |c_~#threads~0.base| v_ArrVal_930)) (.cse1 (+ (* |c_threadThread1of1ForFork0_~elem~0#1| 8) |c_~#stack~0.offset| 4))) (let ((.cse3 (store (select .cse4 |c_~#stack~0.base|) .cse1 v_ArrVal_932))) (let ((.cse0 (+ |c_~#stack~0.offset| 24)) (.cse2 (store .cse4 |c_~#stack~0.base| .cse3))) (or (not (= (select (select |c_#memory_int| |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74|) 0) (select (select |c_#memory_int| |c_~#stack~0.base|) .cse0))) (< .cse1 |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34|) (= |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| 0) (= (select (select .cse2 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74|) 0) (select .cse3 .cse0)) (< (select (store (select (store .cse2 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| v_ArrVal_933) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| v_ArrVal_934) (+ |c_~#stack~0.offset| 28)) 2147483647))))))) is different from false [2023-08-30 09:06:02,647 WARN L839 $PredicateComparison]: unable to prove that (or (<= 2 |c_ULTIMATE.start_main_~i~2#1|) (forall ((v_ArrVal_930 (Array Int Int)) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| Int) (v_ArrVal_933 (Array Int Int)) (|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_54| Int) (v_ArrVal_928 Int) (v_ArrVal_926 Int) (v_ArrVal_924 Int) (v_ArrVal_923 Int) (v_ArrVal_934 Int) (v_ArrVal_932 Int) (|v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| Int)) (let ((.cse5 (store (select |c_#memory_int| |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_54| v_ArrVal_923)) (.cse4 (+ |c_~#stack~0.offset| 24)) (.cse1 (+ |c_~#stack~0.offset| 28)) (.cse9 (* |c_threadThread1of1ForFork0_atomic_load_#res#1| 8))) (let ((.cse7 (store (store (store .cse5 .cse4 v_ArrVal_924) .cse1 v_ArrVal_926) (+ |c_~#stack~0.offset| .cse9) v_ArrVal_928))) (let ((.cse6 (store |c_#memory_int| |c_~#stack~0.base| .cse7))) (let ((.cse8 (store .cse6 |c_~#threads~0.base| v_ArrVal_930)) (.cse2 (+ |c_~#stack~0.offset| .cse9 4))) (let ((.cse3 (store (select .cse8 |c_~#stack~0.base|) .cse2 v_ArrVal_932))) (let ((.cse0 (store .cse8 |c_~#stack~0.base| .cse3))) (or (< (select (store (select (store .cse0 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| v_ArrVal_933) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| v_ArrVal_934) .cse1) 2147483647) (< .cse2 |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34|) (= |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| 0) (= (select .cse3 .cse4) (select (select .cse0 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74|) 0)) (< (select .cse5 .cse1) (+ v_ArrVal_926 1)) (not (= (select (select .cse6 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74|) 0) (select .cse7 .cse4))) (< .cse2 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_54|)))))))))) is different from false [2023-08-30 09:06:04,565 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_54| Int) (v_ArrVal_928 Int) (v_ArrVal_926 Int) (v_ArrVal_924 Int) (v_ArrVal_923 Int) (v_ArrVal_934 Int) (v_ArrVal_932 Int) (|v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| Int) (v_ArrVal_930 (Array Int Int)) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| Int) (v_ArrVal_933 (Array Int Int)) (v_ArrVal_921 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_~#threads~0.base| v_ArrVal_921))) (let ((.cse4 (+ |c_~#stack~0.offset| 24)) (.cse11 (select .cse10 |c_~#stack~0.base|))) (let ((.cse7 (store .cse11 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_54| v_ArrVal_923)) (.cse1 (+ |c_~#stack~0.offset| 28)) (.cse9 (* (select .cse11 .cse4) 8))) (let ((.cse6 (store (store (store .cse7 .cse4 v_ArrVal_924) .cse1 v_ArrVal_926) (+ .cse9 |c_~#stack~0.offset|) v_ArrVal_928))) (let ((.cse5 (store .cse10 |c_~#stack~0.base| .cse6))) (let ((.cse8 (store .cse5 |c_~#threads~0.base| v_ArrVal_930)) (.cse2 (+ .cse9 |c_~#stack~0.offset| 4))) (let ((.cse3 (store (select .cse8 |c_~#stack~0.base|) .cse2 v_ArrVal_932))) (let ((.cse0 (store .cse8 |c_~#stack~0.base| .cse3))) (or (< (select (store (select (store .cse0 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| v_ArrVal_933) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| v_ArrVal_934) .cse1) 2147483647) (< .cse2 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_54|) (= (select .cse3 .cse4) (select (select .cse0 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74|) 0)) (< .cse2 |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34|) (= |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| 0) (not (= (select (select .cse5 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74|) 0) (select .cse6 .cse4))) (< (select .cse7 .cse1) (+ v_ArrVal_926 1)))))))))))) (<= 2 |c_ULTIMATE.start_main_~i~2#1|)) is different from false [2023-08-30 09:06:04,729 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_919 Int) (|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_54| Int) (v_ArrVal_928 Int) (v_ArrVal_926 Int) (v_ArrVal_924 Int) (v_ArrVal_923 Int) (v_ArrVal_934 Int) (v_ArrVal_932 Int) (|v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| Int) (v_ArrVal_930 (Array Int Int)) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| Int) (v_ArrVal_933 (Array Int Int)) (v_ArrVal_921 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_~#stack~0.base| (store (select |c_#memory_int| |c_~#stack~0.base|) (+ (* |c_ULTIMATE.start_Init_~pushCount#1| 8) (- 4) |c_~#stack~0.offset|) v_ArrVal_919)) |c_~#threads~0.base| v_ArrVal_921))) (let ((.cse5 (+ |c_~#stack~0.offset| 24)) (.cse11 (select .cse10 |c_~#stack~0.base|))) (let ((.cse2 (store .cse11 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_54| v_ArrVal_923)) (.cse1 (+ |c_~#stack~0.offset| 28)) (.cse9 (* (select .cse11 .cse5) 8))) (let ((.cse4 (store (store (store .cse2 .cse5 v_ArrVal_924) .cse1 v_ArrVal_926) (+ .cse9 |c_~#stack~0.offset|) v_ArrVal_928))) (let ((.cse6 (store .cse10 |c_~#stack~0.base| .cse4))) (let ((.cse8 (store .cse6 |c_~#threads~0.base| v_ArrVal_930)) (.cse3 (+ .cse9 |c_~#stack~0.offset| 4))) (let ((.cse7 (store (select .cse8 |c_~#stack~0.base|) .cse3 v_ArrVal_932))) (let ((.cse0 (store .cse8 |c_~#stack~0.base| .cse7))) (or (< (select (store (select (store .cse0 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| v_ArrVal_933) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| v_ArrVal_934) .cse1) 2147483647) (< (select .cse2 .cse1) (+ v_ArrVal_926 1)) (< .cse3 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_54|) (= |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| 0) (not (= (select .cse4 .cse5) (select (select .cse6 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74|) 0))) (= (select (select .cse0 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74|) 0) (select .cse7 .cse5)) (< .cse3 |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34|))))))))))) is different from false [2023-08-30 09:06:04,989 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_919 Int) (|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_54| Int) (v_ArrVal_917 Int) (v_ArrVal_928 Int) (v_ArrVal_926 Int) (v_ArrVal_924 Int) (v_ArrVal_923 Int) (v_ArrVal_934 Int) (v_ArrVal_932 Int) (|v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| Int) (v_ArrVal_930 (Array Int Int)) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| Int) (v_ArrVal_933 (Array Int Int)) (v_ArrVal_921 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_~#stack~0.base| (store (store (select |c_#memory_int| |c_~#stack~0.base|) (+ |c_~#stack~0.offset| 4 (* |c_ULTIMATE.start_Init_~i~0#1| 8)) v_ArrVal_917) (+ (* |c_ULTIMATE.start_Init_~pushCount#1| 8) (- 4) |c_~#stack~0.offset|) v_ArrVal_919)) |c_~#threads~0.base| v_ArrVal_921))) (let ((.cse2 (+ |c_~#stack~0.offset| 24)) (.cse11 (select .cse10 |c_~#stack~0.base|))) (let ((.cse4 (store .cse11 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_54| v_ArrVal_923)) (.cse5 (+ |c_~#stack~0.offset| 28)) (.cse9 (* 8 (select .cse11 .cse2)))) (let ((.cse6 (store (store (store .cse4 .cse2 v_ArrVal_924) .cse5 v_ArrVal_926) (+ |c_~#stack~0.offset| .cse9) v_ArrVal_928))) (let ((.cse7 (store .cse10 |c_~#stack~0.base| .cse6))) (let ((.cse8 (store .cse7 |c_~#threads~0.base| v_ArrVal_930)) (.cse0 (+ |c_~#stack~0.offset| 4 .cse9))) (let ((.cse1 (store (select .cse8 |c_~#stack~0.base|) .cse0 v_ArrVal_932))) (let ((.cse3 (store .cse8 |c_~#stack~0.base| .cse1))) (or (< .cse0 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_54|) (= |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| 0) (= (select .cse1 .cse2) (select (select .cse3 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74|) 0)) (< (select .cse4 .cse5) (+ v_ArrVal_926 1)) (< .cse0 |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34|) (not (= (select .cse6 .cse2) (select (select .cse7 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74|) 0))) (< (select (store (select (store .cse3 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| v_ArrVal_933) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| v_ArrVal_934) .cse5) 2147483647))))))))))) is different from false [2023-08-30 09:06:05,317 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_919 Int) (|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_54| Int) (v_ArrVal_917 Int) (v_ArrVal_928 Int) (v_ArrVal_915 Int) (v_ArrVal_926 Int) (v_ArrVal_924 Int) (v_ArrVal_923 Int) (v_ArrVal_934 Int) (v_ArrVal_932 Int) (|v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| Int) (v_ArrVal_930 (Array Int Int)) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| Int) (v_ArrVal_933 (Array Int Int)) (v_ArrVal_921 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_~#stack~0.base| (store (let ((.cse12 (* |c_ULTIMATE.start_Init_~i~0#1| 8))) (store (store (select |c_#memory_int| |c_~#stack~0.base|) (+ |c_~#stack~0.offset| 4 .cse12) v_ArrVal_915) (+ 12 |c_~#stack~0.offset| .cse12) v_ArrVal_917)) (+ (* |c_ULTIMATE.start_Init_~pushCount#1| 8) (- 4) |c_~#stack~0.offset|) v_ArrVal_919)) |c_~#threads~0.base| v_ArrVal_921))) (let ((.cse2 (+ |c_~#stack~0.offset| 24)) (.cse11 (select .cse10 |c_~#stack~0.base|))) (let ((.cse3 (store .cse11 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_54| v_ArrVal_923)) (.cse4 (+ |c_~#stack~0.offset| 28)) (.cse9 (* 8 (select .cse11 .cse2)))) (let ((.cse1 (store (store (store .cse3 .cse2 v_ArrVal_924) .cse4 v_ArrVal_926) (+ |c_~#stack~0.offset| .cse9) v_ArrVal_928))) (let ((.cse0 (store .cse10 |c_~#stack~0.base| .cse1))) (let ((.cse8 (store .cse0 |c_~#threads~0.base| v_ArrVal_930)) (.cse5 (+ |c_~#stack~0.offset| .cse9 4))) (let ((.cse6 (store (select .cse8 |c_~#stack~0.base|) .cse5 v_ArrVal_932))) (let ((.cse7 (store .cse8 |c_~#stack~0.base| .cse6))) (or (= |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| 0) (not (= (select (select .cse0 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74|) 0) (select .cse1 .cse2))) (< (select .cse3 .cse4) (+ v_ArrVal_926 1)) (< .cse5 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_54|) (= (select .cse6 .cse2) (select (select .cse7 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74|) 0)) (< .cse5 |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34|) (< (select (store (select (store .cse7 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| v_ArrVal_933) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| v_ArrVal_934) .cse4) 2147483647))))))))))) is different from false [2023-08-30 09:06:05,324 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-08-30 09:06:05,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719294113] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:06:05,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:06:05,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 21, 23] total 54 [2023-08-30 09:06:05,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326292398] [2023-08-30 09:06:05,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:06:05,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-08-30 09:06:05,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:06:05,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-08-30 09:06:05,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1873, Unknown=147, NotChecked=776, Total=2970 [2023-08-30 09:06:05,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 551 [2023-08-30 09:06:05,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 673 transitions, 10752 flow. Second operand has 55 states, 55 states have (on average 130.5090909090909) internal successors, (7178), 55 states have internal predecessors, (7178), 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 09:06:05,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:06:05,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 551 [2023-08-30 09:06:05,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:06:44,095 WARN L222 SmtUtils]: Spent 5.92s on a formula simplification. DAG size of input: 165 DAG size of output: 161 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 09:07:52,814 WARN L222 SmtUtils]: Spent 6.72s on a formula simplification that was a NOOP. DAG size: 172 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 09:07:57,548 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_~#stack~0.base|)) (.cse4 (+ |c_~#stack~0.offset| 24)) (.cse30 (* |c_threadThread1of1ForFork0_Pop_~head1~0#1| 8))) (let ((.cse9 (+ .cse30 |c_~#stack~0.offset| 4)) (.cse13 (+ .cse30 |c_~#stack~0.offset|)) (.cse0 (select |c_#memory_int| 4)) (.cse20 (select |c_#memory_int| |c_threadThread1of1ForFork0_Push_~#head1~1#1.base|)) (.cse1 (select .cse16 .cse4)) (.cse2 (<= 2 |c_ULTIMATE.start_main_~i~2#1|)) (.cse10 (+ |c_~#stack~0.offset| 28))) (and (not (= |c_ULTIMATE.start_Init_~pushCount#1| 4)) (= |c_threadThread1of1ForFork0_atomic_store_~obj#1.offset| 4) (<= |c_~#threads~0.base| 3) (<= (select .cse0 28) 2) (= |c_threadThread1of1ForFork0_Push_~index#1| 0) (or (not (= |c_threadThread1of1ForFork0_atomic_store_~obj#1.offset| |c_threadThread1of1ForFork0_Push_~#head1~1#1.offset|)) (not (= |c_threadThread1of1ForFork0_Push_~#head1~1#1.base| |c_threadThread1of1ForFork0_atomic_store_~obj#1.base|)) (= |c_threadThread1of1ForFork0_atomic_store_~v#1| .cse1)) (not (= |c_threadThread1of1ForFork0_Push_~#head1~1#1.base| 0)) (not (= |c_~#threads~0.base| |c_~#stack~0.base|)) (= |c_threadThread1of1ForFork0_atomic_store_~obj#1.base| 4) (= |c_threadThread1of1ForFork0_atomic_store_~obj#1.base| |c_~#stack~0.base|) (= |c_~#stack~0.base| 4) (or .cse2 (forall ((v_ArrVal_930 (Array Int Int)) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| Int) (v_ArrVal_933 (Array Int Int)) (v_ArrVal_928 Int) (v_ArrVal_926 Int) (v_ArrVal_934 Int) (v_ArrVal_932 Int) (|v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| Int)) (let ((.cse6 (select |c_#memory_int| |c_threadThread1of1ForFork0_atomic_fetch_sub_#in~obj#1.base|))) (let ((.cse12 (store |c_#memory_int| |c_threadThread1of1ForFork0_atomic_fetch_sub_#in~obj#1.base| (store .cse6 |c_threadThread1of1ForFork0_atomic_fetch_sub_#in~obj#1.offset| v_ArrVal_926)))) (let ((.cse7 (store (select .cse12 |c_~#stack~0.base|) .cse13 v_ArrVal_928))) (let ((.cse8 (store .cse12 |c_~#stack~0.base| .cse7))) (let ((.cse11 (store .cse8 |c_~#threads~0.base| v_ArrVal_930))) (let ((.cse3 (store (select .cse11 |c_~#stack~0.base|) .cse9 v_ArrVal_932))) (let ((.cse5 (store .cse11 |c_~#stack~0.base| .cse3))) (or (= (select .cse3 .cse4) (select (select .cse5 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74|) 0)) (= |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| 0) (< (select .cse6 |c_threadThread1of1ForFork0_atomic_fetch_sub_#in~obj#1.offset|) (+ v_ArrVal_926 |c_threadThread1of1ForFork0_atomic_fetch_sub_#in~v#1|)) (not (= (select .cse7 .cse4) (select (select .cse8 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74|) 0))) (< .cse9 |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34|) (< (select (store (select (store .cse5 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| v_ArrVal_933) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| v_ArrVal_934) .cse10) 2147483647))))))))))) (or (forall ((v_ArrVal_930 (Array Int Int)) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| Int) (v_ArrVal_933 (Array Int Int)) (v_ArrVal_928 Int) (v_ArrVal_926 Int) (v_ArrVal_924 Int) (v_ArrVal_934 Int) (v_ArrVal_932 Int) (|v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| Int)) (let ((.cse17 (store (store (store .cse16 .cse4 v_ArrVal_924) .cse10 v_ArrVal_926) .cse13 v_ArrVal_928))) (let ((.cse18 (store |c_#memory_int| |c_~#stack~0.base| .cse17))) (let ((.cse19 (store .cse18 |c_~#threads~0.base| v_ArrVal_930))) (let ((.cse15 (store (select .cse19 |c_~#stack~0.base|) .cse9 v_ArrVal_932))) (let ((.cse14 (store .cse19 |c_~#stack~0.base| .cse15))) (or (= |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| 0) (= (select (select .cse14 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74|) 0) (select .cse15 .cse4)) (< (select .cse16 .cse10) (+ v_ArrVal_926 1)) (< (select (store (select (store .cse14 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| v_ArrVal_933) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| v_ArrVal_934) .cse10) 2147483647) (< .cse9 |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34|) (not (= (select .cse17 .cse4) (select (select .cse18 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74|) 0)))))))))) .cse2) (= (select .cse0 24) (select .cse20 0)) (not (= |c_threadThread1of1ForFork0_atomic_store_~obj#1.offset| .cse4)) (= 0 |c_threadThread1of1ForFork0_Push_~#head1~1#1.offset|) (or (forall ((v_ArrVal_930 (Array Int Int)) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| Int) (v_ArrVal_933 (Array Int Int)) (v_ArrVal_934 Int) (v_ArrVal_932 Int)) (let ((.cse21 (let ((.cse22 (store |c_#memory_int| |c_~#threads~0.base| v_ArrVal_930))) (store .cse22 |c_threadThread1of1ForFork0_atomic_store_~obj#1.base| (store (select .cse22 |c_threadThread1of1ForFork0_atomic_store_~obj#1.base|) |c_threadThread1of1ForFork0_atomic_store_~obj#1.offset| v_ArrVal_932))))) (or (< (+ (* 8 |c_threadThread1of1ForFork0_Push_~index#1|) |c_~#stack~0.offset| 4) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34|) (< (select (store (select (store .cse21 |c_threadThread1of1ForFork0_Push_~#head1~1#1.base| v_ArrVal_933) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| v_ArrVal_934) .cse10) 2147483647) (= (select (select .cse21 |c_~#stack~0.base|) .cse4) (select (select .cse21 |c_threadThread1of1ForFork0_Push_~#head1~1#1.base|) |c_threadThread1of1ForFork0_Push_~#head1~1#1.offset|))))) (<= 3 |c_ULTIMATE.start_main_~i~2#1|)) (= (select .cse20 |c_threadThread1of1ForFork0_Push_~#head1~1#1.offset|) .cse1) (= |c_~#stack~0.offset| 0) (= |c_~#threads~0.offset| 0) (= |c_ULTIMATE.start_main_~i~2#1| 1) (or .cse2 (forall ((v_ArrVal_930 (Array Int Int)) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| Int) (v_ArrVal_933 (Array Int Int)) (v_ArrVal_928 Int) (v_ArrVal_934 Int) (v_ArrVal_932 Int) (|v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| Int)) (let ((.cse29 (* |c_threadThread1of1ForFork0_~elem~0#1| 8))) (let ((.cse25 (store .cse16 (+ .cse29 |c_~#stack~0.offset|) v_ArrVal_928))) (let ((.cse26 (store |c_#memory_int| |c_~#stack~0.base| .cse25))) (let ((.cse28 (store .cse26 |c_~#threads~0.base| v_ArrVal_930)) (.cse23 (+ .cse29 |c_~#stack~0.offset| 4))) (let ((.cse27 (store (select .cse28 |c_~#stack~0.base|) .cse23 v_ArrVal_932))) (let ((.cse24 (store .cse28 |c_~#stack~0.base| .cse27))) (or (< .cse23 |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34|) (< (select (store (select (store .cse24 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| v_ArrVal_933) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_34| v_ArrVal_934) .cse10) 2147483647) (= |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74| 0) (not (= (select .cse25 .cse4) (select (select .cse26 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74|) 0))) (= (select .cse27 .cse4) (select (select .cse24 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_74|) 0))))))))))) (forall ((v_ArrVal_936 Int)) (< (select (select (store |c_#memory_int| |c_threadThread1of1ForFork0_atomic_compare_and_exchange_#in~obj#1.base| (store (select |c_#memory_int| |c_threadThread1of1ForFork0_atomic_compare_and_exchange_#in~obj#1.base|) |c_threadThread1of1ForFork0_atomic_compare_and_exchange_#in~obj#1.offset| v_ArrVal_936)) |c_~#stack~0.base|) .cse10) 2147483647)) (or (not (= |c_~#threads~0.base| |c_threadThread1of1ForFork0_Push_~#head1~1#1.base|)) (not (= (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) |c_~#threads~0.offset|) |c_threadThread1of1ForFork0_Push_~#head1~1#1.offset|)))))) is different from false [2023-08-30 09:08:09,263 WARN L222 SmtUtils]: Spent 5.99s on a formula simplification that was a NOOP. DAG size: 201 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 09:08:12,642 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 09:08:29,171 WARN L222 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 77 DAG size of output: 29 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 09:09:00,721 INFO L130 PetriNetUnfolder]: 669/2329 cut-off events. [2023-08-30 09:09:00,722 INFO L131 PetriNetUnfolder]: For 18992/18992 co-relation queries the response was YES. [2023-08-30 09:09:00,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16662 conditions, 2329 events. 669/2329 cut-off events. For 18992/18992 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 18053 event pairs, 32 based on Foata normal form. 5/2330 useless extension candidates. Maximal degree in co-relation 16580. Up to 1287 conditions per place. [2023-08-30 09:09:00,738 INFO L137 encePairwiseOnDemand]: 527/551 looper letters, 836 selfloop transitions, 282 changer transitions 24/1143 dead transitions. [2023-08-30 09:09:00,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 1143 transitions, 19637 flow [2023-08-30 09:09:00,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2023-08-30 09:09:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2023-08-30 09:09:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 11641 transitions. [2023-08-30 09:09:00,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24008001979871307 [2023-08-30 09:09:00,749 INFO L72 ComplementDD]: Start complementDD. Operand 88 states and 11641 transitions. [2023-08-30 09:09:00,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 11641 transitions. [2023-08-30 09:09:00,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:09:00,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 88 states and 11641 transitions. [2023-08-30 09:09:00,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 89 states, 88 states have (on average 132.2840909090909) internal successors, (11641), 88 states have internal predecessors, (11641), 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 09:09:00,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 89 states, 89 states have (on average 551.0) internal successors, (49039), 89 states have internal predecessors, (49039), 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 09:09:00,796 INFO L81 ComplementDD]: Finished complementDD. Result has 89 states, 89 states have (on average 551.0) internal successors, (49039), 89 states have internal predecessors, (49039), 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 09:09:00,796 INFO L175 Difference]: Start difference. First operand has 290 places, 673 transitions, 10752 flow. Second operand 88 states and 11641 transitions. [2023-08-30 09:09:00,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 1143 transitions, 19637 flow [2023-08-30 09:09:00,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 1143 transitions, 19211 flow, removed 80 selfloop flow, removed 10 redundant places. [2023-08-30 09:09:00,957 INFO L231 Difference]: Finished difference. Result has 403 places, 822 transitions, 13516 flow [2023-08-30 09:09:00,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=551, PETRI_DIFFERENCE_MINUEND_FLOW=10428, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=88, PETRI_FLOW=13516, PETRI_PLACES=403, PETRI_TRANSITIONS=822} [2023-08-30 09:09:00,958 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 357 predicate places. [2023-08-30 09:09:00,958 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 822 transitions, 13516 flow [2023-08-30 09:09:00,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 130.5090909090909) internal successors, (7178), 55 states have internal predecessors, (7178), 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 09:09:00,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:09:00,959 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:09:00,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-30 09:09:01,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-30 09:09:01,166 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 09:09:01,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:09:01,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1646495472, now seen corresponding path program 3 times [2023-08-30 09:09:01,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:09:01,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192376887] [2023-08-30 09:09:01,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:09:01,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:09:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:09:02,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 09:09:02,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:09:02,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192376887] [2023-08-30 09:09:02,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192376887] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:09:02,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430550703] [2023-08-30 09:09:02,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 09:09:02,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:09:02,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:09:02,522 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:09:02,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-30 09:09:02,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 09:09:02,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 09:09:02,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 195 conjunts are in the unsatisfiable core [2023-08-30 09:09:02,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:09:02,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-08-30 09:09:02,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-30 09:09:02,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-30 09:09:02,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:09:02,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:09:02,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-30 09:09:03,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:09:03,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-30 09:09:03,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:09:03,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:09:03,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-30 09:09:03,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-08-30 09:09:03,466 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 28 treesize of output 16 [2023-08-30 09:09:03,533 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 19 treesize of output 18 [2023-08-30 09:09:03,939 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 09:09:03,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 35 [2023-08-30 09:09:04,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:09:04,087 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-30 09:09:04,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 32 [2023-08-30 09:09:04,102 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 9 treesize of output 7 [2023-08-30 09:09:04,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:09:04,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-08-30 09:09:04,229 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 10 treesize of output 8 [2023-08-30 09:09:04,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:09:04,363 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 19 treesize of output 18 [2023-08-30 09:09:04,437 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 19 treesize of output 18 [2023-08-30 09:09:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 09:09:04,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:09:08,415 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37| Int) (v_ArrVal_1032 Int) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1037 Int) (v_ArrVal_1034 (Array Int Int))) (let ((.cse0 (+ (* 8 |c_threadThread1of1ForFork0_Push_~index#1|) |c_~#stack~0.offset| 4))) (let ((.cse1 (store (store |c_#memory_int| |c_~#stack~0.base| (store (select |c_#memory_int| |c_~#stack~0.base|) .cse0 v_ArrVal_1032)) |c_~#threads~0.base| v_ArrVal_1034))) (or (< .cse0 |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37|) (< (select (store (select (store .cse1 |c_threadThread1of1ForFork0_Push_~#head1~1#1.base| v_ArrVal_1035) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37| v_ArrVal_1037) (+ |c_~#stack~0.offset| 28)) 2147483647) (= (select (select .cse1 |c_~#stack~0.base|) (+ |c_~#stack~0.offset| 24)) (select (select .cse1 |c_threadThread1of1ForFork0_Push_~#head1~1#1.base|) |c_threadThread1of1ForFork0_Push_~#head1~1#1.offset|)))))) is different from false [2023-08-30 09:09:08,790 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37| Int) (v_ArrVal_1032 Int) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1037 Int) (v_ArrVal_1034 (Array Int Int)) (|v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| Int)) (let ((.cse2 (select |c_#memory_int| |c_~#stack~0.base|)) (.cse0 (+ (* |c_threadThread1of1ForFork0_~elem~0#1| 8) |c_~#stack~0.offset| 4))) (let ((.cse3 (+ |c_~#stack~0.offset| 24)) (.cse1 (store (store |c_#memory_int| |c_~#stack~0.base| (store .cse2 .cse0 v_ArrVal_1032)) |c_~#threads~0.base| v_ArrVal_1034))) (or (< .cse0 |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37|) (= |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| 0) (< (select (store (select (store .cse1 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| v_ArrVal_1035) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37| v_ArrVal_1037) (+ |c_~#stack~0.offset| 28)) 2147483647) (not (= (select (select |c_#memory_int| |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76|) 0) (select .cse2 .cse3))) (= (select (select .cse1 |c_~#stack~0.base|) .cse3) (select (select .cse1 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76|) 0)))))) is different from false [2023-08-30 09:09:09,683 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1031 Int) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37| Int) (v_ArrVal_1032 Int) (v_ArrVal_1026 Int) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1037 Int) (v_ArrVal_1034 (Array Int Int)) (|v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| Int) (v_ArrVal_1029 Int)) (let ((.cse2 (store |c_#memory_int| |c_threadThread1of1ForFork0_atomic_compare_and_exchange_~obj#1.base| (store (select |c_#memory_int| |c_threadThread1of1ForFork0_atomic_compare_and_exchange_~obj#1.base|) |c_threadThread1of1ForFork0_atomic_compare_and_exchange_~obj#1.offset| v_ArrVal_1026)))) (let ((.cse3 (select .cse2 |c_~#stack~0.base|)) (.cse4 (+ |c_~#stack~0.offset| 28)) (.cse7 (* |c_threadThread1of1ForFork0_Pop_~head1~0#1| 8))) (let ((.cse0 (store (store .cse3 .cse4 v_ArrVal_1029) (+ .cse7 |c_~#stack~0.offset|) v_ArrVal_1031)) (.cse6 (+ .cse7 |c_~#stack~0.offset| 4))) (let ((.cse1 (+ |c_~#stack~0.offset| 24)) (.cse5 (store (store .cse2 |c_~#stack~0.base| (store .cse0 .cse6 v_ArrVal_1032)) |c_~#threads~0.base| v_ArrVal_1034))) (or (not (= (select .cse0 .cse1) (select (select (store .cse2 |c_~#stack~0.base| .cse0) |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76|) 0))) (= |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| 0) (< (select .cse3 .cse4) (+ v_ArrVal_1029 1)) (< (select (store (select (store .cse5 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| v_ArrVal_1035) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37| v_ArrVal_1037) .cse4) 2147483647) (= (select (select .cse5 |c_~#stack~0.base|) .cse1) (select (select .cse5 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76|) 0)) (< .cse6 |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37|))))))) is different from false [2023-08-30 09:09:09,744 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1031 Int) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37| Int) (v_ArrVal_1032 Int) (v_ArrVal_1026 Int) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1037 Int) (v_ArrVal_1034 (Array Int Int)) (|v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| Int) (v_ArrVal_1029 Int)) (let ((.cse5 (select |c_#memory_int| |c_~#stack~0.base|)) (.cse2 (+ |c_~#stack~0.offset| 24)) (.cse1 (+ |c_~#stack~0.offset| 28)) (.cse6 (* |c_threadThread1of1ForFork0_Pop_~head1~0#1| 8))) (let ((.cse4 (store (store (store .cse5 .cse2 v_ArrVal_1026) .cse1 v_ArrVal_1029) (+ .cse6 |c_~#stack~0.offset|) v_ArrVal_1031)) (.cse3 (+ .cse6 |c_~#stack~0.offset| 4))) (let ((.cse0 (store (store |c_#memory_int| |c_~#stack~0.base| (store .cse4 .cse3 v_ArrVal_1032)) |c_~#threads~0.base| v_ArrVal_1034))) (or (< (select (store (select (store .cse0 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| v_ArrVal_1035) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37| v_ArrVal_1037) .cse1) 2147483647) (= |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| 0) (= (select (select .cse0 |c_~#stack~0.base|) .cse2) (select (select .cse0 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76|) 0)) (< .cse3 |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37|) (not (= (select (select (store |c_#memory_int| |c_~#stack~0.base| .cse4) |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76|) 0) (select .cse4 .cse2))) (< (select .cse5 .cse1) (+ v_ArrVal_1029 1))))))) is different from false [2023-08-30 09:09:09,835 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1031 Int) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37| Int) (v_ArrVal_1032 Int) (|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_56| Int) (v_ArrVal_1024 Int) (v_ArrVal_1026 Int) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1037 Int) (v_ArrVal_1034 (Array Int Int)) (|v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| Int) (v_ArrVal_1029 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_56| v_ArrVal_1024)) (.cse5 (+ |c_~#stack~0.offset| 24)) (.cse1 (+ |c_~#stack~0.offset| 28)) (.cse6 (* |c_threadThread1of1ForFork0_atomic_load_#res#1| 8))) (let ((.cse4 (store (store (store .cse3 .cse5 v_ArrVal_1026) .cse1 v_ArrVal_1029) (+ |c_~#stack~0.offset| .cse6) v_ArrVal_1031)) (.cse2 (+ |c_~#stack~0.offset| .cse6 4))) (let ((.cse0 (store (store |c_#memory_int| |c_~#stack~0.base| (store .cse4 .cse2 v_ArrVal_1032)) |c_~#threads~0.base| v_ArrVal_1034))) (or (< (select (store (select (store .cse0 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| v_ArrVal_1035) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37| v_ArrVal_1037) .cse1) 2147483647) (= |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| 0) (< .cse2 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_56|) (< (select .cse3 .cse1) (+ v_ArrVal_1029 1)) (not (= (select .cse4 .cse5) (select (select (store |c_#memory_int| |c_~#stack~0.base| .cse4) |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76|) 0))) (= (select (select .cse0 |c_~#stack~0.base|) .cse5) (select (select .cse0 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76|) 0)) (< .cse2 |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37|)))))) is different from false [2023-08-30 09:09:09,966 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1031 Int) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37| Int) (v_ArrVal_1032 Int) (|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_56| Int) (v_ArrVal_1024 Int) (v_ArrVal_1026 Int) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1037 Int) (v_ArrVal_1034 (Array Int Int)) (|v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| Int) (v_ArrVal_1029 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_56| v_ArrVal_1024)) (.cse1 (+ |c_~#stack~0.offset| 24)) (.cse3 (+ |c_~#stack~0.offset| 28)) (.cse6 (* (select (select |c_#memory_int| |c_threadThread1of1ForFork0_atomic_load_#in~obj#1.base|) |c_threadThread1of1ForFork0_atomic_load_#in~obj#1.offset|) 8))) (let ((.cse4 (store (store (store .cse2 .cse1 v_ArrVal_1026) .cse3 v_ArrVal_1029) (+ |c_~#stack~0.offset| .cse6) v_ArrVal_1031)) (.cse5 (+ |c_~#stack~0.offset| 4 .cse6))) (let ((.cse0 (store (store |c_#memory_int| |c_~#stack~0.base| (store .cse4 .cse5 v_ArrVal_1032)) |c_~#threads~0.base| v_ArrVal_1034))) (or (= (select (select .cse0 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76|) 0) (select (select .cse0 |c_~#stack~0.base|) .cse1)) (= |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| 0) (< (select .cse2 .cse3) (+ v_ArrVal_1029 1)) (not (= (select (select (store |c_#memory_int| |c_~#stack~0.base| .cse4) |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76|) 0) (select .cse4 .cse1))) (< .cse5 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_56|) (< .cse5 |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37|) (< (select (store (select (store .cse0 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| v_ArrVal_1035) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37| v_ArrVal_1037) .cse3) 2147483647)))))) is different from false [2023-08-30 09:09:11,340 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_56| Int) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1023 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (|v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| Int) (v_ArrVal_1031 Int) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37| Int) (v_ArrVal_1032 Int) (v_ArrVal_1024 Int) (v_ArrVal_1026 Int) (v_ArrVal_1037 Int) (v_ArrVal_1029 Int)) (let ((.cse4 (store |c_#memory_int| |c_~#threads~0.base| v_ArrVal_1023))) (let ((.cse6 (+ |c_~#stack~0.offset| 24)) (.cse8 (select .cse4 |c_~#stack~0.base|))) (let ((.cse2 (store .cse8 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_56| v_ArrVal_1024)) (.cse1 (+ |c_~#stack~0.offset| 28)) (.cse7 (* (select .cse8 .cse6) 8))) (let ((.cse5 (store (store (store .cse2 .cse6 v_ArrVal_1026) .cse1 v_ArrVal_1029) (+ .cse7 |c_~#stack~0.offset|) v_ArrVal_1031)) (.cse3 (+ .cse7 |c_~#stack~0.offset| 4))) (let ((.cse0 (store (store .cse4 |c_~#stack~0.base| (store .cse5 .cse3 v_ArrVal_1032)) |c_~#threads~0.base| v_ArrVal_1034))) (or (= |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| 0) (< (select (store (select (store .cse0 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| v_ArrVal_1035) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37| v_ArrVal_1037) .cse1) 2147483647) (< (select .cse2 .cse1) (+ v_ArrVal_1029 1)) (< .cse3 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_56|) (not (= (select (select (store .cse4 |c_~#stack~0.base| .cse5) |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76|) 0) (select .cse5 .cse6))) (= (select (select .cse0 |c_~#stack~0.base|) .cse6) (select (select .cse0 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76|) 0)) (< .cse3 |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37|)))))))) is different from false [2023-08-30 09:09:11,561 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_56| Int) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1023 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (|v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| Int) (v_ArrVal_1031 Int) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37| Int) (|v_ULTIMATE.start_atomic_store_~obj#1.offset_112| Int) (v_ArrVal_1022 Int) (v_ArrVal_1032 Int) (v_ArrVal_1024 Int) (v_ArrVal_1026 Int) (v_ArrVal_1037 Int) (v_ArrVal_1029 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_~#stack~0.base| (store (select |c_#memory_int| |c_~#stack~0.base|) |v_ULTIMATE.start_atomic_store_~obj#1.offset_112| v_ArrVal_1022)) |c_~#threads~0.base| v_ArrVal_1023))) (let ((.cse2 (+ |c_~#stack~0.offset| 24)) (.cse8 (select .cse0 |c_~#stack~0.base|))) (let ((.cse5 (store .cse8 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_56| v_ArrVal_1024)) (.cse4 (+ |c_~#stack~0.offset| 28)) (.cse7 (* 8 (select .cse8 .cse2)))) (let ((.cse1 (store (store (store .cse5 .cse2 v_ArrVal_1026) .cse4 v_ArrVal_1029) (+ .cse7 |c_~#stack~0.offset|) v_ArrVal_1031)) (.cse6 (+ .cse7 |c_~#stack~0.offset| 4))) (let ((.cse3 (store (store .cse0 |c_~#stack~0.base| (store .cse1 .cse6 v_ArrVal_1032)) |c_~#threads~0.base| v_ArrVal_1034))) (or (not (= (select (select (store .cse0 |c_~#stack~0.base| .cse1) |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76|) 0) (select .cse1 .cse2))) (= (select (select .cse3 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76|) 0) (select (select .cse3 |c_~#stack~0.base|) .cse2)) (= |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| 0) (< (select (store (select (store .cse3 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| v_ArrVal_1035) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37| v_ArrVal_1037) .cse4) 2147483647) (< (select .cse5 .cse4) (+ v_ArrVal_1029 1)) (< .cse6 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_56|) (< (+ (* |c_ULTIMATE.start_Init_~pushCount#1| 8) |c_~#stack~0.offset|) (+ 4 |v_ULTIMATE.start_atomic_store_~obj#1.offset_112|)) (< .cse6 |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37|)))))))) is different from false [2023-08-30 09:09:11,864 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_56| Int) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1023 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (|v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| Int) (v_ArrVal_1031 Int) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37| Int) (|v_ULTIMATE.start_atomic_store_~obj#1.offset_112| Int) (v_ArrVal_1022 Int) (v_ArrVal_1032 Int) (v_ArrVal_1024 Int) (v_ArrVal_1026 Int) (v_ArrVal_1037 Int) (v_ArrVal_1019 Int) (v_ArrVal_1029 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_~#stack~0.base| (store (store (select |c_#memory_int| |c_~#stack~0.base|) (+ |c_~#stack~0.offset| 4 (* |c_ULTIMATE.start_Init_~i~0#1| 8)) v_ArrVal_1019) |v_ULTIMATE.start_atomic_store_~obj#1.offset_112| v_ArrVal_1022)) |c_~#threads~0.base| v_ArrVal_1023))) (let ((.cse1 (+ |c_~#stack~0.offset| 24)) (.cse8 (select .cse2 |c_~#stack~0.base|))) (let ((.cse6 (store .cse8 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_56| v_ArrVal_1024)) (.cse5 (+ |c_~#stack~0.offset| 28)) (.cse7 (* 8 (select .cse8 .cse1)))) (let ((.cse0 (store (store (store .cse6 .cse1 v_ArrVal_1026) .cse5 v_ArrVal_1029) (+ |c_~#stack~0.offset| .cse7) v_ArrVal_1031)) (.cse4 (+ |c_~#stack~0.offset| 4 .cse7))) (let ((.cse3 (store (store .cse2 |c_~#stack~0.base| (store .cse0 .cse4 v_ArrVal_1032)) |c_~#threads~0.base| v_ArrVal_1034))) (or (= |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| 0) (not (= (select .cse0 .cse1) (select (select (store .cse2 |c_~#stack~0.base| .cse0) |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76|) 0))) (= (select (select .cse3 |c_~#stack~0.base|) .cse1) (select (select .cse3 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76|) 0)) (< .cse4 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_56|) (< .cse4 |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37|) (< (select (store (select (store .cse3 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| v_ArrVal_1035) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37| v_ArrVal_1037) .cse5) 2147483647) (< (select .cse6 .cse5) (+ v_ArrVal_1029 1)) (< (+ (* |c_ULTIMATE.start_Init_~pushCount#1| 8) |c_~#stack~0.offset|) (+ 4 |v_ULTIMATE.start_atomic_store_~obj#1.offset_112|))))))))) is different from false [2023-08-30 09:09:12,277 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_56| Int) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1023 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (|v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| Int) (v_ArrVal_1031 Int) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37| Int) (|v_ULTIMATE.start_atomic_store_~obj#1.offset_112| Int) (v_ArrVal_1022 Int) (v_ArrVal_1032 Int) (v_ArrVal_1024 Int) (v_ArrVal_1026 Int) (v_ArrVal_1037 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int) (v_ArrVal_1029 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_~#stack~0.base| (store (let ((.cse9 (* |c_ULTIMATE.start_Init_~i~0#1| 8))) (store (store (select |c_#memory_int| |c_~#stack~0.base|) (+ |c_~#stack~0.offset| 4 .cse9) v_ArrVal_1017) (+ 12 |c_~#stack~0.offset| .cse9) v_ArrVal_1019)) |v_ULTIMATE.start_atomic_store_~obj#1.offset_112| v_ArrVal_1022)) |c_~#threads~0.base| v_ArrVal_1023))) (let ((.cse5 (+ |c_~#stack~0.offset| 24)) (.cse8 (select .cse6 |c_~#stack~0.base|))) (let ((.cse2 (store .cse8 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_56| v_ArrVal_1024)) (.cse1 (+ |c_~#stack~0.offset| 28)) (.cse7 (* (select .cse8 .cse5) 8))) (let ((.cse4 (store (store (store .cse2 .cse5 v_ArrVal_1026) .cse1 v_ArrVal_1029) (+ .cse7 |c_~#stack~0.offset|) v_ArrVal_1031)) (.cse3 (+ .cse7 |c_~#stack~0.offset| 4))) (let ((.cse0 (store (store .cse6 |c_~#stack~0.base| (store .cse4 .cse3 v_ArrVal_1032)) |c_~#threads~0.base| v_ArrVal_1034))) (or (< (select (store (select (store .cse0 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| v_ArrVal_1035) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37| v_ArrVal_1037) .cse1) 2147483647) (= |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76| 0) (< (select .cse2 .cse1) (+ v_ArrVal_1029 1)) (< .cse3 |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_37|) (not (= (select .cse4 .cse5) (select (select (store .cse6 |c_~#stack~0.base| .cse4) |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76|) 0))) (= (select (select .cse0 |v_threadThread1of1ForFork0_Push_~#head1~1#1.base_76|) 0) (select (select .cse0 |c_~#stack~0.base|) .cse5)) (< .cse3 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_56|) (< (+ (* |c_ULTIMATE.start_Init_~pushCount#1| 8) |c_~#stack~0.offset|) (+ 4 |v_ULTIMATE.start_atomic_store_~obj#1.offset_112|))))))))) is different from false [2023-08-30 09:09:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-08-30 09:09:12,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430550703] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:09:12,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:09:12,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20, 22] total 54 [2023-08-30 09:09:12,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720898817] [2023-08-30 09:09:12,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:09:12,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-08-30 09:09:12,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:09:12,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-08-30 09:09:12,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1752, Unknown=94, NotChecked=950, Total=2970 [2023-08-30 09:09:12,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 551 [2023-08-30 09:09:12,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 822 transitions, 13516 flow. Second operand has 55 states, 55 states have (on average 130.5090909090909) internal successors, (7178), 55 states have internal predecessors, (7178), 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 09:09:12,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:09:12,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 551 [2023-08-30 09:09:12,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15