./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a7db49c8892594e32a30fa9165fc3ad1a94911917cd8b63757bb8f24f04b536 --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 17:58:27,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 17:58:27,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 17:58:27,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 17:58:27,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 17:58:27,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 17:58:27,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 17:58:27,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 17:58:27,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 17:58:27,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 17:58:27,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 17:58:27,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 17:58:27,631 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 17:58:27,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 17:58:27,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 17:58:27,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 17:58:27,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 17:58:27,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 17:58:27,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 17:58:27,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 17:58:27,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 17:58:27,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 17:58:27,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 17:58:27,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 17:58:27,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 17:58:27,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 17:58:27,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 17:58:27,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 17:58:27,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 17:58:27,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 17:58:27,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 17:58:27,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 17:58:27,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 17:58:27,662 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 17:58:27,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 17:58:27,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 17:58:27,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 17:58:27,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 17:58:27,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 17:58:27,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 17:58:27,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 17:58:27,667 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 17:58:27,698 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 17:58:27,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 17:58:27,700 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 17:58:27,700 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 17:58:27,701 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 17:58:27,701 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 17:58:27,701 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 17:58:27,702 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 17:58:27,702 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 17:58:27,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 17:58:27,703 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 17:58:27,703 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 17:58:27,703 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 17:58:27,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 17:58:27,704 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 17:58:27,704 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 17:58:27,704 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 17:58:27,704 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 17:58:27,704 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 17:58:27,705 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 17:58:27,705 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 17:58:27,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 17:58:27,705 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 17:58:27,705 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 17:58:27,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 17:58:27,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 17:58:27,706 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 17:58:27,706 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 17:58:27,706 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 17:58:27,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 17:58:27,707 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 17:58:27,707 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 17:58:27,707 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 17:58:27,708 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 17:58:27,708 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 17:58:27,708 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a7db49c8892594e32a30fa9165fc3ad1a94911917cd8b63757bb8f24f04b536 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 17:58:27,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 17:58:28,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 17:58:28,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 17:58:28,017 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 17:58:28,018 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 17:58:28,019 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2023-08-30 17:58:29,247 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 17:58:29,534 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 17:58:29,534 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2023-08-30 17:58:29,545 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13534681f/bb58d2ab691541e8aecbbee520d09e22/FLAGbc4f80a32 [2023-08-30 17:58:29,559 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13534681f/bb58d2ab691541e8aecbbee520d09e22 [2023-08-30 17:58:29,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 17:58:29,562 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 17:58:29,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 17:58:29,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 17:58:29,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 17:58:29,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:58:29" (1/1) ... [2023-08-30 17:58:29,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@614bb9da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:58:29, skipping insertion in model container [2023-08-30 17:58:29,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:58:29" (1/1) ... [2023-08-30 17:58:29,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 17:58:29,604 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 17:58:29,974 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i[41323,41336] [2023-08-30 17:58:30,003 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 17:58:30,031 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 17:58:30,134 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i[41323,41336] [2023-08-30 17:58:30,142 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 17:58:30,205 INFO L208 MainTranslator]: Completed translation [2023-08-30 17:58:30,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:58:30 WrapperNode [2023-08-30 17:58:30,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 17:58:30,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 17:58:30,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 17:58:30,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 17:58:30,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:58:30" (1/1) ... [2023-08-30 17:58:30,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:58:30" (1/1) ... [2023-08-30 17:58:30,252 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 190 [2023-08-30 17:58:30,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 17:58:30,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 17:58:30,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 17:58:30,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 17:58:30,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:58:30" (1/1) ... [2023-08-30 17:58:30,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:58:30" (1/1) ... [2023-08-30 17:58:30,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:58:30" (1/1) ... [2023-08-30 17:58:30,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:58:30" (1/1) ... [2023-08-30 17:58:30,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:58:30" (1/1) ... [2023-08-30 17:58:30,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:58:30" (1/1) ... [2023-08-30 17:58:30,295 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:58:30" (1/1) ... [2023-08-30 17:58:30,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:58:30" (1/1) ... [2023-08-30 17:58:30,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 17:58:30,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 17:58:30,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 17:58:30,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 17:58:30,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:58:30" (1/1) ... [2023-08-30 17:58:30,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 17:58:30,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:58:30,337 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 17:58:30,341 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 17:58:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 17:58:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 17:58:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 17:58:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 17:58:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 17:58:30,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 17:58:30,371 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-30 17:58:30,371 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-30 17:58:30,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 17:58:30,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 17:58:30,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 17:58:30,373 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 17:58:30,512 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 17:58:30,513 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 17:58:30,765 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 17:58:30,772 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 17:58:30,773 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-30 17:58:30,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:58:30 BoogieIcfgContainer [2023-08-30 17:58:30,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 17:58:30,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 17:58:30,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 17:58:30,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 17:58:30,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 05:58:29" (1/3) ... [2023-08-30 17:58:30,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@771be346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:58:30, skipping insertion in model container [2023-08-30 17:58:30,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:58:30" (2/3) ... [2023-08-30 17:58:30,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@771be346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:58:30, skipping insertion in model container [2023-08-30 17:58:30,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:58:30" (3/3) ... [2023-08-30 17:58:30,781 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_74-tricky_address1_racefree.i [2023-08-30 17:58:30,788 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 17:58:30,796 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 17:58:30,796 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 17:58:30,796 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 17:58:30,882 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-30 17:58:30,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 190 transitions, 388 flow [2023-08-30 17:58:31,004 INFO L130 PetriNetUnfolder]: 45/260 cut-off events. [2023-08-30 17:58:31,004 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-30 17:58:31,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 260 events. 45/260 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 817 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-08-30 17:58:31,012 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 190 transitions, 388 flow [2023-08-30 17:58:31,017 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 185 transitions, 375 flow [2023-08-30 17:58:31,020 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 17:58:31,028 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 185 transitions, 375 flow [2023-08-30 17:58:31,033 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 185 transitions, 375 flow [2023-08-30 17:58:31,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 185 transitions, 375 flow [2023-08-30 17:58:31,097 INFO L130 PetriNetUnfolder]: 44/255 cut-off events. [2023-08-30 17:58:31,098 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:58:31,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 255 events. 44/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 776 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-08-30 17:58:31,108 INFO L119 LiptonReduction]: Number of co-enabled transitions 10336 [2023-08-30 17:58:33,623 INFO L134 LiptonReduction]: Checked pairs total: 15158 [2023-08-30 17:58:33,623 INFO L136 LiptonReduction]: Total number of compositions: 151 [2023-08-30 17:58:33,644 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 17:58:33,651 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;@374301eb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 17:58:33,651 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-30 17:58:33,656 INFO L130 PetriNetUnfolder]: 5/25 cut-off events. [2023-08-30 17:58:33,656 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:58:33,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:58:33,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 17:58:33,658 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 17:58:33,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:58:33,662 INFO L85 PathProgramCache]: Analyzing trace with hash 826457834, now seen corresponding path program 1 times [2023-08-30 17:58:33,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:58:33,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491149139] [2023-08-30 17:58:33,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:58:33,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:58:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:58:33,891 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 17:58:33,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:58:33,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491149139] [2023-08-30 17:58:33,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491149139] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 17:58:33,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 17:58:33,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 17:58:33,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556011838] [2023-08-30 17:58:33,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 17:58:33,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 17:58:33,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:58:33,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 17:58:33,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 17:58:33,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 341 [2023-08-30 17:58:33,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 65 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 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 17:58:33,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:58:33,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 341 [2023-08-30 17:58:33,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:58:34,095 INFO L130 PetriNetUnfolder]: 301/651 cut-off events. [2023-08-30 17:58:34,095 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:58:34,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 651 events. 301/651 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3189 event pairs, 266 based on Foata normal form. 107/643 useless extension candidates. Maximal degree in co-relation 1189. Up to 588 conditions per place. [2023-08-30 17:58:34,098 INFO L137 encePairwiseOnDemand]: 318/341 looper letters, 36 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-08-30 17:58:34,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 173 flow [2023-08-30 17:58:34,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 17:58:34,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 17:58:34,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2023-08-30 17:58:34,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.512218963831867 [2023-08-30 17:58:34,112 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2023-08-30 17:58:34,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2023-08-30 17:58:34,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:58:34,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2023-08-30 17:58:34,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 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 17:58:34,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 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 17:58:34,125 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 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 17:58:34,127 INFO L175 Difference]: Start difference. First operand has 45 places, 65 transitions, 135 flow. Second operand 3 states and 524 transitions. [2023-08-30 17:58:34,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 173 flow [2023-08-30 17:58:34,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 173 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 17:58:34,131 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 107 flow [2023-08-30 17:58:34,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2023-08-30 17:58:34,134 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-08-30 17:58:34,134 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 107 flow [2023-08-30 17:58:34,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 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 17:58:34,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:58:34,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:58:34,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 17:58:34,135 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 17:58:34,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:58:34,136 INFO L85 PathProgramCache]: Analyzing trace with hash -669135341, now seen corresponding path program 1 times [2023-08-30 17:58:34,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:58:34,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958281417] [2023-08-30 17:58:34,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:58:34,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:58:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:58:34,255 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 17:58:34,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:58:34,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958281417] [2023-08-30 17:58:34,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958281417] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:58:34,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3614171] [2023-08-30 17:58:34,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:58:34,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:58:34,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:58:34,269 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 17:58:34,297 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 17:58:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:58:34,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-30 17:58:34,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:58:34,375 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 17:58:34,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 17:58:34,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3614171] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 17:58:34,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 17:58:34,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-30 17:58:34,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074920470] [2023-08-30 17:58:34,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 17:58:34,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 17:58:34,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:58:34,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 17:58:34,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 17:58:34,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 341 [2023-08-30 17:58:34,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 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 17:58:34,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:58:34,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 341 [2023-08-30 17:58:34,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:58:34,553 INFO L130 PetriNetUnfolder]: 283/635 cut-off events. [2023-08-30 17:58:34,554 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:58:34,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 635 events. 283/635 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3546 event pairs, 0 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 1221. Up to 555 conditions per place. [2023-08-30 17:58:34,556 INFO L137 encePairwiseOnDemand]: 338/341 looper letters, 51 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-30 17:58:34,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 243 flow [2023-08-30 17:58:34,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 17:58:34,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 17:58:34,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2023-08-30 17:58:34,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063538611925709 [2023-08-30 17:58:34,559 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2023-08-30 17:58:34,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2023-08-30 17:58:34,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:58:34,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2023-08-30 17:58:34,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 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 17:58:34,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 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 17:58:34,565 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 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 17:58:34,565 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 107 flow. Second operand 3 states and 518 transitions. [2023-08-30 17:58:34,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 243 flow [2023-08-30 17:58:34,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 239 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 17:58:34,568 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 111 flow [2023-08-30 17:58:34,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-08-30 17:58:34,569 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2023-08-30 17:58:34,569 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 111 flow [2023-08-30 17:58:34,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 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 17:58:34,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:58:34,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:58:34,580 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 17:58:34,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:58:34,776 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 17:58:34,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:58:34,777 INFO L85 PathProgramCache]: Analyzing trace with hash 735439460, now seen corresponding path program 1 times [2023-08-30 17:58:34,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:58:34,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969764331] [2023-08-30 17:58:34,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:58:34,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:58:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:58:34,863 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 17:58:34,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:58:34,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969764331] [2023-08-30 17:58:34,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969764331] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:58:34,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086273667] [2023-08-30 17:58:34,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:58:34,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:58:34,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:58:34,869 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 17:58:34,897 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 17:58:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:58:34,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 17:58:34,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:58:34,990 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 17:58:34,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:58:35,004 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 17:58:35,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086273667] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:58:35,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:58:35,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 17:58:35,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502253390] [2023-08-30 17:58:35,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:58:35,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 17:58:35,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:58:35,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 17:58:35,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 17:58:35,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 341 [2023-08-30 17:58:35,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 111 flow. Second operand has 7 states, 7 states have (on average 155.85714285714286) internal successors, (1091), 7 states have internal predecessors, (1091), 0 states have call successors, (0), 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 17:58:35,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:58:35,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 341 [2023-08-30 17:58:35,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:58:35,197 INFO L130 PetriNetUnfolder]: 301/637 cut-off events. [2023-08-30 17:58:35,198 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2023-08-30 17:58:35,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 637 events. 301/637 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3076 event pairs, 266 based on Foata normal form. 3/547 useless extension candidates. Maximal degree in co-relation 1245. Up to 571 conditions per place. [2023-08-30 17:58:35,200 INFO L137 encePairwiseOnDemand]: 338/341 looper letters, 36 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2023-08-30 17:58:35,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 205 flow [2023-08-30 17:58:35,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 17:58:35,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 17:58:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 968 transitions. [2023-08-30 17:58:35,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2023-08-30 17:58:35,204 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 968 transitions. [2023-08-30 17:58:35,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 968 transitions. [2023-08-30 17:58:35,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:58:35,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 968 transitions. [2023-08-30 17:58:35,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 161.33333333333334) internal successors, (968), 6 states have internal predecessors, (968), 0 states have call successors, (0), 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 17:58:35,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 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 17:58:35,212 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 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 17:58:35,212 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 111 flow. Second operand 6 states and 968 transitions. [2023-08-30 17:58:35,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 205 flow [2023-08-30 17:58:35,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 49 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 17:58:35,214 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 143 flow [2023-08-30 17:58:35,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=143, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2023-08-30 17:58:35,215 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2023-08-30 17:58:35,215 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 143 flow [2023-08-30 17:58:35,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 155.85714285714286) internal successors, (1091), 7 states have internal predecessors, (1091), 0 states have call successors, (0), 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 17:58:35,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:58:35,216 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:58:35,227 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 17:58:35,422 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,SelfDestructingSolverStorable2 [2023-08-30 17:58:35,423 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 17:58:35,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:58:35,423 INFO L85 PathProgramCache]: Analyzing trace with hash 967406523, now seen corresponding path program 2 times [2023-08-30 17:58:35,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:58:35,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051025752] [2023-08-30 17:58:35,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:58:35,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:58:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:58:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 17:58:35,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:58:35,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051025752] [2023-08-30 17:58:35,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051025752] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:58:35,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431271700] [2023-08-30 17:58:35,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 17:58:35,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:58:35,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:58:35,556 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 17:58:35,557 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 17:58:35,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 17:58:35,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 17:58:35,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-30 17:58:35,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:58:35,666 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 7 treesize of output 6 [2023-08-30 17:58:35,739 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 17:58:35,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 17:58:35,776 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 13 treesize of output 15 [2023-08-30 17:58:35,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-30 17:58:35,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 17:58:35,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431271700] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 17:58:35,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 17:58:35,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-30 17:58:35,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879494496] [2023-08-30 17:58:35,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 17:58:35,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 17:58:35,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:58:35,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 17:58:35,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-30 17:58:35,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 341 [2023-08-30 17:58:35,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 148.33333333333334) internal successors, (890), 6 states have internal predecessors, (890), 0 states have call successors, (0), 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 17:58:35,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:58:35,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 341 [2023-08-30 17:58:35,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:58:36,181 INFO L130 PetriNetUnfolder]: 298/678 cut-off events. [2023-08-30 17:58:36,182 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-08-30 17:58:36,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 678 events. 298/678 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3515 event pairs, 49 based on Foata normal form. 0/600 useless extension candidates. Maximal degree in co-relation 1314. Up to 416 conditions per place. [2023-08-30 17:58:36,185 INFO L137 encePairwiseOnDemand]: 333/341 looper letters, 44 selfloop transitions, 6 changer transitions 34/91 dead transitions. [2023-08-30 17:58:36,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 91 transitions, 399 flow [2023-08-30 17:58:36,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 17:58:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 17:58:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 965 transitions. [2023-08-30 17:58:36,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47165200391006845 [2023-08-30 17:58:36,188 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 965 transitions. [2023-08-30 17:58:36,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 965 transitions. [2023-08-30 17:58:36,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:58:36,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 965 transitions. [2023-08-30 17:58:36,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 160.83333333333334) internal successors, (965), 6 states have internal predecessors, (965), 0 states have call successors, (0), 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 17:58:36,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 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 17:58:36,196 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 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 17:58:36,196 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 143 flow. Second operand 6 states and 965 transitions. [2023-08-30 17:58:36,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 91 transitions, 399 flow [2023-08-30 17:58:36,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 91 transitions, 385 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 17:58:36,200 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 157 flow [2023-08-30 17:58:36,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=157, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2023-08-30 17:58:36,202 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 19 predicate places. [2023-08-30 17:58:36,202 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 157 flow [2023-08-30 17:58:36,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.33333333333334) internal successors, (890), 6 states have internal predecessors, (890), 0 states have call successors, (0), 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 17:58:36,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:58:36,203 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:58:36,212 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 17:58:36,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:58:36,409 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 17:58:36,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:58:36,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1432371976, now seen corresponding path program 1 times [2023-08-30 17:58:36,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:58:36,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882013462] [2023-08-30 17:58:36,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:58:36,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:58:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:58:36,471 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-30 17:58:36,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:58:36,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882013462] [2023-08-30 17:58:36,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882013462] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:58:36,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327737084] [2023-08-30 17:58:36,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:58:36,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:58:36,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:58:36,474 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 17:58:36,476 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 17:58:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:58:36,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 17:58:36,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:58:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 17:58:36,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:58:36,632 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 17:58:36,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327737084] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:58:36,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:58:36,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-30 17:58:36,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996857984] [2023-08-30 17:58:36,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:58:36,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 17:58:36,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:58:36,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 17:58:36,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-30 17:58:36,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 341 [2023-08-30 17:58:36,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 157 flow. Second operand has 14 states, 14 states have (on average 153.07142857142858) internal successors, (2143), 14 states have internal predecessors, (2143), 0 states have call successors, (0), 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 17:58:36,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:58:36,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 341 [2023-08-30 17:58:36,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:58:36,738 INFO L130 PetriNetUnfolder]: 23/80 cut-off events. [2023-08-30 17:58:36,738 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2023-08-30 17:58:36,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 80 events. 23/80 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 124 event pairs, 8 based on Foata normal form. 18/95 useless extension candidates. Maximal degree in co-relation 204. Up to 46 conditions per place. [2023-08-30 17:58:36,739 INFO L137 encePairwiseOnDemand]: 336/341 looper letters, 0 selfloop transitions, 0 changer transitions 43/43 dead transitions. [2023-08-30 17:58:36,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 43 transitions, 236 flow [2023-08-30 17:58:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 17:58:36,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 17:58:36,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2160 transitions. [2023-08-30 17:58:36,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45245077503142017 [2023-08-30 17:58:36,746 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2160 transitions. [2023-08-30 17:58:36,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2160 transitions. [2023-08-30 17:58:36,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:58:36,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2160 transitions. [2023-08-30 17:58:36,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 154.28571428571428) internal successors, (2160), 14 states have internal predecessors, (2160), 0 states have call successors, (0), 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 17:58:36,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 341.0) internal successors, (5115), 15 states have internal predecessors, (5115), 0 states have call successors, (0), 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 17:58:36,761 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 341.0) internal successors, (5115), 15 states have internal predecessors, (5115), 0 states have call successors, (0), 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 17:58:36,761 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 157 flow. Second operand 14 states and 2160 transitions. [2023-08-30 17:58:36,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 43 transitions, 236 flow [2023-08-30 17:58:36,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 213 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-30 17:58:36,773 INFO L231 Difference]: Finished difference. Result has 46 places, 0 transitions, 0 flow [2023-08-30 17:58:36,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=0, PETRI_PLACES=46, PETRI_TRANSITIONS=0} [2023-08-30 17:58:36,774 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2023-08-30 17:58:36,774 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 0 transitions, 0 flow [2023-08-30 17:58:36,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 153.07142857142858) internal successors, (2143), 14 states have internal predecessors, (2143), 0 states have call successors, (0), 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 17:58:36,777 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-30 17:58:36,778 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-30 17:58:36,778 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-30 17:58:36,787 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 17:58:36,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:58:36,984 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2023-08-30 17:58:36,986 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-30 17:58:36,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 190 transitions, 388 flow [2023-08-30 17:58:37,007 INFO L130 PetriNetUnfolder]: 45/260 cut-off events. [2023-08-30 17:58:37,007 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-30 17:58:37,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 260 events. 45/260 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 817 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-08-30 17:58:37,008 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 190 transitions, 388 flow [2023-08-30 17:58:37,010 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 185 transitions, 375 flow [2023-08-30 17:58:37,010 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 17:58:37,010 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 185 transitions, 375 flow [2023-08-30 17:58:37,010 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 185 transitions, 375 flow [2023-08-30 17:58:37,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 185 transitions, 375 flow [2023-08-30 17:58:37,027 INFO L130 PetriNetUnfolder]: 44/255 cut-off events. [2023-08-30 17:58:37,027 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:58:37,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 255 events. 44/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 776 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-08-30 17:58:37,032 INFO L119 LiptonReduction]: Number of co-enabled transitions 10336 [2023-08-30 17:58:39,231 INFO L134 LiptonReduction]: Checked pairs total: 16649 [2023-08-30 17:58:39,231 INFO L136 LiptonReduction]: Total number of compositions: 150 [2023-08-30 17:58:39,232 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-30 17:58:39,233 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;@374301eb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 17:58:39,233 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-30 17:58:39,236 INFO L130 PetriNetUnfolder]: 11/41 cut-off events. [2023-08-30 17:58:39,236 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:58:39,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:58:39,237 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-30 17:58:39,237 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 17:58:39,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:58:39,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1785070566, now seen corresponding path program 1 times [2023-08-30 17:58:39,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:58:39,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398079277] [2023-08-30 17:58:39,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:58:39,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:58:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:58:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 17:58:39,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:58:39,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398079277] [2023-08-30 17:58:39,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398079277] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 17:58:39,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 17:58:39,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 17:58:39,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427689109] [2023-08-30 17:58:39,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 17:58:39,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 17:58:39,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:58:39,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 17:58:39,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 17:58:39,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 340 [2023-08-30 17:58:39,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 66 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 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 17:58:39,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:58:39,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 340 [2023-08-30 17:58:39,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:58:39,378 INFO L130 PetriNetUnfolder]: 300/656 cut-off events. [2023-08-30 17:58:39,378 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:58:39,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 656 events. 300/656 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3223 event pairs, 266 based on Foata normal form. 108/654 useless extension candidates. Maximal degree in co-relation 1194. Up to 588 conditions per place. [2023-08-30 17:58:39,380 INFO L137 encePairwiseOnDemand]: 316/340 looper letters, 20 selfloop transitions, 2 changer transitions 19/46 dead transitions. [2023-08-30 17:58:39,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 173 flow [2023-08-30 17:58:39,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 17:58:39,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 17:58:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2023-08-30 17:58:39,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147058823529411 [2023-08-30 17:58:39,382 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2023-08-30 17:58:39,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2023-08-30 17:58:39,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:58:39,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2023-08-30 17:58:39,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 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 17:58:39,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 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 17:58:39,386 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 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 17:58:39,386 INFO L175 Difference]: Start difference. First operand has 45 places, 66 transitions, 137 flow. Second operand 3 states and 525 transitions. [2023-08-30 17:58:39,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 173 flow [2023-08-30 17:58:39,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 173 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 17:58:39,387 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 69 flow [2023-08-30 17:58:39,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=48, PETRI_TRANSITIONS=27} [2023-08-30 17:58:39,388 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-08-30 17:58:39,388 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 69 flow [2023-08-30 17:58:39,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 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 17:58:39,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:58:39,389 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-30 17:58:39,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 17:58:39,389 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 17:58:39,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:58:39,390 INFO L85 PathProgramCache]: Analyzing trace with hash -523375806, now seen corresponding path program 1 times [2023-08-30 17:58:39,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:58:39,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522647594] [2023-08-30 17:58:39,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:58:39,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:58:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:58:39,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 17:58:39,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:58:39,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522647594] [2023-08-30 17:58:39,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522647594] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:58:39,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521797754] [2023-08-30 17:58:39,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:58:39,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:58:39,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:58:39,427 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 17:58:39,453 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 17:58:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:58:39,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 17:58:39,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:58:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 17:58:39,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:58:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 17:58:39,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521797754] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:58:39,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:58:39,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 17:58:39,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166988848] [2023-08-30 17:58:39,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:58:39,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 17:58:39,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:58:39,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 17:58:39,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 17:58:39,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 340 [2023-08-30 17:58:39,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 27 transitions, 69 flow. Second operand has 7 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 0 states have call successors, (0), 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 17:58:39,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:58:39,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 340 [2023-08-30 17:58:39,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:58:39,566 INFO L130 PetriNetUnfolder]: 47/128 cut-off events. [2023-08-30 17:58:39,566 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:58:39,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 128 events. 47/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 358 event pairs, 42 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 243. Up to 108 conditions per place. [2023-08-30 17:58:39,567 INFO L137 encePairwiseOnDemand]: 337/340 looper letters, 20 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-08-30 17:58:39,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 131 flow [2023-08-30 17:58:39,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 17:58:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 17:58:39,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 952 transitions. [2023-08-30 17:58:39,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-08-30 17:58:39,569 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 952 transitions. [2023-08-30 17:58:39,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 952 transitions. [2023-08-30 17:58:39,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:58:39,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 952 transitions. [2023-08-30 17:58:39,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 158.66666666666666) internal successors, (952), 6 states have internal predecessors, (952), 0 states have call successors, (0), 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 17:58:39,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 340.0) internal successors, (2380), 7 states have internal predecessors, (2380), 0 states have call successors, (0), 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 17:58:39,575 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 340.0) internal successors, (2380), 7 states have internal predecessors, (2380), 0 states have call successors, (0), 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 17:58:39,575 INFO L175 Difference]: Start difference. First operand has 48 places, 27 transitions, 69 flow. Second operand 6 states and 952 transitions. [2023-08-30 17:58:39,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 131 flow [2023-08-30 17:58:39,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 127 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 17:58:39,576 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 101 flow [2023-08-30 17:58:39,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=101, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-08-30 17:58:39,577 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2023-08-30 17:58:39,577 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 101 flow [2023-08-30 17:58:39,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 0 states have call successors, (0), 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 17:58:39,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:58:39,578 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-30 17:58:39,586 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 17:58:39,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:58:39,784 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 17:58:39,784 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:58:39,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1162836454, now seen corresponding path program 2 times [2023-08-30 17:58:39,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:58:39,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421744976] [2023-08-30 17:58:39,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:58:39,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:58:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:58:39,863 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 17:58:39,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:58:39,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421744976] [2023-08-30 17:58:39,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421744976] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:58:39,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130581963] [2023-08-30 17:58:39,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 17:58:39,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:58:39,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:58:39,865 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 17:58:39,892 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 17:58:39,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 17:58:39,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 17:58:39,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 17:58:39,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:58:39,960 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 17:58:39,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:58:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 17:58:40,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130581963] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:58:40,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:58:40,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-30 17:58:40,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512062188] [2023-08-30 17:58:40,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:58:40,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 17:58:40,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:58:40,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 17:58:40,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-30 17:58:40,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 340 [2023-08-30 17:58:40,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 101 flow. Second operand has 13 states, 13 states have (on average 155.30769230769232) internal successors, (2019), 13 states have internal predecessors, (2019), 0 states have call successors, (0), 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 17:58:40,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:58:40,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 340 [2023-08-30 17:58:40,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:58:40,119 INFO L130 PetriNetUnfolder]: 47/134 cut-off events. [2023-08-30 17:58:40,119 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-30 17:58:40,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 134 events. 47/134 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 358 event pairs, 42 based on Foata normal form. 6/116 useless extension candidates. Maximal degree in co-relation 234. Up to 108 conditions per place. [2023-08-30 17:58:40,120 INFO L137 encePairwiseOnDemand]: 337/340 looper letters, 20 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2023-08-30 17:58:40,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 199 flow [2023-08-30 17:58:40,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 17:58:40,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 17:58:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1885 transitions. [2023-08-30 17:58:40,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46200980392156865 [2023-08-30 17:58:40,125 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1885 transitions. [2023-08-30 17:58:40,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1885 transitions. [2023-08-30 17:58:40,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:58:40,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1885 transitions. [2023-08-30 17:58:40,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 157.08333333333334) internal successors, (1885), 12 states have internal predecessors, (1885), 0 states have call successors, (0), 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 17:58:40,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 340.0) internal successors, (4420), 13 states have internal predecessors, (4420), 0 states have call successors, (0), 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 17:58:40,136 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 340.0) internal successors, (4420), 13 states have internal predecessors, (4420), 0 states have call successors, (0), 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 17:58:40,136 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 101 flow. Second operand 12 states and 1885 transitions. [2023-08-30 17:58:40,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 199 flow [2023-08-30 17:58:40,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 36 transitions, 185 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 17:58:40,138 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 171 flow [2023-08-30 17:58:40,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=171, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2023-08-30 17:58:40,139 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2023-08-30 17:58:40,139 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 171 flow [2023-08-30 17:58:40,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 155.30769230769232) internal successors, (2019), 13 states have internal predecessors, (2019), 0 states have call successors, (0), 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 17:58:40,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:58:40,140 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-30 17:58:40,148 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 17:58:40,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:58:40,347 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 17:58:40,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:58:40,347 INFO L85 PathProgramCache]: Analyzing trace with hash -834996966, now seen corresponding path program 3 times [2023-08-30 17:58:40,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:58:40,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528361855] [2023-08-30 17:58:40,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:58:40,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:58:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 17:58:40,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 17:58:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 17:58:40,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 17:58:40,414 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 17:58:40,414 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-30 17:58:40,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 17:58:40,414 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-30 17:58:40,415 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-30 17:58:40,416 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 17:58:40,416 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-30 17:58:40,455 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-30 17:58:40,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-08-30 17:58:40,493 INFO L130 PetriNetUnfolder]: 75/424 cut-off events. [2023-08-30 17:58:40,494 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-30 17:58:40,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 75/424 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1687 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 262. Up to 12 conditions per place. [2023-08-30 17:58:40,497 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 260 transitions, 538 flow [2023-08-30 17:58:40,500 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 260 transitions, 538 flow [2023-08-30 17:58:40,500 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 17:58:40,500 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 260 transitions, 538 flow [2023-08-30 17:58:40,501 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 260 transitions, 538 flow [2023-08-30 17:58:40,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-08-30 17:58:40,532 INFO L130 PetriNetUnfolder]: 75/424 cut-off events. [2023-08-30 17:58:40,533 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-30 17:58:40,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 75/424 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1687 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 262. Up to 12 conditions per place. [2023-08-30 17:58:40,552 INFO L119 LiptonReduction]: Number of co-enabled transitions 31416 [2023-08-30 17:58:43,337 INFO L134 LiptonReduction]: Checked pairs total: 49651 [2023-08-30 17:58:43,338 INFO L136 LiptonReduction]: Total number of compositions: 216 [2023-08-30 17:58:43,342 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 17:58:43,344 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;@374301eb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 17:58:43,345 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-30 17:58:43,347 INFO L130 PetriNetUnfolder]: 8/28 cut-off events. [2023-08-30 17:58:43,348 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:58:43,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:58:43,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 17:58:43,350 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 17:58:43,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:58:43,350 INFO L85 PathProgramCache]: Analyzing trace with hash -200231614, now seen corresponding path program 1 times [2023-08-30 17:58:43,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:58:43,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580068194] [2023-08-30 17:58:43,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:58:43,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:58:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:58:43,370 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 17:58:43,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:58:43,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580068194] [2023-08-30 17:58:43,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580068194] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 17:58:43,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 17:58:43,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 17:58:43,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246313483] [2023-08-30 17:58:43,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 17:58:43,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 17:58:43,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:58:43,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 17:58:43,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 17:58:43,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 476 [2023-08-30 17:58:43,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 101 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 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 17:58:43,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:58:43,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 476 [2023-08-30 17:58:43,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:58:44,550 INFO L130 PetriNetUnfolder]: 9872/15757 cut-off events. [2023-08-30 17:58:44,551 INFO L131 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2023-08-30 17:58:44,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30205 conditions, 15757 events. 9872/15757 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 104375 event pairs, 9112 based on Foata normal form. 2730/16056 useless extension candidates. Maximal degree in co-relation 12164. Up to 14349 conditions per place. [2023-08-30 17:58:44,624 INFO L137 encePairwiseOnDemand]: 441/476 looper letters, 55 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-30 17:58:44,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 272 flow [2023-08-30 17:58:44,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 17:58:44,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 17:58:44,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2023-08-30 17:58:44,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042016806722689 [2023-08-30 17:58:44,627 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 720 transitions. [2023-08-30 17:58:44,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 720 transitions. [2023-08-30 17:58:44,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:58:44,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 720 transitions. [2023-08-30 17:58:44,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 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 17:58:44,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 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 17:58:44,632 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 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 17:58:44,632 INFO L175 Difference]: Start difference. First operand has 68 places, 101 transitions, 220 flow. Second operand 3 states and 720 transitions. [2023-08-30 17:58:44,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 272 flow [2023-08-30 17:58:44,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 17:58:44,635 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 168 flow [2023-08-30 17:58:44,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2023-08-30 17:58:44,636 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-30 17:58:44,636 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 168 flow [2023-08-30 17:58:44,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 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 17:58:44,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:58:44,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:58:44,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 17:58:44,637 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 17:58:44,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:58:44,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1798379354, now seen corresponding path program 1 times [2023-08-30 17:58:44,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:58:44,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190979082] [2023-08-30 17:58:44,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:58:44,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:58:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:58:44,668 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 17:58:44,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:58:44,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190979082] [2023-08-30 17:58:44,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190979082] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:58:44,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572094124] [2023-08-30 17:58:44,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:58:44,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:58:44,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:58:44,673 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 17:58:44,700 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 17:58:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:58:44,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-30 17:58:44,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:58:44,777 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 17:58:44,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 17:58:44,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572094124] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 17:58:44,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 17:58:44,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-30 17:58:44,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98553609] [2023-08-30 17:58:44,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 17:58:44,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 17:58:44,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:58:44,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 17:58:44,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 17:58:44,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 476 [2023-08-30 17:58:44,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 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 17:58:44,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:58:44,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 476 [2023-08-30 17:58:44,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:58:45,892 INFO L130 PetriNetUnfolder]: 9675/15570 cut-off events. [2023-08-30 17:58:45,892 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2023-08-30 17:58:45,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30030 conditions, 15570 events. 9675/15570 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 105458 event pairs, 4312 based on Foata normal form. 0/13126 useless extension candidates. Maximal degree in co-relation 30017. Up to 14317 conditions per place. [2023-08-30 17:58:45,977 INFO L137 encePairwiseOnDemand]: 473/476 looper letters, 72 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-08-30 17:58:45,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 87 transitions, 350 flow [2023-08-30 17:58:45,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 17:58:45,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 17:58:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2023-08-30 17:58:45,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49299719887955185 [2023-08-30 17:58:45,981 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 704 transitions. [2023-08-30 17:58:45,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 704 transitions. [2023-08-30 17:58:45,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:58:45,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 704 transitions. [2023-08-30 17:58:45,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 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 17:58:45,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 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 17:58:45,986 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 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 17:58:45,986 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 168 flow. Second operand 3 states and 704 transitions. [2023-08-30 17:58:45,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 87 transitions, 350 flow [2023-08-30 17:58:45,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 87 transitions, 346 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 17:58:45,991 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 176 flow [2023-08-30 17:58:45,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2023-08-30 17:58:45,993 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-08-30 17:58:45,993 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 176 flow [2023-08-30 17:58:45,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 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 17:58:45,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:58:45,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:58:46,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-30 17:58:46,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:58:46,204 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 17:58:46,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:58:46,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1146753669, now seen corresponding path program 1 times [2023-08-30 17:58:46,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:58:46,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133723546] [2023-08-30 17:58:46,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:58:46,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:58:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:58:46,248 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 17:58:46,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:58:46,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133723546] [2023-08-30 17:58:46,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133723546] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:58:46,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529502892] [2023-08-30 17:58:46,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:58:46,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:58:46,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:58:46,250 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 17:58:46,253 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 17:58:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:58:46,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 17:58:46,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:58:46,343 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 17:58:46,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:58:46,357 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 17:58:46,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529502892] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:58:46,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:58:46,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 17:58:46,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783145722] [2023-08-30 17:58:46,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:58:46,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 17:58:46,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:58:46,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 17:58:46,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 17:58:46,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 476 [2023-08-30 17:58:46,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 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 17:58:46,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:58:46,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 476 [2023-08-30 17:58:46,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:58:47,416 INFO L130 PetriNetUnfolder]: 9912/15619 cut-off events. [2023-08-30 17:58:47,416 INFO L131 PetriNetUnfolder]: For 612/612 co-relation queries the response was YES. [2023-08-30 17:58:47,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30593 conditions, 15619 events. 9912/15619 cut-off events. For 612/612 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 101714 event pairs, 9112 based on Foata normal form. 3/13422 useless extension candidates. Maximal degree in co-relation 30565. Up to 14334 conditions per place. [2023-08-30 17:58:47,474 INFO L137 encePairwiseOnDemand]: 473/476 looper letters, 56 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-08-30 17:58:47,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 310 flow [2023-08-30 17:58:47,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 17:58:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 17:58:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1317 transitions. [2023-08-30 17:58:47,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46113445378151263 [2023-08-30 17:58:47,478 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1317 transitions. [2023-08-30 17:58:47,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1317 transitions. [2023-08-30 17:58:47,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:58:47,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1317 transitions. [2023-08-30 17:58:47,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 219.5) internal successors, (1317), 6 states have internal predecessors, (1317), 0 states have call successors, (0), 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 17:58:47,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 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 17:58:47,486 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 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 17:58:47,486 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 176 flow. Second operand 6 states and 1317 transitions. [2023-08-30 17:58:47,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 310 flow [2023-08-30 17:58:47,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 74 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 17:58:47,489 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 210 flow [2023-08-30 17:58:47,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2023-08-30 17:58:47,489 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2023-08-30 17:58:47,489 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 210 flow [2023-08-30 17:58:47,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 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 17:58:47,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:58:47,490 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:58:47,498 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 17:58:47,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-30 17:58:47,698 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 17:58:47,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:58:47,698 INFO L85 PathProgramCache]: Analyzing trace with hash -737928083, now seen corresponding path program 2 times [2023-08-30 17:58:47,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:58:47,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187491432] [2023-08-30 17:58:47,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:58:47,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:58:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:58:47,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 17:58:47,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:58:47,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187491432] [2023-08-30 17:58:47,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187491432] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:58:47,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358653083] [2023-08-30 17:58:47,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 17:58:47,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:58:47,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:58:47,772 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 17:58:47,795 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 17:58:47,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 17:58:47,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 17:58:47,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-30 17:58:47,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:58:47,867 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 7 treesize of output 6 [2023-08-30 17:58:47,905 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 17:58:47,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 17:58:47,928 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 13 treesize of output 15 [2023-08-30 17:58:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-30 17:58:47,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 17:58:47,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358653083] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 17:58:47,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 17:58:47,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-30 17:58:47,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130086312] [2023-08-30 17:58:47,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 17:58:47,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 17:58:47,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:58:47,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 17:58:47,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-30 17:58:48,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 476 [2023-08-30 17:58:48,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 201.5) internal successors, (1209), 6 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 17:58:48,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:58:48,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 476 [2023-08-30 17:58:48,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:58:49,293 INFO L130 PetriNetUnfolder]: 10227/16630 cut-off events. [2023-08-30 17:58:49,294 INFO L131 PetriNetUnfolder]: For 598/598 co-relation queries the response was YES. [2023-08-30 17:58:49,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32704 conditions, 16630 events. 10227/16630 cut-off events. For 598/598 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 116535 event pairs, 2011 based on Foata normal form. 0/14547 useless extension candidates. Maximal degree in co-relation 32668. Up to 11903 conditions per place. [2023-08-30 17:58:49,373 INFO L137 encePairwiseOnDemand]: 467/476 looper letters, 131 selfloop transitions, 14 changer transitions 9/167 dead transitions. [2023-08-30 17:58:49,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 167 transitions, 735 flow [2023-08-30 17:58:49,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 17:58:49,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 17:58:49,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1351 transitions. [2023-08-30 17:58:49,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4730392156862745 [2023-08-30 17:58:49,377 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1351 transitions. [2023-08-30 17:58:49,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1351 transitions. [2023-08-30 17:58:49,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:58:49,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1351 transitions. [2023-08-30 17:58:49,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 0 states have call successors, (0), 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 17:58:49,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 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 17:58:49,386 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 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 17:58:49,386 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 210 flow. Second operand 6 states and 1351 transitions. [2023-08-30 17:58:49,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 167 transitions, 735 flow [2023-08-30 17:58:49,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 167 transitions, 721 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 17:58:49,390 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 280 flow [2023-08-30 17:58:49,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=280, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2023-08-30 17:58:49,391 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 19 predicate places. [2023-08-30 17:58:49,391 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 280 flow [2023-08-30 17:58:49,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 201.5) internal successors, (1209), 6 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 17:58:49,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:58:49,392 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:58:49,399 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 17:58:49,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-30 17:58:49,598 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 17:58:49,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:58:49,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1645103301, now seen corresponding path program 1 times [2023-08-30 17:58:49,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:58:49,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371206503] [2023-08-30 17:58:49,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:58:49,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:58:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:58:49,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 17:58:49,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:58:49,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371206503] [2023-08-30 17:58:49,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371206503] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:58:49,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603735030] [2023-08-30 17:58:49,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:58:49,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:58:49,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:58:49,676 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 17:58:49,684 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 17:58:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:58:49,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 17:58:49,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:58:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 17:58:49,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:58:49,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 17:58:49,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603735030] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:58:49,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:58:49,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-30 17:58:49,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31824893] [2023-08-30 17:58:49,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:58:49,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 17:58:49,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:58:49,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 17:58:49,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-30 17:58:49,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 476 [2023-08-30 17:58:49,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 280 flow. Second operand has 13 states, 13 states have (on average 210.69230769230768) internal successors, (2739), 13 states have internal predecessors, (2739), 0 states have call successors, (0), 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 17:58:49,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:58:49,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 476 [2023-08-30 17:58:49,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:58:51,188 INFO L130 PetriNetUnfolder]: 10225/16589 cut-off events. [2023-08-30 17:58:51,189 INFO L131 PetriNetUnfolder]: For 3432/3437 co-relation queries the response was YES. [2023-08-30 17:58:51,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35719 conditions, 16589 events. 10225/16589 cut-off events. For 3432/3437 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 114470 event pairs, 9000 based on Foata normal form. 6/15204 useless extension candidates. Maximal degree in co-relation 35661. Up to 15411 conditions per place. [2023-08-30 17:58:51,256 INFO L137 encePairwiseOnDemand]: 473/476 looper letters, 68 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2023-08-30 17:58:51,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 92 transitions, 474 flow [2023-08-30 17:58:51,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 17:58:51,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 17:58:51,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2580 transitions. [2023-08-30 17:58:51,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45168067226890757 [2023-08-30 17:58:51,263 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2580 transitions. [2023-08-30 17:58:51,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2580 transitions. [2023-08-30 17:58:51,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:58:51,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2580 transitions. [2023-08-30 17:58:51,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 215.0) internal successors, (2580), 12 states have internal predecessors, (2580), 0 states have call successors, (0), 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 17:58:51,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 476.0) internal successors, (6188), 13 states have internal predecessors, (6188), 0 states have call successors, (0), 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 17:58:51,275 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 476.0) internal successors, (6188), 13 states have internal predecessors, (6188), 0 states have call successors, (0), 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 17:58:51,275 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 280 flow. Second operand 12 states and 2580 transitions. [2023-08-30 17:58:51,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 92 transitions, 474 flow [2023-08-30 17:58:51,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 474 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 17:58:51,284 INFO L231 Difference]: Finished difference. Result has 104 places, 92 transitions, 364 flow [2023-08-30 17:58:51,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=364, PETRI_PLACES=104, PETRI_TRANSITIONS=92} [2023-08-30 17:58:51,285 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 36 predicate places. [2023-08-30 17:58:51,285 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 92 transitions, 364 flow [2023-08-30 17:58:51,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 210.69230769230768) internal successors, (2739), 13 states have internal predecessors, (2739), 0 states have call successors, (0), 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 17:58:51,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:58:51,286 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:58:51,293 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 17:58:51,491 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,SelfDestructingSolverStorable13 [2023-08-30 17:58:51,492 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 17:58:51,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:58:51,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1249743301, now seen corresponding path program 2 times [2023-08-30 17:58:51,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:58:51,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837780042] [2023-08-30 17:58:51,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:58:51,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:58:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:58:52,252 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 17:58:52,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:58:52,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837780042] [2023-08-30 17:58:52,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837780042] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:58:52,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741270836] [2023-08-30 17:58:52,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 17:58:52,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:58:52,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:58:52,255 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 17:58:52,257 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 17:58:52,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 17:58:52,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 17:58:52,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-30 17:58:52,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:58:52,371 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 7 treesize of output 6 [2023-08-30 17:58:52,438 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 17:58:52,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 17:58:52,455 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 13 treesize of output 15 [2023-08-30 17:58:52,479 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 13 treesize of output 15 [2023-08-30 17:58:52,519 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 17:58:52,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:58:58,590 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_397 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_397) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 17:58:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-30 17:58:58,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741270836] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:58:58,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:58:58,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2023-08-30 17:58:58,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143771397] [2023-08-30 17:58:58,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:58:58,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-30 17:58:58,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:58:58,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-30 17:58:58,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=132, Unknown=2, NotChecked=24, Total=210 [2023-08-30 17:58:58,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 476 [2023-08-30 17:58:58,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 92 transitions, 364 flow. Second operand has 15 states, 15 states have (on average 150.4) internal successors, (2256), 15 states have internal predecessors, (2256), 0 states have call successors, (0), 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 17:58:58,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:58:58,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 476 [2023-08-30 17:58:58,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:59:16,779 WARN L222 SmtUtils]: Spent 18.03s on a formula simplification. DAG size of input: 31 DAG size of output: 22 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 17:59:18,794 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 17:59:20,801 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 17:59:22,804 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 17:59:24,809 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 17:59:26,852 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 17:59:28,859 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 17:59:30,873 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 17:59:32,862 INFO L130 PetriNetUnfolder]: 13779/21926 cut-off events. [2023-08-30 17:59:32,863 INFO L131 PetriNetUnfolder]: For 4318/4318 co-relation queries the response was YES. [2023-08-30 17:59:32,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47523 conditions, 21926 events. 13779/21926 cut-off events. For 4318/4318 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 151704 event pairs, 2524 based on Foata normal form. 0/20511 useless extension candidates. Maximal degree in co-relation 47440. Up to 14693 conditions per place. [2023-08-30 17:59:32,938 INFO L137 encePairwiseOnDemand]: 461/476 looper letters, 166 selfloop transitions, 26 changer transitions 26/227 dead transitions. [2023-08-30 17:59:32,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 227 transitions, 1159 flow [2023-08-30 17:59:32,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 17:59:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 17:59:32,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1386 transitions. [2023-08-30 17:59:32,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3639705882352941 [2023-08-30 17:59:32,942 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1386 transitions. [2023-08-30 17:59:32,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1386 transitions. [2023-08-30 17:59:32,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:59:32,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1386 transitions. [2023-08-30 17:59:32,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 173.25) internal successors, (1386), 8 states have internal predecessors, (1386), 0 states have call successors, (0), 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 17:59:32,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 476.0) internal successors, (4284), 9 states have internal predecessors, (4284), 0 states have call successors, (0), 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 17:59:32,950 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 476.0) internal successors, (4284), 9 states have internal predecessors, (4284), 0 states have call successors, (0), 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 17:59:32,951 INFO L175 Difference]: Start difference. First operand has 104 places, 92 transitions, 364 flow. Second operand 8 states and 1386 transitions. [2023-08-30 17:59:32,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 227 transitions, 1159 flow [2023-08-30 17:59:32,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 227 transitions, 1111 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-30 17:59:32,963 INFO L231 Difference]: Finished difference. Result has 111 places, 106 transitions, 487 flow [2023-08-30 17:59:32,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=487, PETRI_PLACES=111, PETRI_TRANSITIONS=106} [2023-08-30 17:59:32,964 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 43 predicate places. [2023-08-30 17:59:32,964 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 487 flow [2023-08-30 17:59:32,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 150.4) internal successors, (2256), 15 states have internal predecessors, (2256), 0 states have call successors, (0), 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 17:59:32,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:59:32,965 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:59:32,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-08-30 17:59:33,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-30 17:59:33,171 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 17:59:33,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:59:33,171 INFO L85 PathProgramCache]: Analyzing trace with hash -753113228, now seen corresponding path program 1 times [2023-08-30 17:59:33,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:59:33,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554630615] [2023-08-30 17:59:33,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:33,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:59:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 17:59:33,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:59:33,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554630615] [2023-08-30 17:59:33,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554630615] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:59:33,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307438454] [2023-08-30 17:59:33,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:33,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:59:33,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:59:33,249 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 17:59:33,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-30 17:59:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:33,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 17:59:33,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:59:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 17:59:33,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:59:33,394 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 17:59:33,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307438454] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:59:33,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:59:33,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-30 17:59:33,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624141881] [2023-08-30 17:59:33,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:59:33,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 17:59:33,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:59:33,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 17:59:33,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 17:59:33,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 476 [2023-08-30 17:59:33,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 106 transitions, 487 flow. Second operand has 7 states, 7 states have (on average 212.85714285714286) internal successors, (1490), 7 states have internal predecessors, (1490), 0 states have call successors, (0), 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 17:59:33,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:59:33,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 476 [2023-08-30 17:59:33,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:59:33,707 INFO L130 PetriNetUnfolder]: 1230/2381 cut-off events. [2023-08-30 17:59:33,707 INFO L131 PetriNetUnfolder]: For 1526/1526 co-relation queries the response was YES. [2023-08-30 17:59:33,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6229 conditions, 2381 events. 1230/2381 cut-off events. For 1526/1526 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 14977 event pairs, 94 based on Foata normal form. 277/2560 useless extension candidates. Maximal degree in co-relation 6164. Up to 1472 conditions per place. [2023-08-30 17:59:33,719 INFO L137 encePairwiseOnDemand]: 473/476 looper letters, 89 selfloop transitions, 3 changer transitions 18/119 dead transitions. [2023-08-30 17:59:33,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 119 transitions, 703 flow [2023-08-30 17:59:33,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 17:59:33,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 17:59:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1129 transitions. [2023-08-30 17:59:33,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47436974789915964 [2023-08-30 17:59:33,723 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1129 transitions. [2023-08-30 17:59:33,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1129 transitions. [2023-08-30 17:59:33,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:59:33,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1129 transitions. [2023-08-30 17:59:33,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 225.8) internal successors, (1129), 5 states have internal predecessors, (1129), 0 states have call successors, (0), 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 17:59:33,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 476.0) internal successors, (2856), 6 states have internal predecessors, (2856), 0 states have call successors, (0), 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 17:59:33,730 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 476.0) internal successors, (2856), 6 states have internal predecessors, (2856), 0 states have call successors, (0), 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 17:59:33,730 INFO L175 Difference]: Start difference. First operand has 111 places, 106 transitions, 487 flow. Second operand 5 states and 1129 transitions. [2023-08-30 17:59:33,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 119 transitions, 703 flow [2023-08-30 17:59:33,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 119 transitions, 682 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-30 17:59:33,737 INFO L231 Difference]: Finished difference. Result has 87 places, 58 transitions, 252 flow [2023-08-30 17:59:33,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=252, PETRI_PLACES=87, PETRI_TRANSITIONS=58} [2023-08-30 17:59:33,738 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 19 predicate places. [2023-08-30 17:59:33,738 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 58 transitions, 252 flow [2023-08-30 17:59:33,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.85714285714286) internal successors, (1490), 7 states have internal predecessors, (1490), 0 states have call successors, (0), 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 17:59:33,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:59:33,739 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:59:33,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-30 17:59:33,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-30 17:59:33,945 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 17:59:33,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:59:33,948 INFO L85 PathProgramCache]: Analyzing trace with hash 636168720, now seen corresponding path program 1 times [2023-08-30 17:59:33,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:59:33,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720894280] [2023-08-30 17:59:33,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:33,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:59:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 17:59:34,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:59:34,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720894280] [2023-08-30 17:59:34,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720894280] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 17:59:34,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 17:59:34,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 17:59:34,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339386721] [2023-08-30 17:59:34,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 17:59:34,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 17:59:34,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:59:34,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 17:59:34,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 17:59:34,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 476 [2023-08-30 17:59:34,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 58 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 194.4) internal successors, (972), 5 states have internal predecessors, (972), 0 states have call successors, (0), 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 17:59:34,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:59:34,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 476 [2023-08-30 17:59:34,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:59:34,469 INFO L130 PetriNetUnfolder]: 513/1008 cut-off events. [2023-08-30 17:59:34,469 INFO L131 PetriNetUnfolder]: For 1028/1028 co-relation queries the response was YES. [2023-08-30 17:59:34,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2754 conditions, 1008 events. 513/1008 cut-off events. For 1028/1028 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5121 event pairs, 163 based on Foata normal form. 108/1028 useless extension candidates. Maximal degree in co-relation 2693. Up to 568 conditions per place. [2023-08-30 17:59:34,473 INFO L137 encePairwiseOnDemand]: 463/476 looper letters, 53 selfloop transitions, 13 changer transitions 4/76 dead transitions. [2023-08-30 17:59:34,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 76 transitions, 461 flow [2023-08-30 17:59:34,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 17:59:34,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 17:59:34,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 820 transitions. [2023-08-30 17:59:34,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43067226890756305 [2023-08-30 17:59:34,477 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 820 transitions. [2023-08-30 17:59:34,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 820 transitions. [2023-08-30 17:59:34,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:59:34,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 820 transitions. [2023-08-30 17:59:34,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 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 17:59:34,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 476.0) internal successors, (2380), 5 states have internal predecessors, (2380), 0 states have call successors, (0), 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 17:59:34,483 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 476.0) internal successors, (2380), 5 states have internal predecessors, (2380), 0 states have call successors, (0), 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 17:59:34,483 INFO L175 Difference]: Start difference. First operand has 87 places, 58 transitions, 252 flow. Second operand 4 states and 820 transitions. [2023-08-30 17:59:34,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 76 transitions, 461 flow [2023-08-30 17:59:34,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 76 transitions, 445 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 17:59:34,486 INFO L231 Difference]: Finished difference. Result has 84 places, 60 transitions, 286 flow [2023-08-30 17:59:34,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=286, PETRI_PLACES=84, PETRI_TRANSITIONS=60} [2023-08-30 17:59:34,487 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 16 predicate places. [2023-08-30 17:59:34,487 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 60 transitions, 286 flow [2023-08-30 17:59:34,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 194.4) internal successors, (972), 5 states have internal predecessors, (972), 0 states have call successors, (0), 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 17:59:34,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:59:34,488 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:59:34,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 17:59:34,488 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 17:59:34,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:59:34,489 INFO L85 PathProgramCache]: Analyzing trace with hash 603317954, now seen corresponding path program 1 times [2023-08-30 17:59:34,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:59:34,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131368963] [2023-08-30 17:59:34,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:34,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:59:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 17:59:38,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:59:38,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131368963] [2023-08-30 17:59:38,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131368963] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:59:38,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457519138] [2023-08-30 17:59:38,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:38,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:59:38,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:59:38,561 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 17:59:38,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-30 17:59:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:38,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-30 17:59:38,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:59:38,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 17:59:38,782 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 17:59:38,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 17:59:38,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 13 treesize of output 15 [2023-08-30 17:59:38,843 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 13 treesize of output 15 [2023-08-30 17:59:38,871 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 13 treesize of output 9 [2023-08-30 17:59:38,941 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 17:59:38,942 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 19 treesize of output 11 [2023-08-30 17:59:39,005 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 18 treesize of output 13 [2023-08-30 17:59:39,061 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 17:59:39,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:59:39,190 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 13 [2023-08-30 17:59:39,201 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 12 treesize of output 8 [2023-08-30 17:59:49,274 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_65| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_61| Int) (v_ArrVal_585 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_61| |v_t_funThread2of2ForFork0_~p~0#1.offset_65|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_585) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_61| v_ArrVal_588) |v_t_funThread2of2ForFork0_~p~0#1.offset_65|) 0))) is different from false [2023-08-30 17:59:49,457 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-30 17:59:49,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457519138] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:59:49,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:59:49,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 28 [2023-08-30 17:59:49,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505388234] [2023-08-30 17:59:49,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:59:49,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 17:59:49,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:59:49,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 17:59:49,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=662, Unknown=4, NotChecked=54, Total=870 [2023-08-30 17:59:49,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 476 [2023-08-30 17:59:49,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 60 transitions, 286 flow. Second operand has 30 states, 30 states have (on average 148.06666666666666) internal successors, (4442), 30 states have internal predecessors, (4442), 0 states have call successors, (0), 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 17:59:49,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:59:49,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 476 [2023-08-30 17:59:49,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:59:52,756 INFO L130 PetriNetUnfolder]: 852/1699 cut-off events. [2023-08-30 17:59:52,756 INFO L131 PetriNetUnfolder]: For 1303/1309 co-relation queries the response was YES. [2023-08-30 17:59:52,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4771 conditions, 1699 events. 852/1699 cut-off events. For 1303/1309 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 10243 event pairs, 93 based on Foata normal form. 24/1549 useless extension candidates. Maximal degree in co-relation 4710. Up to 697 conditions per place. [2023-08-30 17:59:52,761 INFO L137 encePairwiseOnDemand]: 464/476 looper letters, 94 selfloop transitions, 35 changer transitions 24/159 dead transitions. [2023-08-30 17:59:52,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 159 transitions, 967 flow [2023-08-30 17:59:52,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-30 17:59:52,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-30 17:59:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3799 transitions. [2023-08-30 17:59:52,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3192436974789916 [2023-08-30 17:59:52,765 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3799 transitions. [2023-08-30 17:59:52,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3799 transitions. [2023-08-30 17:59:52,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:59:52,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3799 transitions. [2023-08-30 17:59:52,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 151.96) internal successors, (3799), 25 states have internal predecessors, (3799), 0 states have call successors, (0), 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 17:59:52,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 476.0) internal successors, (12376), 26 states have internal predecessors, (12376), 0 states have call successors, (0), 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 17:59:52,784 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 476.0) internal successors, (12376), 26 states have internal predecessors, (12376), 0 states have call successors, (0), 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 17:59:52,784 INFO L175 Difference]: Start difference. First operand has 84 places, 60 transitions, 286 flow. Second operand 25 states and 3799 transitions. [2023-08-30 17:59:52,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 159 transitions, 967 flow [2023-08-30 17:59:52,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 159 transitions, 966 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 17:59:52,790 INFO L231 Difference]: Finished difference. Result has 113 places, 75 transitions, 472 flow [2023-08-30 17:59:52,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=472, PETRI_PLACES=113, PETRI_TRANSITIONS=75} [2023-08-30 17:59:52,791 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 45 predicate places. [2023-08-30 17:59:52,791 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 75 transitions, 472 flow [2023-08-30 17:59:52,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 148.06666666666666) internal successors, (4442), 30 states have internal predecessors, (4442), 0 states have call successors, (0), 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 17:59:52,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:59:52,792 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:59:52,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-30 17:59:52,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-30 17:59:52,998 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 17:59:52,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:59:52,999 INFO L85 PathProgramCache]: Analyzing trace with hash 191055260, now seen corresponding path program 2 times [2023-08-30 17:59:52,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:59:52,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894794955] [2023-08-30 17:59:52,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:52,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:59:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:53,514 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 17:59:53,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:59:53,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894794955] [2023-08-30 17:59:53,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894794955] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:59:53,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694213769] [2023-08-30 17:59:53,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 17:59:53,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:59:53,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:59:53,517 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 17:59:53,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-30 17:59:53,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 17:59:53,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 17:59:53,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-30 17:59:53,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:59:53,648 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 7 treesize of output 6 [2023-08-30 17:59:53,742 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 17:59:53,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 17:59:53,765 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 13 treesize of output 15 [2023-08-30 17:59:53,794 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 13 treesize of output 15 [2023-08-30 17:59:53,814 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 13 treesize of output 9 [2023-08-30 17:59:53,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 17:59:53,865 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 17:59:53,896 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 18 treesize of output 13 [2023-08-30 17:59:53,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 17:59:53,928 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 17:59:53,961 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 17:59:53,961 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 19 treesize of output 11 [2023-08-30 17:59:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 17:59:53,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:59:54,027 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_67| Int) (v_ArrVal_676 (Array Int Int))) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_67|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_676) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_67|)) 0)))) is different from false [2023-08-30 17:59:54,036 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_67| Int) (v_ArrVal_676 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_674)) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_67|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_676) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_67|)) 0)))) is different from false [2023-08-30 17:59:54,078 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 17:59:54,079 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 23 treesize of output 24 [2023-08-30 17:59:54,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 17:59:54,086 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 39 treesize of output 35 [2023-08-30 17:59:54,091 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 18 [2023-08-30 18:00:08,174 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_674 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_67| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_63| Int) (v_ArrVal_670 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_670) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_63| v_ArrVal_674) |v_t_funThread2of2ForFork0_~p~0#1.offset_67|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_63| |v_t_funThread2of2ForFork0_~p~0#1.offset_67|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-30 18:00:10,377 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-30 18:00:10,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694213769] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:00:10,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:00:10,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-08-30 18:00:10,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301734582] [2023-08-30 18:00:10,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:00:10,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-30 18:00:10,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:00:10,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-30 18:00:10,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=250, Unknown=6, NotChecked=108, Total=462 [2023-08-30 18:00:10,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 476 [2023-08-30 18:00:10,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 75 transitions, 472 flow. Second operand has 22 states, 22 states have (on average 153.3181818181818) internal successors, (3373), 22 states have internal predecessors, (3373), 0 states have call successors, (0), 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 18:00:10,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:00:10,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 476 [2023-08-30 18:00:10,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00:11,058 INFO L130 PetriNetUnfolder]: 956/1907 cut-off events. [2023-08-30 18:00:11,059 INFO L131 PetriNetUnfolder]: For 7213/7219 co-relation queries the response was YES. [2023-08-30 18:00:11,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6967 conditions, 1907 events. 956/1907 cut-off events. For 7213/7219 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11968 event pairs, 92 based on Foata normal form. 3/1718 useless extension candidates. Maximal degree in co-relation 6889. Up to 911 conditions per place. [2023-08-30 18:00:11,067 INFO L137 encePairwiseOnDemand]: 467/476 looper letters, 84 selfloop transitions, 25 changer transitions 16/131 dead transitions. [2023-08-30 18:00:11,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 131 transitions, 1017 flow [2023-08-30 18:00:11,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 18:00:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 18:00:11,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1456 transitions. [2023-08-30 18:00:11,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33986928104575165 [2023-08-30 18:00:11,069 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1456 transitions. [2023-08-30 18:00:11,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1456 transitions. [2023-08-30 18:00:11,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:11,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1456 transitions. [2023-08-30 18:00:11,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 161.77777777777777) internal successors, (1456), 9 states have internal predecessors, (1456), 0 states have call successors, (0), 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 18:00:11,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 476.0) internal successors, (4760), 10 states have internal predecessors, (4760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:11,075 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 476.0) internal successors, (4760), 10 states have internal predecessors, (4760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:11,076 INFO L175 Difference]: Start difference. First operand has 113 places, 75 transitions, 472 flow. Second operand 9 states and 1456 transitions. [2023-08-30 18:00:11,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 131 transitions, 1017 flow [2023-08-30 18:00:11,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 131 transitions, 915 flow, removed 18 selfloop flow, removed 24 redundant places. [2023-08-30 18:00:11,087 INFO L231 Difference]: Finished difference. Result has 99 places, 81 transitions, 506 flow [2023-08-30 18:00:11,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=506, PETRI_PLACES=99, PETRI_TRANSITIONS=81} [2023-08-30 18:00:11,088 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 31 predicate places. [2023-08-30 18:00:11,088 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 81 transitions, 506 flow [2023-08-30 18:00:11,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 153.3181818181818) internal successors, (3373), 22 states have internal predecessors, (3373), 0 states have call successors, (0), 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 18:00:11,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:11,089 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:00:11,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-30 18:00:11,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:11,295 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 18:00:11,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:11,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1245507454, now seen corresponding path program 1 times [2023-08-30 18:00:11,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:11,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652949066] [2023-08-30 18:00:11,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:11,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:11,559 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:00:11,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:11,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652949066] [2023-08-30 18:00:11,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652949066] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:00:11,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343842179] [2023-08-30 18:00:11,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:11,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:11,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:00:11,561 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 18:00:11,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-30 18:00:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:11,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-30 18:00:11,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:00:11,704 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 7 treesize of output 6 [2023-08-30 18:00:11,760 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:00:11,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 18:00:11,779 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 13 treesize of output 15 [2023-08-30 18:00:11,802 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 13 treesize of output 15 [2023-08-30 18:00:11,821 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 13 treesize of output 9 [2023-08-30 18:00:11,871 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:00:11,871 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 19 treesize of output 11 [2023-08-30 18:00:11,923 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 18 treesize of output 13 [2023-08-30 18:00:11,956 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:00:11,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:00:12,033 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 13 [2023-08-30 18:00:12,038 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 12 treesize of output 8 [2023-08-30 18:00:12,061 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_757 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_757) |c_~#a~0.base|))) is different from false [2023-08-30 18:00:12,134 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-30 18:00:12,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343842179] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:00:12,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:00:12,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-08-30 18:00:12,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641226053] [2023-08-30 18:00:12,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:00:12,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-30 18:00:12,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:00:12,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-30 18:00:12,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=188, Unknown=1, NotChecked=28, Total=272 [2023-08-30 18:00:12,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 476 [2023-08-30 18:00:12,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 81 transitions, 506 flow. Second operand has 17 states, 17 states have (on average 154.88235294117646) internal successors, (2633), 17 states have internal predecessors, (2633), 0 states have call successors, (0), 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 18:00:12,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:00:12,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 476 [2023-08-30 18:00:12,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00:12,743 INFO L130 PetriNetUnfolder]: 1058/2106 cut-off events. [2023-08-30 18:00:12,743 INFO L131 PetriNetUnfolder]: For 11676/11682 co-relation queries the response was YES. [2023-08-30 18:00:12,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8353 conditions, 2106 events. 1058/2106 cut-off events. For 11676/11682 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13669 event pairs, 162 based on Foata normal form. 12/1907 useless extension candidates. Maximal degree in co-relation 8299. Up to 1287 conditions per place. [2023-08-30 18:00:12,751 INFO L137 encePairwiseOnDemand]: 466/476 looper letters, 98 selfloop transitions, 17 changer transitions 19/140 dead transitions. [2023-08-30 18:00:12,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 140 transitions, 1079 flow [2023-08-30 18:00:12,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 18:00:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 18:00:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1468 transitions. [2023-08-30 18:00:12,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3426704014939309 [2023-08-30 18:00:12,755 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1468 transitions. [2023-08-30 18:00:12,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1468 transitions. [2023-08-30 18:00:12,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:12,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1468 transitions. [2023-08-30 18:00:12,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 163.11111111111111) internal successors, (1468), 9 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 18:00:12,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 476.0) internal successors, (4760), 10 states have internal predecessors, (4760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:12,760 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 476.0) internal successors, (4760), 10 states have internal predecessors, (4760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:12,760 INFO L175 Difference]: Start difference. First operand has 99 places, 81 transitions, 506 flow. Second operand 9 states and 1468 transitions. [2023-08-30 18:00:12,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 140 transitions, 1079 flow [2023-08-30 18:00:12,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 140 transitions, 1036 flow, removed 12 selfloop flow, removed 5 redundant places. [2023-08-30 18:00:12,775 INFO L231 Difference]: Finished difference. Result has 105 places, 86 transitions, 586 flow [2023-08-30 18:00:12,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=586, PETRI_PLACES=105, PETRI_TRANSITIONS=86} [2023-08-30 18:00:12,775 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 37 predicate places. [2023-08-30 18:00:12,775 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 86 transitions, 586 flow [2023-08-30 18:00:12,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 154.88235294117646) internal successors, (2633), 17 states have internal predecessors, (2633), 0 states have call successors, (0), 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 18:00:12,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:12,776 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:00:12,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-30 18:00:12,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:12,982 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 18:00:12,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:12,982 INFO L85 PathProgramCache]: Analyzing trace with hash -567793192, now seen corresponding path program 3 times [2023-08-30 18:00:12,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:12,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562511728] [2023-08-30 18:00:12,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:12,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:00:13,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:13,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562511728] [2023-08-30 18:00:13,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562511728] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:00:13,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164092590] [2023-08-30 18:00:13,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 18:00:13,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:13,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:00:13,348 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 18:00:13,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-30 18:00:13,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 18:00:13,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:00:13,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-30 18:00:13,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:00:13,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 7 treesize of output 6 [2023-08-30 18:00:13,566 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:00:13,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 18:00:13,587 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 13 treesize of output 15 [2023-08-30 18:00:13,611 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 13 treesize of output 15 [2023-08-30 18:00:13,642 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 13 treesize of output 9 [2023-08-30 18:00:13,682 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:00:13,682 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 19 treesize of output 11 [2023-08-30 18:00:13,737 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 18 treesize of output 13 [2023-08-30 18:00:13,779 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:00:13,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:00:13,852 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 13 [2023-08-30 18:00:13,857 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 12 treesize of output 8 [2023-08-30 18:00:13,880 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_842) |c_~#a~0.base|))) is different from false [2023-08-30 18:00:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-30 18:00:13,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164092590] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:00:13,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:00:13,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2023-08-30 18:00:13,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652614] [2023-08-30 18:00:13,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:00:13,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-30 18:00:13,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:00:13,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-30 18:00:13,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=214, Unknown=1, NotChecked=30, Total=306 [2023-08-30 18:00:14,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 476 [2023-08-30 18:00:14,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 86 transitions, 586 flow. Second operand has 18 states, 18 states have (on average 152.66666666666666) internal successors, (2748), 18 states have internal predecessors, (2748), 0 states have call successors, (0), 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 18:00:14,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:00:14,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 476 [2023-08-30 18:00:14,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00:14,874 INFO L130 PetriNetUnfolder]: 1104/2224 cut-off events. [2023-08-30 18:00:14,874 INFO L131 PetriNetUnfolder]: For 17999/18011 co-relation queries the response was YES. [2023-08-30 18:00:14,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9365 conditions, 2224 events. 1104/2224 cut-off events. For 17999/18011 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14764 event pairs, 159 based on Foata normal form. 12/2013 useless extension candidates. Maximal degree in co-relation 9307. Up to 1384 conditions per place. [2023-08-30 18:00:14,885 INFO L137 encePairwiseOnDemand]: 465/476 looper letters, 105 selfloop transitions, 17 changer transitions 20/148 dead transitions. [2023-08-30 18:00:14,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 148 transitions, 1220 flow [2023-08-30 18:00:14,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 18:00:14,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 18:00:14,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1603 transitions. [2023-08-30 18:00:14,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33676470588235297 [2023-08-30 18:00:14,888 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1603 transitions. [2023-08-30 18:00:14,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1603 transitions. [2023-08-30 18:00:14,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:14,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1603 transitions. [2023-08-30 18:00:14,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 160.3) internal successors, (1603), 10 states have internal predecessors, (1603), 0 states have call successors, (0), 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 18:00:14,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 476.0) internal successors, (5236), 11 states have internal predecessors, (5236), 0 states have call successors, (0), 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 18:00:14,897 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 476.0) internal successors, (5236), 11 states have internal predecessors, (5236), 0 states have call successors, (0), 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 18:00:14,897 INFO L175 Difference]: Start difference. First operand has 105 places, 86 transitions, 586 flow. Second operand 10 states and 1603 transitions. [2023-08-30 18:00:14,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 148 transitions, 1220 flow [2023-08-30 18:00:14,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 148 transitions, 1092 flow, removed 51 selfloop flow, removed 5 redundant places. [2023-08-30 18:00:14,930 INFO L231 Difference]: Finished difference. Result has 113 places, 92 transitions, 609 flow [2023-08-30 18:00:14,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=609, PETRI_PLACES=113, PETRI_TRANSITIONS=92} [2023-08-30 18:00:14,931 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 45 predicate places. [2023-08-30 18:00:14,931 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 92 transitions, 609 flow [2023-08-30 18:00:14,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 152.66666666666666) internal successors, (2748), 18 states have internal predecessors, (2748), 0 states have call successors, (0), 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 18:00:14,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:14,931 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:00:14,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-30 18:00:15,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:15,132 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 18:00:15,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:15,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2039347774, now seen corresponding path program 2 times [2023-08-30 18:00:15,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:15,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246212145] [2023-08-30 18:00:15,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:15,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:00:15,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:15,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246212145] [2023-08-30 18:00:15,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246212145] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:00:15,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124145450] [2023-08-30 18:00:15,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 18:00:15,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:15,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:00:15,595 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 18:00:15,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-30 18:00:15,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 18:00:15,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:00:15,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-30 18:00:15,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:00:15,783 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 7 treesize of output 6 [2023-08-30 18:00:15,894 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:00:15,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 18:00:15,919 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 13 treesize of output 15 [2023-08-30 18:00:15,954 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 13 treesize of output 15 [2023-08-30 18:00:15,995 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 13 treesize of output 9 [2023-08-30 18:00:16,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:00:16,054 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 18:00:16,097 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:00:16,098 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 19 treesize of output 11 [2023-08-30 18:00:16,134 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 18 treesize of output 13 [2023-08-30 18:00:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:00:16,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:00:16,251 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_930 (Array Int Int)) (v_ArrVal_932 Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_932)) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_69|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_930) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_69| 4)) 0)))) is different from false [2023-08-30 18:00:16,281 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:00:16,282 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 23 treesize of output 24 [2023-08-30 18:00:16,291 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:00:16,291 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 39 treesize of output 35 [2023-08-30 18:00:16,297 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 18 [2023-08-30 18:00:30,423 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_69| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_73| Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_932 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_927) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_73| v_ArrVal_932) |v_t_funThread1of2ForFork0_~p~0#1.offset_69|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_69| |v_t_funThread2of2ForFork0_~p~0#1.offset_73|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-30 18:00:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-30 18:00:32,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124145450] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:00:32,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:00:32,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-08-30 18:00:32,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133729787] [2023-08-30 18:00:32,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:00:32,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-30 18:00:32,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:00:32,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-30 18:00:32,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=302, Unknown=6, NotChecked=74, Total=462 [2023-08-30 18:00:32,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 476 [2023-08-30 18:00:32,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 92 transitions, 609 flow. Second operand has 22 states, 22 states have (on average 151.3181818181818) internal successors, (3329), 22 states have internal predecessors, (3329), 0 states have call successors, (0), 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 18:00:32,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:00:32,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 476 [2023-08-30 18:00:32,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00:33,936 INFO L130 PetriNetUnfolder]: 1299/2636 cut-off events. [2023-08-30 18:00:33,937 INFO L131 PetriNetUnfolder]: For 15750/15768 co-relation queries the response was YES. [2023-08-30 18:00:33,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10514 conditions, 2636 events. 1299/2636 cut-off events. For 15750/15768 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 18385 event pairs, 193 based on Foata normal form. 24/2398 useless extension candidates. Maximal degree in co-relation 10452. Up to 1579 conditions per place. [2023-08-30 18:00:33,955 INFO L137 encePairwiseOnDemand]: 465/476 looper letters, 128 selfloop transitions, 30 changer transitions 30/194 dead transitions. [2023-08-30 18:00:33,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 194 transitions, 1621 flow [2023-08-30 18:00:33,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-30 18:00:33,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-30 18:00:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2679 transitions. [2023-08-30 18:00:33,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3310677212061295 [2023-08-30 18:00:33,958 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2679 transitions. [2023-08-30 18:00:33,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2679 transitions. [2023-08-30 18:00:33,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:33,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2679 transitions. [2023-08-30 18:00:33,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 157.58823529411765) internal successors, (2679), 17 states have internal predecessors, (2679), 0 states have call successors, (0), 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 18:00:33,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 476.0) internal successors, (8568), 18 states have internal predecessors, (8568), 0 states have call successors, (0), 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 18:00:33,968 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 476.0) internal successors, (8568), 18 states have internal predecessors, (8568), 0 states have call successors, (0), 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 18:00:33,968 INFO L175 Difference]: Start difference. First operand has 113 places, 92 transitions, 609 flow. Second operand 17 states and 2679 transitions. [2023-08-30 18:00:33,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 194 transitions, 1621 flow [2023-08-30 18:00:33,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 194 transitions, 1537 flow, removed 29 selfloop flow, removed 6 redundant places. [2023-08-30 18:00:34,000 INFO L231 Difference]: Finished difference. Result has 127 places, 110 transitions, 890 flow [2023-08-30 18:00:34,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=890, PETRI_PLACES=127, PETRI_TRANSITIONS=110} [2023-08-30 18:00:34,000 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 59 predicate places. [2023-08-30 18:00:34,001 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 110 transitions, 890 flow [2023-08-30 18:00:34,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 151.3181818181818) internal successors, (3329), 22 states have internal predecessors, (3329), 0 states have call successors, (0), 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 18:00:34,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:34,002 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:00:34,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-30 18:00:34,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:34,213 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 18:00:34,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:34,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1898646590, now seen corresponding path program 3 times [2023-08-30 18:00:34,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:34,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350991250] [2023-08-30 18:00:34,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:34,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 18:00:37,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:37,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350991250] [2023-08-30 18:00:37,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350991250] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:00:37,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644979809] [2023-08-30 18:00:37,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 18:00:37,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:37,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:00:37,613 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 18:00:37,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-30 18:00:37,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 18:00:37,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:00:37,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-30 18:00:37,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:00:37,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 18:00:37,835 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:00:37,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 18:00:37,869 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 13 treesize of output 15 [2023-08-30 18:00:37,899 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 13 treesize of output 15 [2023-08-30 18:00:37,940 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 13 treesize of output 9 [2023-08-30 18:00:37,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:00:37,996 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 18:00:38,015 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 18 treesize of output 13 [2023-08-30 18:00:38,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:00:38,067 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 18:00:38,119 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:00:38,119 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 19 treesize of output 11 [2023-08-30 18:00:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:00:38,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:00:38,229 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_71| Int)) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_71|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1019) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_71| 4)) 0)))) is different from false [2023-08-30 18:00:38,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:00:38,321 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 23 treesize of output 24 [2023-08-30 18:00:38,332 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:00:38,332 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 39 treesize of output 35 [2023-08-30 18:00:38,337 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 18 [2023-08-30 18:00:48,458 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_1013 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_71| Int) (v_ArrVal_1018 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1013) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_75| v_ArrVal_1018) |v_t_funThread1of2ForFork0_~p~0#1.offset_71|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_71| |v_t_funThread2of2ForFork0_~p~0#1.offset_75|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-30 18:00:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-30 18:00:50,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644979809] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:00:50,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:00:50,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 30 [2023-08-30 18:00:50,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157899389] [2023-08-30 18:00:50,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:00:50,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-30 18:00:50,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:00:50,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-30 18:00:50,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=687, Unknown=5, NotChecked=114, Total=992 [2023-08-30 18:00:50,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 476 [2023-08-30 18:00:50,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 110 transitions, 890 flow. Second operand has 32 states, 32 states have (on average 147.875) internal successors, (4732), 32 states have internal predecessors, (4732), 0 states have call successors, (0), 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 18:00:50,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:00:50,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 476 [2023-08-30 18:00:50,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00:52,722 INFO L130 PetriNetUnfolder]: 1291/2713 cut-off events. [2023-08-30 18:00:52,722 INFO L131 PetriNetUnfolder]: For 13128/13128 co-relation queries the response was YES. [2023-08-30 18:00:52,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10386 conditions, 2713 events. 1291/2713 cut-off events. For 13128/13128 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 19793 event pairs, 155 based on Foata normal form. 15/2449 useless extension candidates. Maximal degree in co-relation 10321. Up to 1380 conditions per place. [2023-08-30 18:00:52,735 INFO L137 encePairwiseOnDemand]: 464/476 looper letters, 112 selfloop transitions, 56 changer transitions 25/199 dead transitions. [2023-08-30 18:00:52,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 199 transitions, 1841 flow [2023-08-30 18:00:52,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-30 18:00:52,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-30 18:00:52,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3496 transitions. [2023-08-30 18:00:52,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31932773109243695 [2023-08-30 18:00:52,739 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 3496 transitions. [2023-08-30 18:00:52,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 3496 transitions. [2023-08-30 18:00:52,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:52,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3496 transitions. [2023-08-30 18:00:52,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 152.0) internal successors, (3496), 23 states have internal predecessors, (3496), 0 states have call successors, (0), 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 18:00:52,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 476.0) internal successors, (11424), 24 states have internal predecessors, (11424), 0 states have call successors, (0), 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 18:00:52,749 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 476.0) internal successors, (11424), 24 states have internal predecessors, (11424), 0 states have call successors, (0), 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 18:00:52,749 INFO L175 Difference]: Start difference. First operand has 127 places, 110 transitions, 890 flow. Second operand 23 states and 3496 transitions. [2023-08-30 18:00:52,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 199 transitions, 1841 flow [2023-08-30 18:00:52,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 199 transitions, 1538 flow, removed 142 selfloop flow, removed 5 redundant places. [2023-08-30 18:00:52,776 INFO L231 Difference]: Finished difference. Result has 149 places, 133 transitions, 1067 flow [2023-08-30 18:00:52,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1067, PETRI_PLACES=149, PETRI_TRANSITIONS=133} [2023-08-30 18:00:52,777 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 81 predicate places. [2023-08-30 18:00:52,777 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 133 transitions, 1067 flow [2023-08-30 18:00:52,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 147.875) internal successors, (4732), 32 states have internal predecessors, (4732), 0 states have call successors, (0), 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 18:00:52,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:52,778 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:00:52,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-08-30 18:00:52,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:52,978 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 18:00:52,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:52,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1477902326, now seen corresponding path program 4 times [2023-08-30 18:00:52,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:52,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342302804] [2023-08-30 18:00:52,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:52,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:53,378 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:00:53,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:53,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342302804] [2023-08-30 18:00:53,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342302804] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:00:53,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560261453] [2023-08-30 18:00:53,379 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 18:00:53,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:53,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:00:53,380 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 18:00:53,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-30 18:00:53,523 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 18:00:53,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:00:53,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-30 18:00:53,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:00:53,531 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 7 treesize of output 6 [2023-08-30 18:00:53,608 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:00:53,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 18:00:53,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 18:00:53,654 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 13 treesize of output 9 [2023-08-30 18:00:53,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:00:53,706 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 18:00:53,751 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 18 treesize of output 13 [2023-08-30 18:00:53,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:00:53,787 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 18:00:53,821 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 18:00:53,873 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:00:53,874 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 19 treesize of output 11 [2023-08-30 18:00:53,904 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:00:53,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:00:54,002 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1103 Int)) (or (= 0 (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1103)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1106) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|)) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1105) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_77|)) 0)))) is different from false [2023-08-30 18:00:54,050 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:00:54,050 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 23 treesize of output 24 [2023-08-30 18:00:54,062 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:00:54,063 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 39 treesize of output 35 [2023-08-30 18:00:54,067 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 18 [2023-08-30 18:00:54,107 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1103 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_73| v_ArrVal_1103)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1106) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|) 0))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1103 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_73| |v_t_funThread2of2ForFork0_~p~0#1.offset_77|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_73| v_ArrVal_1103)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1106) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|) 0))))) is different from false [2023-08-30 18:00:54,130 WARN L839 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1103 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int) (v_ArrVal_1099 (Array Int Int))) (= 0 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1099))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_73| v_ArrVal_1103))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1106) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|)))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1103 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int) (v_ArrVal_1099 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_73| |v_t_funThread2of2ForFork0_~p~0#1.offset_77|) (= 0 (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1099))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_73| v_ArrVal_1103))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1106) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77|))))) is different from false [2023-08-30 18:01:02,193 WARN L222 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:01:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-30 18:01:02,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560261453] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:01:02,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:01:02,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 21 [2023-08-30 18:01:02,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555994093] [2023-08-30 18:01:02,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:01:02,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 18:01:02,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:01:02,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 18:01:02,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=279, Unknown=5, NotChecked=114, Total=506 [2023-08-30 18:01:02,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 476 [2023-08-30 18:01:02,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 133 transitions, 1067 flow. Second operand has 23 states, 23 states have (on average 153.2173913043478) internal successors, (3524), 23 states have internal predecessors, (3524), 0 states have call successors, (0), 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 18:01:02,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:01:02,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 476 [2023-08-30 18:01:02,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:01:03,180 INFO L130 PetriNetUnfolder]: 1297/2729 cut-off events. [2023-08-30 18:01:03,180 INFO L131 PetriNetUnfolder]: For 9373/9405 co-relation queries the response was YES. [2023-08-30 18:01:03,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10330 conditions, 2729 events. 1297/2729 cut-off events. For 9373/9405 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 19914 event pairs, 176 based on Foata normal form. 3/2455 useless extension candidates. Maximal degree in co-relation 10249. Up to 1525 conditions per place. [2023-08-30 18:01:03,194 INFO L137 encePairwiseOnDemand]: 468/476 looper letters, 135 selfloop transitions, 23 changer transitions 14/178 dead transitions. [2023-08-30 18:01:03,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 178 transitions, 1643 flow [2023-08-30 18:01:03,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 18:01:03,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 18:01:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1448 transitions. [2023-08-30 18:01:03,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33800186741363214 [2023-08-30 18:01:03,196 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1448 transitions. [2023-08-30 18:01:03,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1448 transitions. [2023-08-30 18:01:03,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:01:03,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1448 transitions. [2023-08-30 18:01:03,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 160.88888888888889) internal successors, (1448), 9 states have internal predecessors, (1448), 0 states have call successors, (0), 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 18:01:03,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 476.0) internal successors, (4760), 10 states have internal predecessors, (4760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:01:03,201 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 476.0) internal successors, (4760), 10 states have internal predecessors, (4760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:01:03,201 INFO L175 Difference]: Start difference. First operand has 149 places, 133 transitions, 1067 flow. Second operand 9 states and 1448 transitions. [2023-08-30 18:01:03,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 178 transitions, 1643 flow [2023-08-30 18:01:03,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 178 transitions, 1481 flow, removed 57 selfloop flow, removed 16 redundant places. [2023-08-30 18:01:03,255 INFO L231 Difference]: Finished difference. Result has 143 places, 135 transitions, 982 flow [2023-08-30 18:01:03,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=982, PETRI_PLACES=143, PETRI_TRANSITIONS=135} [2023-08-30 18:01:03,256 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 75 predicate places. [2023-08-30 18:01:03,256 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 135 transitions, 982 flow [2023-08-30 18:01:03,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 153.2173913043478) internal successors, (3524), 23 states have internal predecessors, (3524), 0 states have call successors, (0), 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 18:01:03,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:01:03,256 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:01:03,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-30 18:01:03,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:01:03,457 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 18:01:03,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:01:03,457 INFO L85 PathProgramCache]: Analyzing trace with hash -21624520, now seen corresponding path program 5 times [2023-08-30 18:01:03,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:01:03,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966330067] [2023-08-30 18:01:03,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:01:03,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:01:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:01:03,797 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:01:03,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:01:03,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966330067] [2023-08-30 18:01:03,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966330067] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:01:03,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129701311] [2023-08-30 18:01:03,798 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 18:01:03,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:01:03,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:01:03,799 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 18:01:03,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-30 18:01:04,158 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-30 18:01:04,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:01:04,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-30 18:01:04,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:01:04,171 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 7 treesize of output 6 [2023-08-30 18:01:04,248 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:01:04,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 18:01:04,267 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 13 treesize of output 15 [2023-08-30 18:01:04,293 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 13 treesize of output 15 [2023-08-30 18:01:04,316 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 13 treesize of output 9 [2023-08-30 18:01:04,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:01:04,369 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 18:01:04,431 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:01:04,432 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 19 treesize of output 11 [2023-08-30 18:01:04,464 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 18 treesize of output 13 [2023-08-30 18:01:04,490 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 18:01:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:01:04,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:01:04,531 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1197 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1197) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:01:04,611 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1195 Int) (v_ArrVal_1197 (Array Int Int)) (v_ArrVal_1194 (Array Int Int))) (or (not (= 0 (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1194) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_79|)))) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1195)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1197) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0))) is different from false [2023-08-30 18:01:04,632 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:01:04,632 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 23 treesize of output 24 [2023-08-30 18:01:04,639 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:01:04,639 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 39 treesize of output 35 [2023-08-30 18:01:04,645 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 18 [2023-08-30 18:01:04,691 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1195 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_1197 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1195)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1197) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1195 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_1197 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_75| |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1195)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1197) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0))))) is different from false [2023-08-30 18:01:04,704 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1195 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_1197 (Array Int Int))) (= 0 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1191))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1195))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1197) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1195 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_1197 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_75| |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) (= 0 (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1191))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1195))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1197) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|))))) is different from false [2023-08-30 18:01:12,803 WARN L222 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:01:13,021 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-30 18:01:13,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129701311] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:01:13,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:01:13,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 20 [2023-08-30 18:01:13,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518298973] [2023-08-30 18:01:13,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:01:13,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-30 18:01:13,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:01:13,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-30 18:01:13,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=246, Unknown=8, NotChecked=140, Total=462 [2023-08-30 18:01:13,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 476 [2023-08-30 18:01:13,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 135 transitions, 982 flow. Second operand has 22 states, 22 states have (on average 153.5) internal successors, (3377), 22 states have internal predecessors, (3377), 0 states have call successors, (0), 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 18:01:13,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:01:13,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 476 [2023-08-30 18:01:13,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:01:14,060 INFO L130 PetriNetUnfolder]: 1387/2943 cut-off events. [2023-08-30 18:01:14,060 INFO L131 PetriNetUnfolder]: For 8980/9012 co-relation queries the response was YES. [2023-08-30 18:01:14,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10862 conditions, 2943 events. 1387/2943 cut-off events. For 8980/9012 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 22057 event pairs, 219 based on Foata normal form. 13/2654 useless extension candidates. Maximal degree in co-relation 10789. Up to 1630 conditions per place. [2023-08-30 18:01:14,075 INFO L137 encePairwiseOnDemand]: 467/476 looper letters, 126 selfloop transitions, 16 changer transitions 66/214 dead transitions. [2023-08-30 18:01:14,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 214 transitions, 1776 flow [2023-08-30 18:01:14,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 18:01:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 18:01:14,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2243 transitions. [2023-08-30 18:01:14,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3365846338535414 [2023-08-30 18:01:14,079 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2243 transitions. [2023-08-30 18:01:14,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2243 transitions. [2023-08-30 18:01:14,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:01:14,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2243 transitions. [2023-08-30 18:01:14,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 160.21428571428572) internal successors, (2243), 14 states have internal predecessors, (2243), 0 states have call successors, (0), 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 18:01:14,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 476.0) internal successors, (7140), 15 states have internal predecessors, (7140), 0 states have call successors, (0), 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 18:01:14,087 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 476.0) internal successors, (7140), 15 states have internal predecessors, (7140), 0 states have call successors, (0), 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 18:01:14,088 INFO L175 Difference]: Start difference. First operand has 143 places, 135 transitions, 982 flow. Second operand 14 states and 2243 transitions. [2023-08-30 18:01:14,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 214 transitions, 1776 flow [2023-08-30 18:01:14,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 214 transitions, 1734 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-30 18:01:14,120 INFO L231 Difference]: Finished difference. Result has 154 places, 124 transitions, 891 flow [2023-08-30 18:01:14,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=945, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=891, PETRI_PLACES=154, PETRI_TRANSITIONS=124} [2023-08-30 18:01:14,120 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 86 predicate places. [2023-08-30 18:01:14,121 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 124 transitions, 891 flow [2023-08-30 18:01:14,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 153.5) internal successors, (3377), 22 states have internal predecessors, (3377), 0 states have call successors, (0), 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 18:01:14,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:01:14,121 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:01:14,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-30 18:01:14,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-30 18:01:14,329 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 18:01:14,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:01:14,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1666437112, now seen corresponding path program 4 times [2023-08-30 18:01:14,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:01:14,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839510362] [2023-08-30 18:01:14,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:01:14,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:01:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:01:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:01:14,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:01:14,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839510362] [2023-08-30 18:01:14,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839510362] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:01:14,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486137577] [2023-08-30 18:01:14,820 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 18:01:14,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:01:14,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:01:14,821 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 18:01:14,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-30 18:01:14,945 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 18:01:14,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:01:14,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-30 18:01:14,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:01:14,953 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 7 treesize of output 6 [2023-08-30 18:01:15,011 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:01:15,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 18:01:15,026 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 13 treesize of output 15 [2023-08-30 18:01:15,043 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 13 treesize of output 15 [2023-08-30 18:01:15,051 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 13 treesize of output 9 [2023-08-30 18:01:15,115 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:01:15,116 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 19 treesize of output 11 [2023-08-30 18:01:15,167 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 18 treesize of output 13 [2023-08-30 18:01:15,205 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 18:01:15,225 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:01:15,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:01:15,230 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1287) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:01:15,314 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 13 [2023-08-30 18:01:15,318 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 12 treesize of output 8 [2023-08-30 18:01:15,325 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1285 Int) (v_ArrVal_1287 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_81| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_81| v_ArrVal_1285)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1287) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_77|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_77| |v_t_funThread2of2ForFork0_~p~0#1.offset_81|))) is different from false [2023-08-30 18:01:15,334 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1285 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1287 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1282 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_77| |v_t_funThread2of2ForFork0_~p~0#1.offset_81|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1282))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_81| v_ArrVal_1285))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1287) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_77|) 0))) is different from false [2023-08-30 18:01:15,494 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-30 18:01:15,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486137577] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:01:15,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:01:15,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 20 [2023-08-30 18:01:15,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605310214] [2023-08-30 18:01:15,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:01:15,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-30 18:01:15,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:01:15,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-30 18:01:15,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=265, Unknown=6, NotChecked=108, Total=462 [2023-08-30 18:01:15,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 476 [2023-08-30 18:01:15,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 124 transitions, 891 flow. Second operand has 22 states, 22 states have (on average 151.5909090909091) internal successors, (3335), 22 states have internal predecessors, (3335), 0 states have call successors, (0), 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 18:01:15,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:01:15,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 476 [2023-08-30 18:01:15,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:01:16,448 INFO L130 PetriNetUnfolder]: 1106/2400 cut-off events. [2023-08-30 18:01:16,448 INFO L131 PetriNetUnfolder]: For 7051/7077 co-relation queries the response was YES. [2023-08-30 18:01:16,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8798 conditions, 2400 events. 1106/2400 cut-off events. For 7051/7077 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 17322 event pairs, 211 based on Foata normal form. 5/2163 useless extension candidates. Maximal degree in co-relation 8721. Up to 1463 conditions per place. [2023-08-30 18:01:16,461 INFO L137 encePairwiseOnDemand]: 465/476 looper letters, 127 selfloop transitions, 19 changer transitions 50/202 dead transitions. [2023-08-30 18:01:16,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 202 transitions, 1600 flow [2023-08-30 18:01:16,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 18:01:16,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 18:01:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2213 transitions. [2023-08-30 18:01:16,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3320828331332533 [2023-08-30 18:01:16,465 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2213 transitions. [2023-08-30 18:01:16,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2213 transitions. [2023-08-30 18:01:16,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:01:16,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2213 transitions. [2023-08-30 18:01:16,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 158.07142857142858) internal successors, (2213), 14 states have internal predecessors, (2213), 0 states have call successors, (0), 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 18:01:16,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 476.0) internal successors, (7140), 15 states have internal predecessors, (7140), 0 states have call successors, (0), 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 18:01:16,473 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 476.0) internal successors, (7140), 15 states have internal predecessors, (7140), 0 states have call successors, (0), 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 18:01:16,473 INFO L175 Difference]: Start difference. First operand has 154 places, 124 transitions, 891 flow. Second operand 14 states and 2213 transitions. [2023-08-30 18:01:16,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 202 transitions, 1600 flow [2023-08-30 18:01:16,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 202 transitions, 1542 flow, removed 13 selfloop flow, removed 15 redundant places. [2023-08-30 18:01:16,498 INFO L231 Difference]: Finished difference. Result has 146 places, 123 transitions, 881 flow [2023-08-30 18:01:16,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=881, PETRI_PLACES=146, PETRI_TRANSITIONS=123} [2023-08-30 18:01:16,498 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 78 predicate places. [2023-08-30 18:01:16,498 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 123 transitions, 881 flow [2023-08-30 18:01:16,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 151.5909090909091) internal successors, (3335), 22 states have internal predecessors, (3335), 0 states have call successors, (0), 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 18:01:16,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:01:16,499 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:01:16,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-30 18:01:16,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-30 18:01:16,706 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 18:01:16,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:01:16,706 INFO L85 PathProgramCache]: Analyzing trace with hash -8580036, now seen corresponding path program 6 times [2023-08-30 18:01:16,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:01:16,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101651407] [2023-08-30 18:01:16,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:01:16,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:01:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:01:17,113 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 18:01:17,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:01:17,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101651407] [2023-08-30 18:01:17,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101651407] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:01:17,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537074714] [2023-08-30 18:01:17,114 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 18:01:17,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:01:17,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:01:17,117 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 18:01:17,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-30 18:01:17,551 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-08-30 18:01:17,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:01:17,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-30 18:01:17,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:01:17,559 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 7 treesize of output 6 [2023-08-30 18:01:17,682 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-30 18:01:17,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-08-30 18:01:17,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 18:01:17,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 18:01:17,810 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 13 treesize of output 9 [2023-08-30 18:01:17,864 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:01:17,864 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 19 treesize of output 11 [2023-08-30 18:01:17,985 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 18 treesize of output 13 [2023-08-30 18:01:18,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 18:01:18,077 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 18:01:18,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:01:18,087 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1377 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1377) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:01:18,177 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 13 [2023-08-30 18:01:18,181 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 12 treesize of output 8 [2023-08-30 18:01:18,188 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1375 Int) (v_ArrVal_1377 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_83| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_79| v_ArrVal_1375)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1377) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_83|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_79| |v_t_funThread2of2ForFork0_~p~0#1.offset_83|))) is different from false [2023-08-30 18:01:18,214 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1375 Int) (v_ArrVal_1377 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1372 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1372))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_79| v_ArrVal_1375))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1377) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_83|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_79| |v_t_funThread2of2ForFork0_~p~0#1.offset_83|))) is different from false [2023-08-30 18:01:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-30 18:01:18,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537074714] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:01:18,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:01:18,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 19 [2023-08-30 18:01:18,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158344656] [2023-08-30 18:01:18,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:01:18,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-30 18:01:18,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:01:18,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-30 18:01:18,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=246, Unknown=8, NotChecked=102, Total=420 [2023-08-30 18:01:18,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 476 [2023-08-30 18:01:18,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 123 transitions, 881 flow. Second operand has 21 states, 21 states have (on average 152.61904761904762) internal successors, (3205), 21 states have internal predecessors, (3205), 0 states have call successors, (0), 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 18:01:18,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:01:18,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 476 [2023-08-30 18:01:18,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:01:19,218 INFO L130 PetriNetUnfolder]: 1048/2270 cut-off events. [2023-08-30 18:01:19,218 INFO L131 PetriNetUnfolder]: For 5717/5743 co-relation queries the response was YES. [2023-08-30 18:01:19,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8176 conditions, 2270 events. 1048/2270 cut-off events. For 5717/5743 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16081 event pairs, 231 based on Foata normal form. 4/2040 useless extension candidates. Maximal degree in co-relation 8102. Up to 1387 conditions per place. [2023-08-30 18:01:19,231 INFO L137 encePairwiseOnDemand]: 467/476 looper letters, 110 selfloop transitions, 10 changer transitions 44/170 dead transitions. [2023-08-30 18:01:19,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 170 transitions, 1393 flow [2023-08-30 18:01:19,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 18:01:19,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 18:01:19,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1444 transitions. [2023-08-30 18:01:19,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3370681605975724 [2023-08-30 18:01:19,233 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1444 transitions. [2023-08-30 18:01:19,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1444 transitions. [2023-08-30 18:01:19,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:01:19,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1444 transitions. [2023-08-30 18:01:19,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 160.44444444444446) internal successors, (1444), 9 states have internal predecessors, (1444), 0 states have call successors, (0), 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 18:01:19,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 476.0) internal successors, (4760), 10 states have internal predecessors, (4760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:01:19,237 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 476.0) internal successors, (4760), 10 states have internal predecessors, (4760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:01:19,237 INFO L175 Difference]: Start difference. First operand has 146 places, 123 transitions, 881 flow. Second operand 9 states and 1444 transitions. [2023-08-30 18:01:19,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 170 transitions, 1393 flow [2023-08-30 18:01:19,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 170 transitions, 1350 flow, removed 9 selfloop flow, removed 8 redundant places. [2023-08-30 18:01:19,254 INFO L231 Difference]: Finished difference. Result has 146 places, 116 transitions, 797 flow [2023-08-30 18:01:19,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=797, PETRI_PLACES=146, PETRI_TRANSITIONS=116} [2023-08-30 18:01:19,255 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 78 predicate places. [2023-08-30 18:01:19,255 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 116 transitions, 797 flow [2023-08-30 18:01:19,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 152.61904761904762) internal successors, (3205), 21 states have internal predecessors, (3205), 0 states have call successors, (0), 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 18:01:19,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:01:19,256 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:01:19,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-30 18:01:19,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-30 18:01:19,456 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 18:01:19,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:01:19,457 INFO L85 PathProgramCache]: Analyzing trace with hash -10975816, now seen corresponding path program 5 times [2023-08-30 18:01:19,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:01:19,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172268418] [2023-08-30 18:01:19,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:01:19,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:01:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:01:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 18:01:19,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:01:19,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172268418] [2023-08-30 18:01:19,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172268418] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:01:19,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097431766] [2023-08-30 18:01:19,741 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 18:01:19,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:01:19,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:01:19,742 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 18:01:19,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-30 18:01:20,216 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-30 18:01:20,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:01:20,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-30 18:01:20,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:01:20,224 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 7 treesize of output 6 [2023-08-30 18:01:20,271 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:01:20,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 18:01:20,287 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 13 treesize of output 15 [2023-08-30 18:01:20,306 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 13 treesize of output 15 [2023-08-30 18:01:20,332 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 13 treesize of output 9 [2023-08-30 18:01:20,379 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:01:20,379 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 19 treesize of output 11 [2023-08-30 18:01:20,427 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 18 treesize of output 13 [2023-08-30 18:01:20,465 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 18:01:20,483 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 18:01:20,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:01:20,601 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 13 [2023-08-30 18:01:20,606 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 12 treesize of output 8 [2023-08-30 18:01:20,613 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1467 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1465 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int)) (or (= 0 (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85| v_ArrVal_1465)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1467) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81|)) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_81| |v_t_funThread2of2ForFork0_~p~0#1.offset_85|))) is different from false [2023-08-30 18:01:20,641 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1467 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1465 Int) (v_ArrVal_1462 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_81| |v_t_funThread2of2ForFork0_~p~0#1.offset_85|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1462))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85| v_ArrVal_1465))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1467) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81|) 0))) is different from false [2023-08-30 18:01:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-30 18:01:20,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097431766] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:01:20,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:01:20,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 17 [2023-08-30 18:01:20,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821365966] [2023-08-30 18:01:20,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:01:20,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-30 18:01:20,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:01:20,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-30 18:01:20,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=208, Unknown=10, NotChecked=62, Total=342 [2023-08-30 18:01:20,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 476 [2023-08-30 18:01:20,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 116 transitions, 797 flow. Second operand has 19 states, 19 states have (on average 154.78947368421052) internal successors, (2941), 19 states have internal predecessors, (2941), 0 states have call successors, (0), 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 18:01:20,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:01:20,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 476 [2023-08-30 18:01:20,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:01:21,559 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1467 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1467) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1465)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1467) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0))) is different from false [2023-08-30 18:01:21,781 INFO L130 PetriNetUnfolder]: 955/2134 cut-off events. [2023-08-30 18:01:21,781 INFO L131 PetriNetUnfolder]: For 5833/5855 co-relation queries the response was YES. [2023-08-30 18:01:21,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7621 conditions, 2134 events. 955/2134 cut-off events. For 5833/5855 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 15228 event pairs, 197 based on Foata normal form. 8/1927 useless extension candidates. Maximal degree in co-relation 7547. Up to 981 conditions per place. [2023-08-30 18:01:21,793 INFO L137 encePairwiseOnDemand]: 462/476 looper letters, 92 selfloop transitions, 13 changer transitions 99/210 dead transitions. [2023-08-30 18:01:21,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 210 transitions, 1662 flow [2023-08-30 18:01:21,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-30 18:01:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-30 18:01:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2565 transitions. [2023-08-30 18:01:21,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33679096638655465 [2023-08-30 18:01:21,797 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2565 transitions. [2023-08-30 18:01:21,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2565 transitions. [2023-08-30 18:01:21,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:01:21,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2565 transitions. [2023-08-30 18:01:21,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 160.3125) internal successors, (2565), 16 states have internal predecessors, (2565), 0 states have call successors, (0), 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 18:01:21,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 476.0) internal successors, (8092), 17 states have internal predecessors, (8092), 0 states have call successors, (0), 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 18:01:21,804 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 476.0) internal successors, (8092), 17 states have internal predecessors, (8092), 0 states have call successors, (0), 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 18:01:21,805 INFO L175 Difference]: Start difference. First operand has 146 places, 116 transitions, 797 flow. Second operand 16 states and 2565 transitions. [2023-08-30 18:01:21,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 210 transitions, 1662 flow [2023-08-30 18:01:21,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 210 transitions, 1611 flow, removed 14 selfloop flow, removed 13 redundant places. [2023-08-30 18:01:21,821 INFO L231 Difference]: Finished difference. Result has 146 places, 98 transitions, 665 flow [2023-08-30 18:01:21,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=665, PETRI_PLACES=146, PETRI_TRANSITIONS=98} [2023-08-30 18:01:21,821 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 78 predicate places. [2023-08-30 18:01:21,822 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 98 transitions, 665 flow [2023-08-30 18:01:21,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 154.78947368421052) internal successors, (2941), 19 states have internal predecessors, (2941), 0 states have call successors, (0), 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 18:01:21,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:01:21,822 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:01:21,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-08-30 18:01:22,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:01:22,023 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 18:01:22,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:01:22,023 INFO L85 PathProgramCache]: Analyzing trace with hash -858990792, now seen corresponding path program 6 times [2023-08-30 18:01:22,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:01:22,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869714838] [2023-08-30 18:01:22,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:01:22,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:01:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:01:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 18:01:22,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:01:22,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869714838] [2023-08-30 18:01:22,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869714838] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:01:22,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45610629] [2023-08-30 18:01:22,661 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 18:01:22,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:01:22,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:01:22,665 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 18:01:22,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-08-30 18:01:23,025 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-08-30 18:01:23,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:01:23,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-30 18:01:23,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:01:23,046 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 7 treesize of output 6 [2023-08-30 18:01:23,202 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-30 18:01:23,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-08-30 18:01:23,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 18:01:23,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 18:01:23,354 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 13 treesize of output 9 [2023-08-30 18:01:23,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:01:23,457 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 18:01:23,490 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 18 treesize of output 13 [2023-08-30 18:01:23,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:01:23,536 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 18:01:23,599 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:01:23,600 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 19 treesize of output 11 [2023-08-30 18:01:23,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 18:01:23,690 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 18:01:23,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:01:23,788 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1556 Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1556)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1559) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1558) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_83| 4)) 0)))) is different from false [2023-08-30 18:01:23,817 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:01:23,817 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 23 treesize of output 24 [2023-08-30 18:01:23,824 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:01:23,824 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 39 treesize of output 35 [2023-08-30 18:01:23,828 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 18 [2023-08-30 18:01:23,860 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((v_ArrVal_1559 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_87| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1556 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_83| |v_t_funThread2of2ForFork0_~p~0#1.offset_87|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_87| v_ArrVal_1556)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1559) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0))) (or (forall ((v_ArrVal_1559 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_87| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1556 Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_87| v_ArrVal_1556)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1559) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-08-30 18:01:23,900 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1559 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1552 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1556 Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1552))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_87| v_ArrVal_1556))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1559) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_1559 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1552 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1556 Int)) (or (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1552))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_87| v_ArrVal_1556))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1559) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_83| |v_t_funThread2of2ForFork0_~p~0#1.offset_87|)))) is different from false [2023-08-30 18:01:32,007 WARN L222 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:01:32,277 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-30 18:01:32,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45610629] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:01:32,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:01:32,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 22 [2023-08-30 18:01:32,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627021582] [2023-08-30 18:01:32,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:01:32,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-30 18:01:32,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:01:32,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-30 18:01:32,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=336, Unknown=8, NotChecked=120, Total=552 [2023-08-30 18:01:32,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 476 [2023-08-30 18:01:32,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 98 transitions, 665 flow. Second operand has 24 states, 24 states have (on average 150.29166666666666) internal successors, (3607), 24 states have internal predecessors, (3607), 0 states have call successors, (0), 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 18:01:32,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:01:32,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 476 [2023-08-30 18:01:32,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:01:33,429 INFO L130 PetriNetUnfolder]: 628/1394 cut-off events. [2023-08-30 18:01:33,430 INFO L131 PetriNetUnfolder]: For 4361/4361 co-relation queries the response was YES. [2023-08-30 18:01:33,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5306 conditions, 1394 events. 628/1394 cut-off events. For 4361/4361 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8944 event pairs, 132 based on Foata normal form. 1/1269 useless extension candidates. Maximal degree in co-relation 5231. Up to 713 conditions per place. [2023-08-30 18:01:33,437 INFO L137 encePairwiseOnDemand]: 467/476 looper letters, 95 selfloop transitions, 19 changer transitions 23/143 dead transitions. [2023-08-30 18:01:33,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 143 transitions, 1149 flow [2023-08-30 18:01:33,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 18:01:33,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 18:01:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1719 transitions. [2023-08-30 18:01:33,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3283040488922842 [2023-08-30 18:01:33,440 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1719 transitions. [2023-08-30 18:01:33,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1719 transitions. [2023-08-30 18:01:33,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:01:33,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1719 transitions. [2023-08-30 18:01:33,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 156.27272727272728) internal successors, (1719), 11 states have internal predecessors, (1719), 0 states have call successors, (0), 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 18:01:33,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 476.0) internal successors, (5712), 12 states have internal predecessors, (5712), 0 states have call successors, (0), 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 18:01:33,447 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 476.0) internal successors, (5712), 12 states have internal predecessors, (5712), 0 states have call successors, (0), 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 18:01:33,447 INFO L175 Difference]: Start difference. First operand has 146 places, 98 transitions, 665 flow. Second operand 11 states and 1719 transitions. [2023-08-30 18:01:33,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 143 transitions, 1149 flow [2023-08-30 18:01:33,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 143 transitions, 1075 flow, removed 24 selfloop flow, removed 14 redundant places. [2023-08-30 18:01:33,464 INFO L231 Difference]: Finished difference. Result has 129 places, 100 transitions, 679 flow [2023-08-30 18:01:33,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=679, PETRI_PLACES=129, PETRI_TRANSITIONS=100} [2023-08-30 18:01:33,468 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 61 predicate places. [2023-08-30 18:01:33,469 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 100 transitions, 679 flow [2023-08-30 18:01:33,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 150.29166666666666) internal successors, (3607), 24 states have internal predecessors, (3607), 0 states have call successors, (0), 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 18:01:33,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:01:33,469 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 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 18:01:33,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-08-30 18:01:33,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-30 18:01:33,670 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 18:01:33,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:01:33,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1427755723, now seen corresponding path program 1 times [2023-08-30 18:01:33,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:01:33,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720282268] [2023-08-30 18:01:33,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:01:33,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:01:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:01:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:01:34,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:01:34,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720282268] [2023-08-30 18:01:34,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720282268] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:01:34,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866042019] [2023-08-30 18:01:34,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:01:34,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:01:34,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:01:34,061 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 18:01:34,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-08-30 18:01:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:01:34,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-30 18:01:34,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:01:34,242 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 7 treesize of output 6 [2023-08-30 18:01:34,342 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:01:34,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 18:01:34,369 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 13 treesize of output 15 [2023-08-30 18:01:34,398 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 13 treesize of output 15 [2023-08-30 18:01:34,416 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 13 treesize of output 9 [2023-08-30 18:01:34,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:01:34,461 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 18:01:34,487 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 18 treesize of output 13 [2023-08-30 18:01:34,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:01:34,522 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 18:01:34,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:01:34,538 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 18:01:34,556 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 21 treesize of output 16 [2023-08-30 18:01:34,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:01:34,584 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 18:01:34,617 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:01:34,617 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 19 treesize of output 11 [2023-08-30 18:01:34,647 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:01:34,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:01:34,675 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_89| Int) (v_ArrVal_1662 (Array Int Int))) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_89|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1662) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_89|)) 0)))) is different from false [2023-08-30 18:01:34,755 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:01:34,755 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 23 treesize of output 24 [2023-08-30 18:01:34,762 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:01:34,762 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 39 treesize of output 35 [2023-08-30 18:01:34,765 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 18 [2023-08-30 18:01:50,862 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_89| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1652 (Array Int Int)) (v_ArrVal_1661 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_85| |v_t_funThread2of2ForFork0_~p~0#1.offset_89|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1652) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85| v_ArrVal_1661) |v_t_funThread2of2ForFork0_~p~0#1.offset_89|) 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-30 18:01:53,122 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-30 18:01:53,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866042019] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:01:53,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:01:53,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 22 [2023-08-30 18:01:53,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778373431] [2023-08-30 18:01:53,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:01:53,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-30 18:01:53,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:01:53,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-30 18:01:53,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=374, Unknown=9, NotChecked=82, Total=552 [2023-08-30 18:01:53,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-08-30 18:01:53,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 100 transitions, 679 flow. Second operand has 24 states, 24 states have (on average 149.625) internal successors, (3591), 24 states have internal predecessors, (3591), 0 states have call successors, (0), 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 18:01:53,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:01:53,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-08-30 18:01:53,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:01:54,349 INFO L130 PetriNetUnfolder]: 688/1538 cut-off events. [2023-08-30 18:01:54,349 INFO L131 PetriNetUnfolder]: For 4433/4447 co-relation queries the response was YES. [2023-08-30 18:01:54,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5770 conditions, 1538 events. 688/1538 cut-off events. For 4433/4447 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10226 event pairs, 127 based on Foata normal form. 12/1412 useless extension candidates. Maximal degree in co-relation 5700. Up to 869 conditions per place. [2023-08-30 18:01:54,356 INFO L137 encePairwiseOnDemand]: 463/476 looper letters, 124 selfloop transitions, 36 changer transitions 29/195 dead transitions. [2023-08-30 18:01:54,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 195 transitions, 1576 flow [2023-08-30 18:01:54,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-30 18:01:54,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-30 18:01:54,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3080 transitions. [2023-08-30 18:01:54,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3235294117647059 [2023-08-30 18:01:54,359 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3080 transitions. [2023-08-30 18:01:54,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3080 transitions. [2023-08-30 18:01:54,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:01:54,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3080 transitions. [2023-08-30 18:01:54,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 154.0) internal successors, (3080), 20 states have internal predecessors, (3080), 0 states have call successors, (0), 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 18:01:54,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 476.0) internal successors, (9996), 21 states have internal predecessors, (9996), 0 states have call successors, (0), 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 18:01:54,370 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 476.0) internal successors, (9996), 21 states have internal predecessors, (9996), 0 states have call successors, (0), 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 18:01:54,370 INFO L175 Difference]: Start difference. First operand has 129 places, 100 transitions, 679 flow. Second operand 20 states and 3080 transitions. [2023-08-30 18:01:54,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 195 transitions, 1576 flow [2023-08-30 18:01:54,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 195 transitions, 1537 flow, removed 4 selfloop flow, removed 9 redundant places. [2023-08-30 18:01:54,382 INFO L231 Difference]: Finished difference. Result has 142 places, 120 transitions, 915 flow [2023-08-30 18:01:54,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=915, PETRI_PLACES=142, PETRI_TRANSITIONS=120} [2023-08-30 18:01:54,383 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 74 predicate places. [2023-08-30 18:01:54,383 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 120 transitions, 915 flow [2023-08-30 18:01:54,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 149.625) internal successors, (3591), 24 states have internal predecessors, (3591), 0 states have call successors, (0), 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 18:01:54,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:01:54,384 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 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 18:01:54,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-08-30 18:01:54,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:01:54,590 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 18:01:54,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:01:54,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1842095526, now seen corresponding path program 1 times [2023-08-30 18:01:54,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:01:54,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419447978] [2023-08-30 18:01:54,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:01:54,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:01:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:01:54,882 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:01:54,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:01:54,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419447978] [2023-08-30 18:01:54,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419447978] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:01:54,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958756125] [2023-08-30 18:01:54,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:01:54,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:01:54,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:01:54,884 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 18:01:54,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-08-30 18:01:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:01:55,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-30 18:01:55,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:01:55,033 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 7 treesize of output 6 [2023-08-30 18:01:55,108 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:01:55,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 18:01:55,129 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 13 treesize of output 15 [2023-08-30 18:01:55,155 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 13 treesize of output 15 [2023-08-30 18:01:55,177 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 13 treesize of output 9 [2023-08-30 18:01:55,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:01:55,225 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 18:01:55,245 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 18 treesize of output 13 [2023-08-30 18:01:55,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:01:55,275 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 18:01:55,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:01:55,292 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 18:01:55,325 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:01:55,325 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 19 treesize of output 11 [2023-08-30 18:01:55,370 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 21 treesize of output 16 [2023-08-30 18:01:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:01:55,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:01:55,564 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:01:55,564 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 23 treesize of output 24 [2023-08-30 18:01:55,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:01:55,572 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 39 treesize of output 35 [2023-08-30 18:01:55,577 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 18 [2023-08-30 18:02:13,694 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_1755 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1763 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1755) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_91| v_ArrVal_1763) |v_t_funThread1of2ForFork0_~p~0#1.offset_87|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_87| |v_t_funThread2of2ForFork0_~p~0#1.offset_91|)))) is different from false [2023-08-30 18:02:15,973 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-30 18:02:15,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958756125] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:02:15,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:02:15,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2023-08-30 18:02:15,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651742920] [2023-08-30 18:02:15,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:02:15,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-30 18:02:15,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:02:15,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-30 18:02:15,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=467, Unknown=8, NotChecked=44, Total=600 [2023-08-30 18:02:15,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-08-30 18:02:15,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 120 transitions, 915 flow. Second operand has 25 states, 25 states have (on average 149.52) internal successors, (3738), 25 states have internal predecessors, (3738), 0 states have call successors, (0), 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 18:02:15,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:02:15,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-08-30 18:02:15,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:02:17,086 INFO L130 PetriNetUnfolder]: 697/1585 cut-off events. [2023-08-30 18:02:17,086 INFO L131 PetriNetUnfolder]: For 5492/5492 co-relation queries the response was YES. [2023-08-30 18:02:17,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6162 conditions, 1585 events. 697/1585 cut-off events. For 5492/5492 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10873 event pairs, 82 based on Foata normal form. 18/1453 useless extension candidates. Maximal degree in co-relation 6090. Up to 716 conditions per place. [2023-08-30 18:02:17,093 INFO L137 encePairwiseOnDemand]: 463/476 looper letters, 129 selfloop transitions, 47 changer transitions 30/212 dead transitions. [2023-08-30 18:02:17,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 212 transitions, 1771 flow [2023-08-30 18:02:17,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-30 18:02:17,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-30 18:02:17,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3085 transitions. [2023-08-30 18:02:17,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3240546218487395 [2023-08-30 18:02:17,097 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3085 transitions. [2023-08-30 18:02:17,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3085 transitions. [2023-08-30 18:02:17,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:02:17,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3085 transitions. [2023-08-30 18:02:17,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 154.25) internal successors, (3085), 20 states have internal predecessors, (3085), 0 states have call successors, (0), 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 18:02:17,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 476.0) internal successors, (9996), 21 states have internal predecessors, (9996), 0 states have call successors, (0), 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 18:02:17,104 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 476.0) internal successors, (9996), 21 states have internal predecessors, (9996), 0 states have call successors, (0), 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 18:02:17,104 INFO L175 Difference]: Start difference. First operand has 142 places, 120 transitions, 915 flow. Second operand 20 states and 3085 transitions. [2023-08-30 18:02:17,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 212 transitions, 1771 flow [2023-08-30 18:02:17,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 212 transitions, 1627 flow, removed 58 selfloop flow, removed 8 redundant places. [2023-08-30 18:02:17,118 INFO L231 Difference]: Finished difference. Result has 159 places, 138 transitions, 1060 flow [2023-08-30 18:02:17,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1060, PETRI_PLACES=159, PETRI_TRANSITIONS=138} [2023-08-30 18:02:17,119 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 91 predicate places. [2023-08-30 18:02:17,119 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 138 transitions, 1060 flow [2023-08-30 18:02:17,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 149.52) internal successors, (3738), 25 states have internal predecessors, (3738), 0 states have call successors, (0), 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 18:02:17,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:02:17,120 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 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 18:02:17,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-08-30 18:02:17,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-08-30 18:02:17,326 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 18:02:17,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:02:17,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1581483817, now seen corresponding path program 2 times [2023-08-30 18:02:17,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:02:17,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158280829] [2023-08-30 18:02:17,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:02:17,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:02:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:02:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:02:17,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:02:17,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158280829] [2023-08-30 18:02:17,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158280829] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:02:17,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904180366] [2023-08-30 18:02:17,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 18:02:17,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:02:17,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:02:17,703 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 18:02:17,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-08-30 18:02:17,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 18:02:17,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:02:17,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 18:02:17,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:02:17,859 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 7 treesize of output 6 [2023-08-30 18:02:17,905 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:02:17,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 18:02:17,912 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 13 treesize of output 15 [2023-08-30 18:02:17,991 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 24 treesize of output 17 [2023-08-30 18:02:18,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-08-30 18:02:18,071 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 13 treesize of output 15 [2023-08-30 18:02:18,113 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:02:18,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:02:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:02:34,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904180366] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:02:34,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:02:34,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 20 [2023-08-30 18:02:34,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542967227] [2023-08-30 18:02:34,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:02:34,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-30 18:02:34,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:02:34,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-30 18:02:34,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=377, Unknown=5, NotChecked=0, Total=462 [2023-08-30 18:02:36,489 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 18:02:38,519 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 18:02:40,552 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 18:02:42,597 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 18:02:44,625 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 18:02:46,653 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 18:02:48,703 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 18:02:50,710 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 18:02:52,718 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 18:02:54,727 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 18:02:56,736 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 18:02:58,751 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 18:03:00,764 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 18:03:02,792 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 18:03:04,821 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 18:03:06,849 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 18:03:08,880 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 18:03:10,909 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 18:03:12,937 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 18:03:14,966 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 18:03:16,982 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 18:03:19,010 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 18:03:21,039 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 18:03:23,059 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 18:03:25,072 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 18:03:27,112 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 18:03:29,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:03:31,180 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 18:03:33,210 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 18:03:35,227 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 18:03:37,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:03:37,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 476 [2023-08-30 18:03:37,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 138 transitions, 1060 flow. Second operand has 22 states, 22 states have (on average 168.5) internal successors, (3707), 22 states have internal predecessors, (3707), 0 states have call successors, (0), 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 18:03:37,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:03:37,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 476 [2023-08-30 18:03:37,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:03:38,121 INFO L130 PetriNetUnfolder]: 669/1618 cut-off events. [2023-08-30 18:03:38,122 INFO L131 PetriNetUnfolder]: For 6135/6180 co-relation queries the response was YES. [2023-08-30 18:03:38,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6499 conditions, 1618 events. 669/1618 cut-off events. For 6135/6180 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11719 event pairs, 112 based on Foata normal form. 19/1483 useless extension candidates. Maximal degree in co-relation 6420. Up to 521 conditions per place. [2023-08-30 18:03:38,131 INFO L137 encePairwiseOnDemand]: 465/476 looper letters, 128 selfloop transitions, 17 changer transitions 48/202 dead transitions. [2023-08-30 18:03:38,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 202 transitions, 1836 flow [2023-08-30 18:03:38,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 18:03:38,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 18:03:38,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2418 transitions. [2023-08-30 18:03:38,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3628451380552221 [2023-08-30 18:03:38,133 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2418 transitions. [2023-08-30 18:03:38,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2418 transitions. [2023-08-30 18:03:38,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:03:38,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2418 transitions. [2023-08-30 18:03:38,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 172.71428571428572) internal successors, (2418), 14 states have internal predecessors, (2418), 0 states have call successors, (0), 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 18:03:38,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 476.0) internal successors, (7140), 15 states have internal predecessors, (7140), 0 states have call successors, (0), 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 18:03:38,139 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 476.0) internal successors, (7140), 15 states have internal predecessors, (7140), 0 states have call successors, (0), 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 18:03:38,139 INFO L175 Difference]: Start difference. First operand has 159 places, 138 transitions, 1060 flow. Second operand 14 states and 2418 transitions. [2023-08-30 18:03:38,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 202 transitions, 1836 flow [2023-08-30 18:03:38,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 202 transitions, 1768 flow, removed 18 selfloop flow, removed 9 redundant places. [2023-08-30 18:03:38,155 INFO L231 Difference]: Finished difference. Result has 164 places, 126 transitions, 962 flow [2023-08-30 18:03:38,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=962, PETRI_PLACES=164, PETRI_TRANSITIONS=126} [2023-08-30 18:03:38,156 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 96 predicate places. [2023-08-30 18:03:38,156 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 126 transitions, 962 flow [2023-08-30 18:03:38,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 168.5) internal successors, (3707), 22 states have internal predecessors, (3707), 0 states have call successors, (0), 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 18:03:38,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:03:38,157 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 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 18:03:38,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-08-30 18:03:38,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:03:38,357 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 18:03:38,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:03:38,358 INFO L85 PathProgramCache]: Analyzing trace with hash 417817701, now seen corresponding path program 3 times [2023-08-30 18:03:38,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:03:38,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167445070] [2023-08-30 18:03:38,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:03:38,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:03:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:03:38,764 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:03:38,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:03:38,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167445070] [2023-08-30 18:03:38,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167445070] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:03:38,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581664028] [2023-08-30 18:03:38,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 18:03:38,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:03:38,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:03:38,766 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 18:03:38,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-08-30 18:03:38,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 18:03:38,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:03:38,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 45 conjunts are in the unsatisfiable core [2023-08-30 18:03:38,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:03:38,953 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 7 treesize of output 6 [2023-08-30 18:03:39,020 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:03:39,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 18:03:39,044 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 13 treesize of output 15 [2023-08-30 18:03:39,196 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 24 treesize of output 17 [2023-08-30 18:03:39,256 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 28 treesize of output 28 [2023-08-30 18:03:39,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-08-30 18:03:39,343 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:03:39,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:03:55,378 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post39#1|))) |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:03:57,387 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post39#1|))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:03:57,397 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1956 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1956))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post39#1|)))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:03:57,401 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1956 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1956))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:03:57,409 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1956 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ |c_t_funThread1of2ForFork0_#t~mem35#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1956))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_#t~mem35#1|))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:03:57,414 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1956 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (let ((.cse1 (select .cse2 |t_funThread1of2ForFork0_~p~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse2 |t_funThread1of2ForFork0_~p~0#1.offset| (+ .cse1 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1956))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset| .cse1))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:04:13,713 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1953 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1953))) (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (let ((.cse2 (select .cse1 |t_funThread1of2ForFork0_~p~0#1.offset|))) (store (select (store (store .cse0 |c_~#a~0.base| (store .cse1 |t_funThread1of2ForFork0_~p~0#1.offset| (+ .cse2 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1956) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset| .cse2)))) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:04:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-30 18:04:13,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581664028] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:04:13,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:04:13,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 27 [2023-08-30 18:04:13,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132680766] [2023-08-30 18:04:13,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:04:13,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-30 18:04:13,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:04:13,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-30 18:04:13,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=378, Unknown=26, NotChecked=322, Total=812 [2023-08-30 18:04:13,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 476 [2023-08-30 18:04:13,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 126 transitions, 962 flow. Second operand has 29 states, 29 states have (on average 168.10344827586206) internal successors, (4875), 29 states have internal predecessors, (4875), 0 states have call successors, (0), 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 18:04:13,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:04:13,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 476 [2023-08-30 18:04:13,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:04:22,147 WARN L222 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 36 DAG size of output: 32 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:04:32,671 WARN L222 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 34 DAG size of output: 31 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:04:35,121 INFO L130 PetriNetUnfolder]: 765/1860 cut-off events. [2023-08-30 18:04:35,121 INFO L131 PetriNetUnfolder]: For 6522/6575 co-relation queries the response was YES. [2023-08-30 18:04:35,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7508 conditions, 1860 events. 765/1860 cut-off events. For 6522/6575 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 13958 event pairs, 156 based on Foata normal form. 19/1695 useless extension candidates. Maximal degree in co-relation 7427. Up to 742 conditions per place. [2023-08-30 18:04:35,132 INFO L137 encePairwiseOnDemand]: 461/476 looper letters, 151 selfloop transitions, 22 changer transitions 52/234 dead transitions. [2023-08-30 18:04:35,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 234 transitions, 2159 flow [2023-08-30 18:04:35,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-30 18:04:35,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-30 18:04:35,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2939 transitions. [2023-08-30 18:04:35,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36319822046465644 [2023-08-30 18:04:35,135 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2939 transitions. [2023-08-30 18:04:35,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2939 transitions. [2023-08-30 18:04:35,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:04:35,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2939 transitions. [2023-08-30 18:04:35,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 172.88235294117646) internal successors, (2939), 17 states have internal predecessors, (2939), 0 states have call successors, (0), 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 18:04:35,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 476.0) internal successors, (8568), 18 states have internal predecessors, (8568), 0 states have call successors, (0), 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 18:04:35,144 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 476.0) internal successors, (8568), 18 states have internal predecessors, (8568), 0 states have call successors, (0), 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 18:04:35,144 INFO L175 Difference]: Start difference. First operand has 164 places, 126 transitions, 962 flow. Second operand 17 states and 2939 transitions. [2023-08-30 18:04:35,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 234 transitions, 2159 flow [2023-08-30 18:04:35,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 234 transitions, 2083 flow, removed 4 selfloop flow, removed 13 redundant places. [2023-08-30 18:04:35,170 INFO L231 Difference]: Finished difference. Result has 169 places, 138 transitions, 1124 flow [2023-08-30 18:04:35,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1124, PETRI_PLACES=169, PETRI_TRANSITIONS=138} [2023-08-30 18:04:35,172 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 101 predicate places. [2023-08-30 18:04:35,172 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 138 transitions, 1124 flow [2023-08-30 18:04:35,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 168.10344827586206) internal successors, (4875), 29 states have internal predecessors, (4875), 0 states have call successors, (0), 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 18:04:35,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:04:35,173 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 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 18:04:35,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-08-30 18:04:35,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:04:35,380 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 18:04:35,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:04:35,381 INFO L85 PathProgramCache]: Analyzing trace with hash 803035335, now seen corresponding path program 4 times [2023-08-30 18:04:35,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:04:35,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840718999] [2023-08-30 18:04:35,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:04:35,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:04:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:04:36,093 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:04:36,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:04:36,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840718999] [2023-08-30 18:04:36,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840718999] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:04:36,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573594354] [2023-08-30 18:04:36,094 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 18:04:36,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:04:36,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:04:36,095 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 18:04:36,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-08-30 18:04:36,289 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 18:04:36,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:04:36,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 18:04:36,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:04:36,298 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 7 treesize of output 6 [2023-08-30 18:04:36,384 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:04:36,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 18:04:36,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 18:04:36,529 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 24 treesize of output 17 [2023-08-30 18:04:36,593 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 23 [2023-08-30 18:04:36,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-08-30 18:04:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:04:36,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:04:50,796 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post39#1|))) |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:04:52,817 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:04:54,828 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:04:55,105 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2054 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2054))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:04:55,126 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2054 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ |c_t_funThread1of2ForFork0_#t~mem35#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2054))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:04:57,682 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2054 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse2 |t_funThread1of2ForFork0_~p~0#1.offset| (+ (select .cse2 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2054))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse1 |t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |t_funThread1of2ForFork0_~p~0#1.offset|)))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:05:06,137 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2054 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2051 (Array Int Int))) (= (select (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2051))) (store .cse1 |c_~#a~0.base| (let ((.cse2 (select .cse1 |c_~#a~0.base|))) (store .cse2 |t_funThread1of2ForFork0_~p~0#1.offset| (+ (select .cse2 |t_funThread1of2ForFork0_~p~0#1.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2054) |c_~#a~0.base|))) (store .cse0 |t_funThread1of2ForFork0_~p~0#1.offset| (+ (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|) (- 1)))) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:05:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-30 18:05:06,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573594354] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:05:06,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:05:06,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 26 [2023-08-30 18:05:06,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203538804] [2023-08-30 18:05:06,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:05:06,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-30 18:05:06,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:05:06,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-30 18:05:06,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=353, Unknown=22, NotChecked=308, Total=756 [2023-08-30 18:05:06,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-08-30 18:05:06,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 138 transitions, 1124 flow. Second operand has 28 states, 28 states have (on average 149.35714285714286) internal successors, (4182), 28 states have internal predecessors, (4182), 0 states have call successors, (0), 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 18:05:06,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:05:06,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-08-30 18:05:06,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:05:53,346 WARN L222 SmtUtils]: Spent 46.21s on a formula simplification. DAG size of input: 62 DAG size of output: 42 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:05:55,350 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 18:05:57,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:05:59,434 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 18:06:01,442 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 18:06:03,456 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 18:06:05,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:07,602 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 18:06:09,616 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 18:06:11,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:13,640 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 18:06:15,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:17,759 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 18:06:19,765 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 18:06:21,770 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 18:06:24,942 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 18:06:26,950 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 18:06:29,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:31,164 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 18:06:33,364 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 18:06:35,784 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 18:06:37,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:39,983 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 18:06:42,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:44,185 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 18:06:46,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:48,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:50,324 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 18:06:52,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:54,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:56,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:58,870 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 18:07:00,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 18:07:02,944 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 18:07:05,139 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 18:07:07,350 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 18:07:09,360 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 18:07:11,482 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 18:07:14,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:07:16,266 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 18:07:18,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:07:20,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:07:22,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:07:54,818 WARN L222 SmtUtils]: Spent 30.52s on a formula simplification. DAG size of input: 50 DAG size of output: 36 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:07:57,176 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 18:07:59,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:08:01,183 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 18:08:03,196 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 18:08:05,201 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 18:08:07,203 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 18:08:09,205 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 18:08:11,207 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 18:08:13,211 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 18:08:15,222 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 18:08:17,233 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 18:08:19,541 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 18:08:21,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 18:08:23,554 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 18:08:26,039 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 18:08:28,349 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 18:08:30,353 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 18:08:32,356 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 18:08:34,357 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 18:08:36,368 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 18:08:38,370 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 18:08:40,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:08:42,383 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 18:08:44,386 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 18:08:46,389 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 18:08:48,396 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 18:08:50,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 18:08:52,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:08:54,870 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 18:08:56,874 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 18:08:58,881 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 18:09:00,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:09:02,891 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 18:09:04,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:09:06,902 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 18:09:08,905 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 18:09:10,915 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 18:09:12,919 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 18:09:14,921 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 18:09:17,026 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 18:09:19,073 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 18:09:21,316 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 18:09:23,561 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 18:09:25,572 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 18:09:27,582 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 18:09:29,589 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 18:09:31,593 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 18:09:33,595 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 18:09:35,602 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 18:09:37,606 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 18:09:39,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:09:41,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 18:09:43,682 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 18:09:46,104 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 18:09:48,113 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 18:09:50,118 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 18:09:52,120 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 18:09:54,124 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 18:09:56,132 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 18:09:58,138 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 18:10:00,140 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 18:10:02,146 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 18:10:04,153 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 18:10:06,162 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 18:10:08,279 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 18:10:10,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 18:10:12,289 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 18:10:15,066 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 18:10:17,224 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 18:10:19,226 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 18:10:21,238 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 18:10:23,248 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 18:10:25,259 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 18:10:27,265 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 18:10:29,267 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 18:10:31,275 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 18:10:33,279 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 18:10:35,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 18:10:43,840 WARN L222 SmtUtils]: Spent 6.87s on a formula simplification. DAG size of input: 56 DAG size of output: 45 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:10:48,312 INFO L130 PetriNetUnfolder]: 866/2011 cut-off events. [2023-08-30 18:10:48,312 INFO L131 PetriNetUnfolder]: For 8994/9038 co-relation queries the response was YES. [2023-08-30 18:10:48,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8940 conditions, 2011 events. 866/2011 cut-off events. For 8994/9038 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 14584 event pairs, 89 based on Foata normal form. 24/1937 useless extension candidates. Maximal degree in co-relation 8867. Up to 655 conditions per place. [2023-08-30 18:10:48,324 INFO L137 encePairwiseOnDemand]: 459/476 looper letters, 115 selfloop transitions, 25 changer transitions 93/239 dead transitions. [2023-08-30 18:10:48,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 239 transitions, 2343 flow [2023-08-30 18:10:48,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-30 18:10:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-30 18:10:48,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2779 transitions. [2023-08-30 18:10:48,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3243464052287582 [2023-08-30 18:10:48,326 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2779 transitions. [2023-08-30 18:10:48,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2779 transitions. [2023-08-30 18:10:48,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:10:48,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2779 transitions. [2023-08-30 18:10:48,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 154.38888888888889) internal successors, (2779), 18 states have internal predecessors, (2779), 0 states have call successors, (0), 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 18:10:48,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 476.0) internal successors, (9044), 19 states have internal predecessors, (9044), 0 states have call successors, (0), 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 18:10:48,336 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 476.0) internal successors, (9044), 19 states have internal predecessors, (9044), 0 states have call successors, (0), 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 18:10:48,336 INFO L175 Difference]: Start difference. First operand has 169 places, 138 transitions, 1124 flow. Second operand 18 states and 2779 transitions. [2023-08-30 18:10:48,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 239 transitions, 2343 flow [2023-08-30 18:10:48,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 239 transitions, 2296 flow, removed 16 selfloop flow, removed 8 redundant places. [2023-08-30 18:10:48,368 INFO L231 Difference]: Finished difference. Result has 181 places, 121 transitions, 1027 flow [2023-08-30 18:10:48,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1090, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1027, PETRI_PLACES=181, PETRI_TRANSITIONS=121} [2023-08-30 18:10:48,370 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 113 predicate places. [2023-08-30 18:10:48,370 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 121 transitions, 1027 flow [2023-08-30 18:10:48,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 149.35714285714286) internal successors, (4182), 28 states have internal predecessors, (4182), 0 states have call successors, (0), 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 18:10:48,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:10:48,371 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:10:48,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-08-30 18:10:48,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:10:48,577 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 18:10:48,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:10:48,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1293684274, now seen corresponding path program 1 times [2023-08-30 18:10:48,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:10:48,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040826718] [2023-08-30 18:10:48,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:10:48,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:10:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:10:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:10:50,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:10:50,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040826718] [2023-08-30 18:10:50,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040826718] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:10:50,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210984532] [2023-08-30 18:10:50,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:10:50,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:10:50,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:10:50,578 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 18:10:50,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-08-30 18:10:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:10:50,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 18:10:50,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:10:50,785 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 7 treesize of output 6 [2023-08-30 18:10:51,606 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:10:51,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 18:10:51,914 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 13 treesize of output 15 [2023-08-30 18:10:52,224 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 13 treesize of output 15 [2023-08-30 18:10:53,320 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 24 treesize of output 17 [2023-08-30 18:10:54,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-08-30 18:10:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:10:54,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:11:18,049 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2153 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2153) |c_~#a~0.base|))) is different from false [2023-08-30 18:11:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-30 18:11:18,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210984532] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:11:18,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:11:18,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 21 [2023-08-30 18:11:18,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436974664] [2023-08-30 18:11:18,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:11:18,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 18:11:18,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:11:18,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 18:11:18,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=380, Unknown=10, NotChecked=40, Total=506 [2023-08-30 18:11:21,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 476 [2023-08-30 18:11:21,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 121 transitions, 1027 flow. Second operand has 23 states, 23 states have (on average 168.6086956521739) internal successors, (3878), 23 states have internal predecessors, (3878), 0 states have call successors, (0), 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 18:11:21,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:11:21,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 476 [2023-08-30 18:11:21,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:11:29,820 INFO L130 PetriNetUnfolder]: 411/1083 cut-off events. [2023-08-30 18:11:29,820 INFO L131 PetriNetUnfolder]: For 6764/6803 co-relation queries the response was YES. [2023-08-30 18:11:29,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5194 conditions, 1083 events. 411/1083 cut-off events. For 6764/6803 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7197 event pairs, 33 based on Foata normal form. 30/1113 useless extension candidates. Maximal degree in co-relation 5111. Up to 268 conditions per place. [2023-08-30 18:11:29,826 INFO L137 encePairwiseOnDemand]: 463/476 looper letters, 97 selfloop transitions, 49 changer transitions 20/175 dead transitions. [2023-08-30 18:11:29,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 175 transitions, 1780 flow [2023-08-30 18:11:29,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-30 18:11:29,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-30 18:11:29,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2762 transitions. [2023-08-30 18:11:29,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3626575630252101 [2023-08-30 18:11:29,829 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2762 transitions. [2023-08-30 18:11:29,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2762 transitions. [2023-08-30 18:11:29,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:11:29,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2762 transitions. [2023-08-30 18:11:29,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 172.625) internal successors, (2762), 16 states have internal predecessors, (2762), 0 states have call successors, (0), 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 18:11:29,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 476.0) internal successors, (8092), 17 states have internal predecessors, (8092), 0 states have call successors, (0), 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 18:11:29,836 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 476.0) internal successors, (8092), 17 states have internal predecessors, (8092), 0 states have call successors, (0), 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 18:11:29,836 INFO L175 Difference]: Start difference. First operand has 181 places, 121 transitions, 1027 flow. Second operand 16 states and 2762 transitions. [2023-08-30 18:11:29,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 175 transitions, 1780 flow [2023-08-30 18:11:29,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 175 transitions, 1639 flow, removed 33 selfloop flow, removed 32 redundant places. [2023-08-30 18:11:29,849 INFO L231 Difference]: Finished difference. Result has 158 places, 126 transitions, 1076 flow [2023-08-30 18:11:29,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1076, PETRI_PLACES=158, PETRI_TRANSITIONS=126} [2023-08-30 18:11:29,850 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 90 predicate places. [2023-08-30 18:11:29,850 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 126 transitions, 1076 flow [2023-08-30 18:11:29,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 168.6086956521739) internal successors, (3878), 23 states have internal predecessors, (3878), 0 states have call successors, (0), 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 18:11:29,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:11:29,850 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:11:29,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-08-30 18:11:30,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-08-30 18:11:30,051 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 18:11:30,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:11:30,051 INFO L85 PathProgramCache]: Analyzing trace with hash -945165454, now seen corresponding path program 2 times [2023-08-30 18:11:30,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:11:30,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307001114] [2023-08-30 18:11:30,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:11:30,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:11:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:11:32,145 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:11:32,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:11:32,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307001114] [2023-08-30 18:11:32,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307001114] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:11:32,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327358021] [2023-08-30 18:11:32,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 18:11:32,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:11:32,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:11:32,146 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 18:11:32,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-08-30 18:11:32,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 18:11:32,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:11:32,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 44 conjunts are in the unsatisfiable core [2023-08-30 18:11:32,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:11:32,350 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 7 treesize of output 6 [2023-08-30 18:11:33,225 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:11:33,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 18:11:33,496 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 13 treesize of output 15 [2023-08-30 18:11:33,745 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 13 treesize of output 15 [2023-08-30 18:11:35,333 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 24 treesize of output 17 [2023-08-30 18:11:36,258 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 28 treesize of output 28 [2023-08-30 18:11:36,645 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 29 treesize of output 24 [2023-08-30 18:11:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:11:36,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:11:45,382 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~mem38#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:11:45,429 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2257 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2257))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~mem38#1|)))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:11:47,462 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2257 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2257))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) (select (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:11:47,544 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2257 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ |c_t_funThread2of2ForFork0_#t~mem35#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2257))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread2of2ForFork0_#t~mem35#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:11:47,591 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2257 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse2 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (let ((.cse1 (select .cse2 |t_funThread2of2ForFork0_~p~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse2 |t_funThread2of2ForFork0_~p~0#1.offset| (+ .cse1 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2257))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset| .cse1))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:11:47,698 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2257 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse2 (select |c_#memory_int| |c_~#a~0.base|))) (let ((.cse1 (select .cse2 |t_funThread2of2ForFork0_~p~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_~#a~0.base| (store .cse2 |t_funThread2of2ForFork0_~p~0#1.offset| (+ .cse1 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2257))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| .cse1))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:11:47,818 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2257 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (let ((.cse1 (select .cse0 |t_funThread2of2ForFork0_~p~0#1.offset|))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |t_funThread2of2ForFork0_~p~0#1.offset| (+ .cse1 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2257) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| .cse1))) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:11:49,860 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2257 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= 0 (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2254))) (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (let ((.cse2 (select .cse1 |t_funThread2of2ForFork0_~p~0#1.offset|))) (store (select (store (store .cse0 |c_~#a~0.base| (store .cse1 |t_funThread2of2ForFork0_~p~0#1.offset| (+ .cse2 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2257) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| .cse2)))) |t_funThread1of2ForFork0_~p~0#1.offset|))) is different from false [2023-08-30 18:11:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-30 18:11:50,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327358021] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:11:50,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:11:50,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 26 [2023-08-30 18:11:50,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404139024] [2023-08-30 18:11:50,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:11:50,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-30 18:11:50,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:11:50,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-30 18:11:50,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=322, Unknown=10, NotChecked=344, Total=756 [2023-08-30 18:11:50,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-08-30 18:11:50,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 126 transitions, 1076 flow. Second operand has 28 states, 28 states have (on average 149.5) internal successors, (4186), 28 states have internal predecessors, (4186), 0 states have call successors, (0), 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 18:11:50,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:11:50,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-08-30 18:11:50,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:12:23,242 WARN L222 SmtUtils]: Spent 31.62s on a formula simplification. DAG size of input: 47 DAG size of output: 36 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:12:25,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:12:27,271 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 18:12:29,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15