./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_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_73-funloop_hard_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 c8af2e9e80aefb6a93651d6c869df13510f679bd9566c8571973545c9393aab5 --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:57:18,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 17:57:18,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 17:57:18,134 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 17:57:18,135 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 17:57:18,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 17:57:18,141 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 17:57:18,143 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 17:57:18,145 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 17:57:18,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 17:57:18,149 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 17:57:18,151 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 17:57:18,151 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 17:57:18,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 17:57:18,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 17:57:18,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 17:57:18,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 17:57:18,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 17:57:18,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 17:57:18,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 17:57:18,166 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 17:57:18,167 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 17:57:18,167 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 17:57:18,168 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 17:57:18,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 17:57:18,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 17:57:18,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 17:57:18,175 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 17:57:18,175 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 17:57:18,176 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 17:57:18,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 17:57:18,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 17:57:18,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 17:57:18,180 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 17:57:18,180 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 17:57:18,180 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 17:57:18,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 17:57:18,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 17:57:18,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 17:57:18,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 17:57:18,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 17:57:18,184 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:57:18,214 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 17:57:18,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 17:57:18,216 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 17:57:18,216 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 17:57:18,216 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 17:57:18,217 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 17:57:18,217 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 17:57:18,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 17:57:18,217 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 17:57:18,217 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 17:57:18,218 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 17:57:18,218 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 17:57:18,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 17:57:18,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 17:57:18,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 17:57:18,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 17:57:18,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 17:57:18,219 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 17:57:18,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 17:57:18,219 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 17:57:18,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 17:57:18,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 17:57:18,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 17:57:18,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 17:57:18,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 17:57:18,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 17:57:18,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 17:57:18,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 17:57:18,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 17:57:18,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 17:57:18,221 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 17:57:18,221 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 17:57:18,222 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 17:57:18,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 17:57:18,222 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 17:57:18,222 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 -> c8af2e9e80aefb6a93651d6c869df13510f679bd9566c8571973545c9393aab5 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:57:18,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 17:57:18,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 17:57:18,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 17:57:18,481 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 17:57:18,482 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 17:57:18,483 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2023-08-30 17:57:19,559 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 17:57:19,759 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 17:57:19,759 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2023-08-30 17:57:19,771 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10728e1d0/205c374fef37469f8c47f06c45f88c65/FLAGb751bf7a0 [2023-08-30 17:57:19,783 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10728e1d0/205c374fef37469f8c47f06c45f88c65 [2023-08-30 17:57:19,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 17:57:19,793 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 17:57:19,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 17:57:19,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 17:57:19,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 17:57:19,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:57:19" (1/1) ... [2023-08-30 17:57:19,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aeca7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:19, skipping insertion in model container [2023-08-30 17:57:19,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:57:19" (1/1) ... [2023-08-30 17:57:19,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 17:57:19,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 17:57:20,101 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_73-funloop_hard_racefree.i[41323,41336] [2023-08-30 17:57:20,132 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 17:57:20,154 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 17:57:20,186 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_73-funloop_hard_racefree.i[41323,41336] [2023-08-30 17:57:20,192 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 17:57:20,253 INFO L208 MainTranslator]: Completed translation [2023-08-30 17:57:20,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:20 WrapperNode [2023-08-30 17:57:20,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 17:57:20,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 17:57:20,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 17:57:20,254 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 17:57:20,259 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:57:20" (1/1) ... [2023-08-30 17:57:20,286 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:57:20" (1/1) ... [2023-08-30 17:57:20,318 INFO L138 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 250 [2023-08-30 17:57:20,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 17:57:20,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 17:57:20,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 17:57:20,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 17:57:20,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:20" (1/1) ... [2023-08-30 17:57:20,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:20" (1/1) ... [2023-08-30 17:57:20,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:20" (1/1) ... [2023-08-30 17:57:20,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:20" (1/1) ... [2023-08-30 17:57:20,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:20" (1/1) ... [2023-08-30 17:57:20,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:20" (1/1) ... [2023-08-30 17:57:20,365 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:20" (1/1) ... [2023-08-30 17:57:20,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:20" (1/1) ... [2023-08-30 17:57:20,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 17:57:20,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 17:57:20,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 17:57:20,370 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 17:57:20,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:20" (1/1) ... [2023-08-30 17:57:20,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 17:57:20,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:57:20,451 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:57:20,464 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:57:20,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 17:57:20,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 17:57:20,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 17:57:20,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 17:57:20,493 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 17:57:20,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 17:57:20,493 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-30 17:57:20,493 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-30 17:57:20,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 17:57:20,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 17:57:20,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 17:57:20,495 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:57:20,681 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 17:57:20,683 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 17:57:20,984 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 17:57:20,990 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 17:57:20,990 INFO L302 CfgBuilder]: Removed 35 assume(true) statements. [2023-08-30 17:57:20,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:57:20 BoogieIcfgContainer [2023-08-30 17:57:20,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 17:57:20,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 17:57:20,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 17:57:20,996 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 17:57:20,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 05:57:19" (1/3) ... [2023-08-30 17:57:20,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10848abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:57:20, skipping insertion in model container [2023-08-30 17:57:20,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:57:20" (2/3) ... [2023-08-30 17:57:20,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10848abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:57:20, skipping insertion in model container [2023-08-30 17:57:20,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:57:20" (3/3) ... [2023-08-30 17:57:20,998 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2023-08-30 17:57:21,004 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 17:57:21,011 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 17:57:21,011 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-08-30 17:57:21,011 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 17:57:21,069 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-30 17:57:21,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 246 transitions, 500 flow [2023-08-30 17:57:21,201 INFO L130 PetriNetUnfolder]: 73/381 cut-off events. [2023-08-30 17:57:21,201 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 17:57:21,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 381 events. 73/381 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1706 event pairs, 0 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 209. Up to 8 conditions per place. [2023-08-30 17:57:21,207 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 246 transitions, 500 flow [2023-08-30 17:57:21,211 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 241 transitions, 487 flow [2023-08-30 17:57:21,213 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 17:57:21,219 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 241 transitions, 487 flow [2023-08-30 17:57:21,221 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 241 transitions, 487 flow [2023-08-30 17:57:21,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 241 transitions, 487 flow [2023-08-30 17:57:21,250 INFO L130 PetriNetUnfolder]: 72/376 cut-off events. [2023-08-30 17:57:21,250 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:57:21,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 376 events. 72/376 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1659 event pairs, 0 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 209. Up to 8 conditions per place. [2023-08-30 17:57:21,258 INFO L119 LiptonReduction]: Number of co-enabled transitions 19458 [2023-08-30 17:57:23,479 INFO L134 LiptonReduction]: Checked pairs total: 28650 [2023-08-30 17:57:23,480 INFO L136 LiptonReduction]: Total number of compositions: 184 [2023-08-30 17:57:23,519 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 17:57:23,534 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;@608e8dec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 17:57:23,547 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-30 17:57:23,556 INFO L130 PetriNetUnfolder]: 9/35 cut-off events. [2023-08-30 17:57:23,556 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:57:23,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:57:23,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:57:23,558 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 17:57:23,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:57:23,561 INFO L85 PathProgramCache]: Analyzing trace with hash -454048497, now seen corresponding path program 1 times [2023-08-30 17:57:23,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:57:23,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688419792] [2023-08-30 17:57:23,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:57:23,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:57:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:57:23,757 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:57:23,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:57:23,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688419792] [2023-08-30 17:57:23,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688419792] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 17:57:23,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 17:57:23,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 17:57:23,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556907689] [2023-08-30 17:57:23,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 17:57:23,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 17:57:23,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:57:23,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 17:57:23,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 17:57:23,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 430 [2023-08-30 17:57:23,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 96 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have 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:57:23,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:57:23,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 430 [2023-08-30 17:57:23,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:57:23,993 INFO L130 PetriNetUnfolder]: 579/1212 cut-off events. [2023-08-30 17:57:23,993 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:57:23,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2278 conditions, 1212 events. 579/1212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6864 event pairs, 465 based on Foata normal form. 213/1209 useless extension candidates. Maximal degree in co-relation 2191. Up to 1060 conditions per place. [2023-08-30 17:57:24,001 INFO L137 encePairwiseOnDemand]: 396/430 looper letters, 51 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-30 17:57:24,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 243 flow [2023-08-30 17:57:24,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 17:57:24,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 17:57:24,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2023-08-30 17:57:24,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5286821705426357 [2023-08-30 17:57:24,019 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 682 transitions. [2023-08-30 17:57:24,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 682 transitions. [2023-08-30 17:57:24,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:57:24,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 682 transitions. [2023-08-30 17:57:24,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have 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:57:24,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have 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:57:24,037 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have 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:57:24,039 INFO L175 Difference]: Start difference. First operand has 63 places, 96 transitions, 197 flow. Second operand 3 states and 682 transitions. [2023-08-30 17:57:24,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 243 flow [2023-08-30 17:57:24,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 243 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 17:57:24,043 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 147 flow [2023-08-30 17:57:24,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2023-08-30 17:57:24,047 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2023-08-30 17:57:24,047 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 147 flow [2023-08-30 17:57:24,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have 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:57:24,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:57:24,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:57:24,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 17:57:24,048 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 17:57:24,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:57:24,049 INFO L85 PathProgramCache]: Analyzing trace with hash 573264157, now seen corresponding path program 1 times [2023-08-30 17:57:24,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:57:24,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083799681] [2023-08-30 17:57:24,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:57:24,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:57:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:57:24,095 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:57:24,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:57:24,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083799681] [2023-08-30 17:57:24,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083799681] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 17:57:24,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 17:57:24,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 17:57:24,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230285515] [2023-08-30 17:57:24,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 17:57:24,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 17:57:24,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:57:24,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 17:57:24,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 17:57:24,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 430 [2023-08-30 17:57:24,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have 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:57:24,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:57:24,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 430 [2023-08-30 17:57:24,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:57:24,233 INFO L130 PetriNetUnfolder]: 547/1178 cut-off events. [2023-08-30 17:57:24,233 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:57:24,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2236 conditions, 1178 events. 547/1178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7289 event pairs, 0 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 2224. Up to 1012 conditions per place. [2023-08-30 17:57:24,237 INFO L137 encePairwiseOnDemand]: 427/430 looper letters, 68 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-08-30 17:57:24,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 83 transitions, 321 flow [2023-08-30 17:57:24,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 17:57:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 17:57:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2023-08-30 17:57:24,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170542635658915 [2023-08-30 17:57:24,239 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 667 transitions. [2023-08-30 17:57:24,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 667 transitions. [2023-08-30 17:57:24,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:57:24,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 667 transitions. [2023-08-30 17:57:24,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have 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:57:24,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have 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:57:24,244 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have 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:57:24,244 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 147 flow. Second operand 3 states and 667 transitions. [2023-08-30 17:57:24,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 83 transitions, 321 flow [2023-08-30 17:57:24,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 83 transitions, 317 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 17:57:24,246 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 151 flow [2023-08-30 17:57:24,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2023-08-30 17:57:24,247 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 4 predicate places. [2023-08-30 17:57:24,247 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 151 flow [2023-08-30 17:57:24,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have 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:57:24,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:57:24,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:57:24,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 17:57:24,248 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 17:57:24,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:57:24,249 INFO L85 PathProgramCache]: Analyzing trace with hash -646993721, now seen corresponding path program 1 times [2023-08-30 17:57:24,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:57:24,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274905048] [2023-08-30 17:57:24,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:57:24,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:57:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:57:24,298 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:57:24,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:57:24,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274905048] [2023-08-30 17:57:24,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274905048] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:57:24,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039167186] [2023-08-30 17:57:24,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:57:24,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:57:24,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:57:24,301 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:57:24,361 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:57:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:57:24,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 17:57:24,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:57:24,447 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:57:24,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:57:24,466 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:57:24,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039167186] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:57:24,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:57:24,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 17:57:24,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494972693] [2023-08-30 17:57:24,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:57:24,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 17:57:24,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:57:24,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 17:57:24,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 17:57:24,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 430 [2023-08-30 17:57:24,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 151 flow. Second operand has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have 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:57:24,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:57:24,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 430 [2023-08-30 17:57:24,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:57:24,659 INFO L130 PetriNetUnfolder]: 576/1192 cut-off events. [2023-08-30 17:57:24,659 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2023-08-30 17:57:24,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2289 conditions, 1192 events. 576/1192 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6683 event pairs, 465 based on Foata normal form. 3/1005 useless extension candidates. Maximal degree in co-relation 2262. Up to 1030 conditions per place. [2023-08-30 17:57:24,663 INFO L137 encePairwiseOnDemand]: 427/430 looper letters, 51 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2023-08-30 17:57:24,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 69 transitions, 275 flow [2023-08-30 17:57:24,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 17:57:24,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 17:57:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1247 transitions. [2023-08-30 17:57:24,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2023-08-30 17:57:24,666 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1247 transitions. [2023-08-30 17:57:24,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1247 transitions. [2023-08-30 17:57:24,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:57:24,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1247 transitions. [2023-08-30 17:57:24,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 207.83333333333334) internal successors, (1247), 6 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have 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:57:24,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 430.0) internal successors, (3010), 7 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have 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:57:24,674 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 430.0) internal successors, (3010), 7 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have 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:57:24,674 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 151 flow. Second operand 6 states and 1247 transitions. [2023-08-30 17:57:24,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 69 transitions, 275 flow [2023-08-30 17:57:24,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 17:57:24,676 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 183 flow [2023-08-30 17:57:24,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=65, 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=6, PETRI_FLOW=183, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2023-08-30 17:57:24,676 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 10 predicate places. [2023-08-30 17:57:24,677 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 183 flow [2023-08-30 17:57:24,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have 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:57:24,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:57:24,678 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:57:24,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-30 17:57:24,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:57:24,883 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 17:57:24,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:57:24,884 INFO L85 PathProgramCache]: Analyzing trace with hash -254815792, now seen corresponding path program 2 times [2023-08-30 17:57:24,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:57:24,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98228465] [2023-08-30 17:57:24,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:57:24,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:57:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:57:24,971 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:57:24,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:57:24,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98228465] [2023-08-30 17:57:24,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98228465] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:57:24,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381109265] [2023-08-30 17:57:24,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 17:57:24,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:57:24,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:57:24,989 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:57:24,990 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:57:25,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 17:57:25,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 17:57:25,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-30 17:57:25,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:57:25,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 17:57:25,125 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 17:57:25,126 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:57:25,142 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:57:25,171 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:57:25,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 17:57:25,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381109265] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 17:57:25,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 17:57:25,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-30 17:57:25,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723653260] [2023-08-30 17:57:25,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 17:57:25,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 17:57:25,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:57:25,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 17:57:25,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-30 17:57:25,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 430 [2023-08-30 17:57:25,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 189.5) internal successors, (1137), 6 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have 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:57:25,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:57:25,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 430 [2023-08-30 17:57:25,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:57:25,535 INFO L130 PetriNetUnfolder]: 814/1702 cut-off events. [2023-08-30 17:57:25,535 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2023-08-30 17:57:25,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3301 conditions, 1702 events. 814/1702 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 10255 event pairs, 106 based on Foata normal form. 0/1427 useless extension candidates. Maximal degree in co-relation 3266. Up to 1029 conditions per place. [2023-08-30 17:57:25,541 INFO L137 encePairwiseOnDemand]: 422/430 looper letters, 105 selfloop transitions, 8 changer transitions 0/126 dead transitions. [2023-08-30 17:57:25,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 126 transitions, 529 flow [2023-08-30 17:57:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 17:57:25,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 17:57:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1052 transitions. [2023-08-30 17:57:25,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48930232558139536 [2023-08-30 17:57:25,543 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1052 transitions. [2023-08-30 17:57:25,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1052 transitions. [2023-08-30 17:57:25,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:57:25,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1052 transitions. [2023-08-30 17:57:25,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 210.4) internal successors, (1052), 5 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have 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:57:25,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 430.0) internal successors, (2580), 6 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:57:25,549 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 430.0) internal successors, (2580), 6 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:57:25,549 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 183 flow. Second operand 5 states and 1052 transitions. [2023-08-30 17:57:25,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 126 transitions, 529 flow [2023-08-30 17:57:25,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 126 transitions, 515 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 17:57:25,554 INFO L231 Difference]: Finished difference. Result has 78 places, 75 transitions, 219 flow [2023-08-30 17:57:25,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=78, PETRI_TRANSITIONS=75} [2023-08-30 17:57:25,556 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 15 predicate places. [2023-08-30 17:57:25,556 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 75 transitions, 219 flow [2023-08-30 17:57:25,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.5) internal successors, (1137), 6 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have 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:57:25,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:57:25,557 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:57:25,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-30 17:57:25,761 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,SelfDestructingSolverStorable3 [2023-08-30 17:57:25,764 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 17:57:25,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:57:25,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1650306531, now seen corresponding path program 1 times [2023-08-30 17:57:25,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:57:25,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533387494] [2023-08-30 17:57:25,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:57:25,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:57:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:57:25,808 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:57:25,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:57:25,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533387494] [2023-08-30 17:57:25,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533387494] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:57:25,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242241414] [2023-08-30 17:57:25,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:57:25,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:57:25,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:57:25,810 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:57:25,812 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:57:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:57:25,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 17:57:25,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:57:25,906 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:57:25,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:57:25,948 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:57:25,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242241414] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:57:25,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:57:25,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-30 17:57:25,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368956064] [2023-08-30 17:57:25,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:57:25,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 17:57:25,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:57:25,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 17:57:25,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-30 17:57:25,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 430 [2023-08-30 17:57:25,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 75 transitions, 219 flow. Second operand has 14 states, 14 states have (on average 196.92857142857142) internal successors, (2757), 14 states have internal predecessors, (2757), 0 states have call successors, (0), 0 states have 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:57:25,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:57:25,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 430 [2023-08-30 17:57:25,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:57:26,053 INFO L130 PetriNetUnfolder]: 61/186 cut-off events. [2023-08-30 17:57:26,053 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2023-08-30 17:57:26,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 186 events. 61/186 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 643 event pairs, 1 based on Foata normal form. 33/213 useless extension candidates. Maximal degree in co-relation 399. Up to 111 conditions per place. [2023-08-30 17:57:26,054 INFO L137 encePairwiseOnDemand]: 425/430 looper letters, 38 selfloop transitions, 13 changer transitions 2/58 dead transitions. [2023-08-30 17:57:26,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 58 transitions, 306 flow [2023-08-30 17:57:26,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 17:57:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 17:57:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2786 transitions. [2023-08-30 17:57:26,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4627906976744186 [2023-08-30 17:57:26,059 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2786 transitions. [2023-08-30 17:57:26,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2786 transitions. [2023-08-30 17:57:26,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:57:26,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2786 transitions. [2023-08-30 17:57:26,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 199.0) internal successors, (2786), 14 states have internal predecessors, (2786), 0 states have call successors, (0), 0 states have 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:57:26,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 430.0) internal successors, (6450), 15 states have internal predecessors, (6450), 0 states have call successors, (0), 0 states have 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:57:26,072 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 430.0) internal successors, (6450), 15 states have internal predecessors, (6450), 0 states have call successors, (0), 0 states have 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:57:26,072 INFO L175 Difference]: Start difference. First operand has 78 places, 75 transitions, 219 flow. Second operand 14 states and 2786 transitions. [2023-08-30 17:57:26,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 58 transitions, 306 flow [2023-08-30 17:57:26,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 299 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 17:57:26,075 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 169 flow [2023-08-30 17:57:26,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=169, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2023-08-30 17:57:26,078 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -10 predicate places. [2023-08-30 17:57:26,078 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 169 flow [2023-08-30 17:57:26,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 196.92857142857142) internal successors, (2757), 14 states have internal predecessors, (2757), 0 states have call successors, (0), 0 states have 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:57:26,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:57:26,080 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] [2023-08-30 17:57:26,101 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:57:26,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:57:26,286 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 17:57:26,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:57:26,286 INFO L85 PathProgramCache]: Analyzing trace with hash -630653115, now seen corresponding path program 1 times [2023-08-30 17:57:26,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:57:26,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111217127] [2023-08-30 17:57:26,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:57:26,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:57:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:57:27,053 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:57:27,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:57:27,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111217127] [2023-08-30 17:57:27,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111217127] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:57:27,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879824594] [2023-08-30 17:57:27,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:57:27,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:57:27,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:57:27,076 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:57:27,119 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:57:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:57:27,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-30 17:57:27,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:57:27,215 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:57:27,280 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 17:57:27,280 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:57:27,300 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:57:27,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-08-30 17:57:27,457 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 17:57:27,504 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:57:27,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:57:35,588 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int)) (= 0 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|))) is different from false [2023-08-30 17:57:37,595 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) 0)) is different from false [2023-08-30 17:57:39,612 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int)) (= 0 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|))) is different from false [2023-08-30 17:57:41,690 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_200 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_200) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-30 17:57:41,828 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:57:41,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879824594] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:57:41,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:57:41,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 23 [2023-08-30 17:57:41,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940181403] [2023-08-30 17:57:41,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:57:41,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-30 17:57:41,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:57:41,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-30 17:57:41,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=331, Unknown=6, NotChecked=164, Total=600 [2023-08-30 17:57:41,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 430 [2023-08-30 17:57:41,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 169 flow. Second operand has 25 states, 25 states have (on average 146.4) internal successors, (3660), 25 states have internal predecessors, (3660), 0 states have call successors, (0), 0 states have 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:57:41,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:57:41,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 430 [2023-08-30 17:57:41,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:57:48,176 WARN L222 SmtUtils]: Spent 6.06s on a formula simplification. DAG size of input: 52 DAG size of output: 39 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 17:57:54,225 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 48 DAG size of output: 35 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 17:58:14,331 WARN L222 SmtUtils]: Spent 20.04s on a formula simplification. DAG size of input: 45 DAG size of output: 26 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 17:58:16,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 17:58:18,379 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:58:20,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 17:58:22,385 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:58:24,399 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:58:26,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 [1] [2023-08-30 17:58:28,410 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:58:30,416 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:58:32,417 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:58:34,424 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:58:36,432 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:58:41,601 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:58:44,422 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:58:46,427 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:58:48,431 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:58:50,433 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:58:52,439 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:58:54,447 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:58:56,453 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:58:58,457 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:00,459 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:02,462 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:10,657 WARN L222 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 39 DAG size of output: 27 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 17:59:10,732 INFO L130 PetriNetUnfolder]: 60/193 cut-off events. [2023-08-30 17:59:10,732 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2023-08-30 17:59:10,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 193 events. 60/193 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 551 event pairs, 0 based on Foata normal form. 3/189 useless extension candidates. Maximal degree in co-relation 400. Up to 35 conditions per place. [2023-08-30 17:59:10,733 INFO L137 encePairwiseOnDemand]: 419/430 looper letters, 59 selfloop transitions, 28 changer transitions 4/95 dead transitions. [2023-08-30 17:59:10,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 95 transitions, 497 flow [2023-08-30 17:59:10,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-30 17:59:10,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-30 17:59:10,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2530 transitions. [2023-08-30 17:59:10,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34610123119015046 [2023-08-30 17:59:10,738 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2530 transitions. [2023-08-30 17:59:10,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2530 transitions. [2023-08-30 17:59:10,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:59:10,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2530 transitions. [2023-08-30 17:59:10,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 148.8235294117647) internal successors, (2530), 17 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have 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:10,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 430.0) internal successors, (7740), 18 states have internal predecessors, (7740), 0 states have call successors, (0), 0 states have 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:10,750 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 430.0) internal successors, (7740), 18 states have internal predecessors, (7740), 0 states have call successors, (0), 0 states have 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:10,750 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 169 flow. Second operand 17 states and 2530 transitions. [2023-08-30 17:59:10,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 95 transitions, 497 flow [2023-08-30 17:59:10,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 95 transitions, 423 flow, removed 24 selfloop flow, removed 10 redundant places. [2023-08-30 17:59:10,752 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 265 flow [2023-08-30 17:59:10,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=265, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2023-08-30 17:59:10,752 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -1 predicate places. [2023-08-30 17:59:10,753 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 265 flow [2023-08-30 17:59:10,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 146.4) internal successors, (3660), 25 states have internal predecessors, (3660), 0 states have call successors, (0), 0 states have 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:10,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:59:10,754 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:59:10,759 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:59:10,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:59:10,954 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 17:59:10,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:59:10,955 INFO L85 PathProgramCache]: Analyzing trace with hash 470240073, now seen corresponding path program 1 times [2023-08-30 17:59:10,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:59:10,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955401244] [2023-08-30 17:59:10,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:10,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:59:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 17:59:11,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:59:11,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955401244] [2023-08-30 17:59:11,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955401244] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:59:11,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3532220] [2023-08-30 17:59:11,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:11,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:59:11,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:59:11,994 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:59:11,996 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:59:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:12,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-30 17:59:12,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:59:12,108 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:12,184 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 17:59:12,184 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:12,213 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:12,328 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:12,383 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:12,422 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 17:59:15,612 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 17:59:15,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:59:31,671 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0))) is different from false [2023-08-30 17:59:33,706 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_304 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_304)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0))) is different from false [2023-08-30 17:59:35,731 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_304 Int)) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_303))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_304))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-30 17:59:35,781 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_302 Int) (v_ArrVal_303 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_304 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_302)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_303))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_304))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0))) is different from false [2023-08-30 17:59:35,833 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_302 Int) (v_ArrVal_303 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_304 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| 28)) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_302)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_303) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_304) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0))) is different from false [2023-08-30 17:59:35,856 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_302 Int) (v_ArrVal_303 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_304 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| 28)) (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_300))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_302))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_303) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_304) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0))) is different from false [2023-08-30 17:59:36,013 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-30 17:59:36,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3532220] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:59:36,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:59:36,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 26 [2023-08-30 17:59:36,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030925143] [2023-08-30 17:59:36,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:59:36,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-30 17:59:36,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:59:36,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-30 17:59:36,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=387, Unknown=16, NotChecked=270, Total=756 [2023-08-30 17:59:36,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 430 [2023-08-30 17:59:36,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 265 flow. Second operand has 28 states, 28 states have (on average 150.28571428571428) internal successors, (4208), 28 states have internal predecessors, (4208), 0 states have call successors, (0), 0 states have 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:36,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:59:36,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 430 [2023-08-30 17:59:36,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00:06,328 WARN L222 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 62 DAG size of output: 25 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:00:14,086 INFO L130 PetriNetUnfolder]: 134/391 cut-off events. [2023-08-30 18:00:14,087 INFO L131 PetriNetUnfolder]: For 250/250 co-relation queries the response was YES. [2023-08-30 18:00:14,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1136 conditions, 391 events. 134/391 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1407 event pairs, 0 based on Foata normal form. 2/380 useless extension candidates. Maximal degree in co-relation 1061. Up to 103 conditions per place. [2023-08-30 18:00:14,090 INFO L137 encePairwiseOnDemand]: 418/430 looper letters, 132 selfloop transitions, 56 changer transitions 0/192 dead transitions. [2023-08-30 18:00:14,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 192 transitions, 1159 flow [2023-08-30 18:00:14,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-30 18:00:14,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-30 18:00:14,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3236 transitions. [2023-08-30 18:00:14,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3583610188261351 [2023-08-30 18:00:14,098 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3236 transitions. [2023-08-30 18:00:14,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3236 transitions. [2023-08-30 18:00:14,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:14,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3236 transitions. [2023-08-30 18:00:14,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 154.0952380952381) internal successors, (3236), 21 states have internal predecessors, (3236), 0 states have call successors, (0), 0 states have 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,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 430.0) internal successors, (9460), 22 states have internal predecessors, (9460), 0 states have call successors, (0), 0 states have 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,144 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 430.0) internal successors, (9460), 22 states have internal predecessors, (9460), 0 states have call successors, (0), 0 states have 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,144 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 265 flow. Second operand 21 states and 3236 transitions. [2023-08-30 18:00:14,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 192 transitions, 1159 flow [2023-08-30 18:00:14,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 192 transitions, 1126 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-30 18:00:14,150 INFO L231 Difference]: Finished difference. Result has 91 places, 110 transitions, 721 flow [2023-08-30 18:00:14,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=721, PETRI_PLACES=91, PETRI_TRANSITIONS=110} [2023-08-30 18:00:14,151 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 28 predicate places. [2023-08-30 18:00:14,151 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 110 transitions, 721 flow [2023-08-30 18:00:14,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 150.28571428571428) internal successors, (4208), 28 states have internal predecessors, (4208), 0 states have call successors, (0), 0 states have 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,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:14,152 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:00:14,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-30 18:00:14,357 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 18:00:14,358 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 18:00:14,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:14,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1435047, now seen corresponding path program 2 times [2023-08-30 18:00:14,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:14,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102536185] [2023-08-30 18:00:14,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:14,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:15,239 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:00:15,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:15,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102536185] [2023-08-30 18:00:15,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102536185] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:00:15,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712614854] [2023-08-30 18:00:15,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 18:00:15,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:15,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:00:15,241 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 18:00:15,243 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 18:00:15,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 18:00:15,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:00:15,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-30 18:00:15,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:00:15,336 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,396 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:00:15,396 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,419 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,502 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:15,559 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:00:17,953 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:17,992 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:00:17,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:00:17,998 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_406) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-30 18:00:18,009 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_406) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) 0))) is different from false [2023-08-30 18:00:20,020 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_406) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) 0))) is different from false [2023-08-30 18:00:22,046 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_404 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_404)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_406) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) 0))) is different from false [2023-08-30 18:00:22,107 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_406 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_404 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_404)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_406) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| 28)))) is different from false [2023-08-30 18:00:22,131 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_406 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_404 Int) (v_ArrVal_401 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_401))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_404))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_406) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| 28)))) is different from false [2023-08-30 18:00:22,275 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-30 18:00:22,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712614854] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:00:22,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:00:22,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 25 [2023-08-30 18:00:22,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316754321] [2023-08-30 18:00:22,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:00:22,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-30 18:00:22,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:00:22,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-30 18:00:22,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=363, Unknown=8, NotChecked=258, Total=702 [2023-08-30 18:00:22,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 430 [2023-08-30 18:00:22,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 110 transitions, 721 flow. Second operand has 27 states, 27 states have (on average 150.40740740740742) internal successors, (4061), 27 states have internal predecessors, (4061), 0 states have call successors, (0), 0 states have 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:22,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:00:22,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 430 [2023-08-30 18:00:22,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00:23,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:00:46,184 WARN L222 SmtUtils]: Spent 16.06s on a formula simplification. DAG size of input: 61 DAG size of output: 26 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:00:59,611 INFO L130 PetriNetUnfolder]: 174/574 cut-off events. [2023-08-30 18:00:59,612 INFO L131 PetriNetUnfolder]: For 1465/1465 co-relation queries the response was YES. [2023-08-30 18:00:59,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2203 conditions, 574 events. 174/574 cut-off events. For 1465/1465 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2741 event pairs, 10 based on Foata normal form. 2/554 useless extension candidates. Maximal degree in co-relation 2095. Up to 118 conditions per place. [2023-08-30 18:00:59,615 INFO L137 encePairwiseOnDemand]: 420/430 looper letters, 171 selfloop transitions, 64 changer transitions 0/239 dead transitions. [2023-08-30 18:00:59,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 239 transitions, 1969 flow [2023-08-30 18:00:59,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-30 18:00:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-30 18:00:59,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3242 transitions. [2023-08-30 18:00:59,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35902547065337764 [2023-08-30 18:00:59,622 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3242 transitions. [2023-08-30 18:00:59,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3242 transitions. [2023-08-30 18:00:59,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:59,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3242 transitions. [2023-08-30 18:00:59,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 154.38095238095238) internal successors, (3242), 21 states have internal predecessors, (3242), 0 states have call successors, (0), 0 states have 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:59,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 430.0) internal successors, (9460), 22 states have internal predecessors, (9460), 0 states have call successors, (0), 0 states have 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:59,635 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 430.0) internal successors, (9460), 22 states have internal predecessors, (9460), 0 states have call successors, (0), 0 states have 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:59,635 INFO L175 Difference]: Start difference. First operand has 91 places, 110 transitions, 721 flow. Second operand 21 states and 3242 transitions. [2023-08-30 18:00:59,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 239 transitions, 1969 flow [2023-08-30 18:00:59,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 239 transitions, 1937 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-08-30 18:00:59,642 INFO L231 Difference]: Finished difference. Result has 118 places, 138 transitions, 1145 flow [2023-08-30 18:00:59,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1145, PETRI_PLACES=118, PETRI_TRANSITIONS=138} [2023-08-30 18:00:59,643 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 55 predicate places. [2023-08-30 18:00:59,643 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 138 transitions, 1145 flow [2023-08-30 18:00:59,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 150.40740740740742) internal successors, (4061), 27 states have internal predecessors, (4061), 0 states have call successors, (0), 0 states have 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:59,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:59,644 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:00:59,667 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 18:00:59,849 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 18:00:59,850 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 18:00:59,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:59,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1374964814, now seen corresponding path program 3 times [2023-08-30 18:00:59,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:59,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036912412] [2023-08-30 18:00:59,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:59,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:01:00,512 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:01:00,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:01:00,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036912412] [2023-08-30 18:01:00,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036912412] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:01:00,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829069803] [2023-08-30 18:01:00,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 18:01:00,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:01:00,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:01:00,521 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 18:01:00,523 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 18:01:00,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 18:01:00,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:01:00,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 55 conjunts are in the unsatisfiable core [2023-08-30 18:01:00,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:01:00,633 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:00,672 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:01:00,673 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:00,679 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:00,754 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:01:00,793 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:01:00,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-08-30 18:01:00,931 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 19 [2023-08-30 18:01:00,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2023-08-30 18:01:10,565 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:01:10,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:01:24,618 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) 0))) is different from false [2023-08-30 18:01:26,635 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_543)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) 0))) is different from false [2023-08-30 18:01:50,817 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (= (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_543) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))) is different from false [2023-08-30 18:01:52,825 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (= (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_543) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))) is different from false [2023-08-30 18:01:52,845 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 Int) (v_ArrVal_537 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (= (select (store (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_537))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_543) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))) is different from false [2023-08-30 18:01:54,864 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 Int) (v_ArrVal_537 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)) (= (select (store (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_537))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (- 1)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_543) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) 0))) is different from false [2023-08-30 18:01:54,874 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 Int) (v_ArrVal_537 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (or (= 0 (select (store (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_537))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_543) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))) is different from false [2023-08-30 18:02:11,205 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_534 (Array Int Int)) (v_ArrVal_543 Int) (v_ArrVal_537 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)) (= (select (store (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_534))) (store .cse1 |c_~#cache~0.base| (let ((.cse2 (select .cse1 |c_~#cache~0.base|))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_537) |c_~#cache~0.base|))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_543) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) 0))) is different from false [2023-08-30 18:02:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 15 not checked. [2023-08-30 18:02:11,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829069803] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:02:11,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:02:11,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 33 [2023-08-30 18:02:11,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679055591] [2023-08-30 18:02:11,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:02:11,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-30 18:02:11,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:02:11,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-30 18:02:11,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=539, Unknown=49, NotChecked=456, Total=1190 [2023-08-30 18:02:11,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 430 [2023-08-30 18:02:11,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 138 transitions, 1145 flow. Second operand has 35 states, 35 states have (on average 151.57142857142858) internal successors, (5305), 35 states have internal predecessors, (5305), 0 states have call successors, (0), 0 states have 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:11,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:02:11,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 430 [2023-08-30 18:02:11,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:02:12,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:02:13,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:02:14,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:02:17,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:02:18,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:02:19,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:02:21,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:02:22,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:02:23,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:02:27,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:02:29,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:02:31,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:02:32,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:02:41,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:02:42,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:02:44,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:02:45,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:03:01,162 WARN L222 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 66 DAG size of output: 25 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:03:11,610 WARN L222 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 65 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:03:12,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:03:14,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:03:17,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:03:19,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:03:20,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:03:21,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:03:47,299 WARN L222 SmtUtils]: Spent 22.16s on a formula simplification. DAG size of input: 82 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:03:48,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:03:49,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:03:51,662 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:53,667 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:55,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:04:10,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:04:12,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:04:23,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:04:24,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:04:36,000 WARN L222 SmtUtils]: Spent 9.92s on a formula simplification. DAG size of input: 79 DAG size of output: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:04:37,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:04:38,618 INFO L130 PetriNetUnfolder]: 191/641 cut-off events. [2023-08-30 18:04:38,618 INFO L131 PetriNetUnfolder]: For 2454/2454 co-relation queries the response was YES. [2023-08-30 18:04:38,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2667 conditions, 641 events. 191/641 cut-off events. For 2454/2454 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3213 event pairs, 14 based on Foata normal form. 2/612 useless extension candidates. Maximal degree in co-relation 2534. Up to 141 conditions per place. [2023-08-30 18:04:38,621 INFO L137 encePairwiseOnDemand]: 414/430 looper letters, 0 selfloop transitions, 0 changer transitions 180/180 dead transitions. [2023-08-30 18:04:38,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 180 transitions, 1762 flow [2023-08-30 18:04:38,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-30 18:04:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-30 18:04:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2758 transitions. [2023-08-30 18:04:38,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35633074935400516 [2023-08-30 18:04:38,626 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2758 transitions. [2023-08-30 18:04:38,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2758 transitions. [2023-08-30 18:04:38,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:04:38,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2758 transitions. [2023-08-30 18:04:38,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 153.22222222222223) internal successors, (2758), 18 states have internal predecessors, (2758), 0 states have call successors, (0), 0 states have 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:38,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 430.0) internal successors, (8170), 19 states have internal predecessors, (8170), 0 states have call successors, (0), 0 states have 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:38,639 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 430.0) internal successors, (8170), 19 states have internal predecessors, (8170), 0 states have call successors, (0), 0 states have 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:38,639 INFO L175 Difference]: Start difference. First operand has 118 places, 138 transitions, 1145 flow. Second operand 18 states and 2758 transitions. [2023-08-30 18:04:38,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 180 transitions, 1762 flow [2023-08-30 18:04:38,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 180 transitions, 1637 flow, removed 18 selfloop flow, removed 12 redundant places. [2023-08-30 18:04:38,647 INFO L231 Difference]: Finished difference. Result has 122 places, 0 transitions, 0 flow [2023-08-30 18:04:38,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=0, PETRI_PLACES=122, PETRI_TRANSITIONS=0} [2023-08-30 18:04:38,648 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 59 predicate places. [2023-08-30 18:04:38,648 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 0 transitions, 0 flow [2023-08-30 18:04:38,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 151.57142857142858) internal successors, (5305), 35 states have internal predecessors, (5305), 0 states have call successors, (0), 0 states have 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:38,652 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-30 18:04:38,652 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-30 18:04:38,652 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-30 18:04:38,653 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-30 18:04:38,673 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 18:04:38,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:04:38,859 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2023-08-30 18:04:38,860 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-30 18:04:38,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 246 transitions, 500 flow [2023-08-30 18:04:38,881 INFO L130 PetriNetUnfolder]: 73/381 cut-off events. [2023-08-30 18:04:38,882 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 18:04:38,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 381 events. 73/381 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1706 event pairs, 0 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 209. Up to 8 conditions per place. [2023-08-30 18:04:38,883 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 246 transitions, 500 flow [2023-08-30 18:04:38,885 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 241 transitions, 487 flow [2023-08-30 18:04:38,885 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 18:04:38,885 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 241 transitions, 487 flow [2023-08-30 18:04:38,885 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 241 transitions, 487 flow [2023-08-30 18:04:38,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 241 transitions, 487 flow [2023-08-30 18:04:38,901 INFO L130 PetriNetUnfolder]: 72/376 cut-off events. [2023-08-30 18:04:38,901 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 18:04:38,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 376 events. 72/376 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1659 event pairs, 0 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 209. Up to 8 conditions per place. [2023-08-30 18:04:38,907 INFO L119 LiptonReduction]: Number of co-enabled transitions 19458 [2023-08-30 18:04:41,085 INFO L134 LiptonReduction]: Checked pairs total: 31438 [2023-08-30 18:04:41,086 INFO L136 LiptonReduction]: Total number of compositions: 184 [2023-08-30 18:04:41,087 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-30 18:04:41,087 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;@608e8dec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 18:04:41,087 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-30 18:04:41,090 INFO L130 PetriNetUnfolder]: 16/54 cut-off events. [2023-08-30 18:04:41,090 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 18:04:41,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:04:41,090 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-30 18:04:41,090 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 18:04:41,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:04:41,090 INFO L85 PathProgramCache]: Analyzing trace with hash 742146464, now seen corresponding path program 1 times [2023-08-30 18:04:41,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:04:41,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786929371] [2023-08-30 18:04:41,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:04:41,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:04:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:04:41,105 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 18:04:41,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:04:41,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786929371] [2023-08-30 18:04:41,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786929371] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:04:41,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 18:04:41,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 18:04:41,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507224014] [2023-08-30 18:04:41,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:04:41,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 18:04:41,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:04:41,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 18:04:41,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 18:04:41,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 430 [2023-08-30 18:04:41,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 97 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have 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:41,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:04:41,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 430 [2023-08-30 18:04:41,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:04:41,232 INFO L130 PetriNetUnfolder]: 579/1211 cut-off events. [2023-08-30 18:04:41,232 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 18:04:41,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2277 conditions, 1211 events. 579/1211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6859 event pairs, 465 based on Foata normal form. 214/1212 useless extension candidates. Maximal degree in co-relation 2190. Up to 1060 conditions per place. [2023-08-30 18:04:41,234 INFO L137 encePairwiseOnDemand]: 395/430 looper letters, 22 selfloop transitions, 2 changer transitions 37/66 dead transitions. [2023-08-30 18:04:41,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 243 flow [2023-08-30 18:04:41,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 18:04:41,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 18:04:41,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2023-08-30 18:04:41,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5294573643410853 [2023-08-30 18:04:41,236 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 683 transitions. [2023-08-30 18:04:41,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 683 transitions. [2023-08-30 18:04:41,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:04:41,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 683 transitions. [2023-08-30 18:04:41,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have 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:41,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have 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:41,239 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have 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:41,239 INFO L175 Difference]: Start difference. First operand has 63 places, 97 transitions, 199 flow. Second operand 3 states and 683 transitions. [2023-08-30 18:04:41,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 243 flow [2023-08-30 18:04:41,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 243 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 18:04:41,240 INFO L231 Difference]: Finished difference. Result has 65 places, 29 transitions, 73 flow [2023-08-30 18:04:41,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=65, PETRI_TRANSITIONS=29} [2023-08-30 18:04:41,240 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2023-08-30 18:04:41,241 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 29 transitions, 73 flow [2023-08-30 18:04:41,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have 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:41,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:04:41,241 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-30 18:04:41,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 18:04:41,241 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 18:04:41,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:04:41,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1451583011, now seen corresponding path program 1 times [2023-08-30 18:04:41,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:04:41,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990823371] [2023-08-30 18:04:41,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:04:41,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:04:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:04:41,260 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 18:04:41,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:04:41,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990823371] [2023-08-30 18:04:41,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990823371] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:04:41,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940993715] [2023-08-30 18:04:41,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:04:41,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:04:41,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:04:41,262 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 18:04:41,264 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 18:04:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:04:41,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 18:04:41,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:04:41,340 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 18:04:41,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:04:41,349 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 18:04:41,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940993715] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:04:41,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:04:41,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 18:04:41,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772306680] [2023-08-30 18:04:41,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:04:41,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 18:04:41,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:04:41,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 18:04:41,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 18:04:41,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 430 [2023-08-30 18:04:41,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 29 transitions, 73 flow. Second operand has 7 states, 7 states have (on average 199.57142857142858) internal successors, (1397), 7 states have internal predecessors, (1397), 0 states have call successors, (0), 0 states have 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:41,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:04:41,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 430 [2023-08-30 18:04:41,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:04:41,419 INFO L130 PetriNetUnfolder]: 54/139 cut-off events. [2023-08-30 18:04:41,419 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 18:04:41,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 139 events. 54/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 375 event pairs, 45 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 265. Up to 119 conditions per place. [2023-08-30 18:04:41,420 INFO L137 encePairwiseOnDemand]: 427/430 looper letters, 22 selfloop transitions, 5 changer transitions 0/32 dead transitions. [2023-08-30 18:04:41,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 139 flow [2023-08-30 18:04:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 18:04:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 18:04:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1218 transitions. [2023-08-30 18:04:41,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4720930232558139 [2023-08-30 18:04:41,421 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1218 transitions. [2023-08-30 18:04:41,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1218 transitions. [2023-08-30 18:04:41,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:04:41,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1218 transitions. [2023-08-30 18:04:41,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have 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:41,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 430.0) internal successors, (3010), 7 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have 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:41,425 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 430.0) internal successors, (3010), 7 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have 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:41,425 INFO L175 Difference]: Start difference. First operand has 65 places, 29 transitions, 73 flow. Second operand 6 states and 1218 transitions. [2023-08-30 18:04:41,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 139 flow [2023-08-30 18:04:41,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 135 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 18:04:41,426 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 105 flow [2023-08-30 18:04:41,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=105, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2023-08-30 18:04:41,427 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -25 predicate places. [2023-08-30 18:04:41,427 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 105 flow [2023-08-30 18:04:41,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 199.57142857142858) internal successors, (1397), 7 states have internal predecessors, (1397), 0 states have call successors, (0), 0 states have 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:41,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:04:41,427 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-30 18:04:41,435 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 18:04:41,632 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,SelfDestructingSolverStorable10 [2023-08-30 18:04:41,633 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 18:04:41,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:04:41,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1255216928, now seen corresponding path program 2 times [2023-08-30 18:04:41,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:04:41,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405670006] [2023-08-30 18:04:41,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:04:41,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:04:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:04:41,673 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 18:04:41,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:04:41,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405670006] [2023-08-30 18:04:41,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405670006] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:04:41,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934152925] [2023-08-30 18:04:41,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 18:04:41,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:04:41,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:04:41,693 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 18:04:41,757 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 18:04:41,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 18:04:41,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:04:41,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 18:04:41,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:04:41,837 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 18:04:41,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:04:41,876 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 18:04:41,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934152925] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:04:41,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:04:41,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-30 18:04:41,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888102872] [2023-08-30 18:04:41,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:04:41,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 18:04:41,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:04:41,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 18:04:41,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-30 18:04:41,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 430 [2023-08-30 18:04:41,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 105 flow. Second operand has 13 states, 13 states have (on average 199.30769230769232) internal successors, (2591), 13 states have internal predecessors, (2591), 0 states have call successors, (0), 0 states have 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:41,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:04:41,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 430 [2023-08-30 18:04:41,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:04:41,973 INFO L130 PetriNetUnfolder]: 54/145 cut-off events. [2023-08-30 18:04:41,974 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-30 18:04:41,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 145 events. 54/145 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 379 event pairs, 45 based on Foata normal form. 6/122 useless extension candidates. Maximal degree in co-relation 256. Up to 119 conditions per place. [2023-08-30 18:04:41,974 INFO L137 encePairwiseOnDemand]: 427/430 looper letters, 22 selfloop transitions, 11 changer transitions 0/38 dead transitions. [2023-08-30 18:04:41,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 207 flow [2023-08-30 18:04:41,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 18:04:41,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 18:04:41,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2415 transitions. [2023-08-30 18:04:41,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4680232558139535 [2023-08-30 18:04:41,977 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2415 transitions. [2023-08-30 18:04:41,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2415 transitions. [2023-08-30 18:04:41,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:04:41,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2415 transitions. [2023-08-30 18:04:41,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 201.25) internal successors, (2415), 12 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have 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:41,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 430.0) internal successors, (5590), 13 states have internal predecessors, (5590), 0 states have call successors, (0), 0 states have 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:41,984 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 430.0) internal successors, (5590), 13 states have internal predecessors, (5590), 0 states have call successors, (0), 0 states have 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:41,984 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 105 flow. Second operand 12 states and 2415 transitions. [2023-08-30 18:04:41,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 207 flow [2023-08-30 18:04:41,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 38 transitions, 193 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 18:04:41,985 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 175 flow [2023-08-30 18:04:41,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=175, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2023-08-30 18:04:41,986 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -9 predicate places. [2023-08-30 18:04:41,986 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 175 flow [2023-08-30 18:04:41,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 199.30769230769232) internal successors, (2591), 13 states have internal predecessors, (2591), 0 states have call successors, (0), 0 states have 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:41,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:04:41,986 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-30 18:04:41,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-30 18:04:42,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:04:42,192 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 18:04:42,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:04:42,192 INFO L85 PathProgramCache]: Analyzing trace with hash -527083584, now seen corresponding path program 3 times [2023-08-30 18:04:42,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:04:42,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594403012] [2023-08-30 18:04:42,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:04:42,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:04:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 18:04:42,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 18:04:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 18:04:42,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 18:04:42,236 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 18:04:42,236 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-30 18:04:42,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 18:04:42,236 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-30 18:04:42,237 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-30 18:04:42,237 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 18:04:42,237 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-30 18:04:42,269 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-30 18:04:42,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 262 places, 317 transitions, 652 flow [2023-08-30 18:04:42,338 INFO L130 PetriNetUnfolder]: 118/611 cut-off events. [2023-08-30 18:04:42,352 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-30 18:04:42,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 611 events. 118/611 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3087 event pairs, 0 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 383. Up to 12 conditions per place. [2023-08-30 18:04:42,359 INFO L82 GeneralOperation]: Start removeDead. Operand has 262 places, 317 transitions, 652 flow [2023-08-30 18:04:42,362 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 262 places, 317 transitions, 652 flow [2023-08-30 18:04:42,376 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 18:04:42,377 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 262 places, 317 transitions, 652 flow [2023-08-30 18:04:42,377 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 262 places, 317 transitions, 652 flow [2023-08-30 18:04:42,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 262 places, 317 transitions, 652 flow [2023-08-30 18:04:42,435 INFO L130 PetriNetUnfolder]: 118/611 cut-off events. [2023-08-30 18:04:42,448 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-30 18:04:42,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 611 events. 118/611 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3087 event pairs, 0 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 383. Up to 12 conditions per place. [2023-08-30 18:04:42,492 INFO L119 LiptonReduction]: Number of co-enabled transitions 49956 [2023-08-30 18:04:45,370 INFO L134 LiptonReduction]: Checked pairs total: 85784 [2023-08-30 18:04:45,370 INFO L136 LiptonReduction]: Total number of compositions: 243 [2023-08-30 18:04:45,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 18:04:45,371 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;@608e8dec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 18:04:45,371 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-30 18:04:45,373 INFO L130 PetriNetUnfolder]: 9/36 cut-off events. [2023-08-30 18:04:45,373 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 18:04:45,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:04:45,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:04:45,373 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:04:45,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:04:45,373 INFO L85 PathProgramCache]: Analyzing trace with hash -671268620, now seen corresponding path program 1 times [2023-08-30 18:04:45,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:04:45,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179982107] [2023-08-30 18:04:45,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:04:45,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:04:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:04:45,386 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 18:04:45,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:04:45,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179982107] [2023-08-30 18:04:45,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179982107] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:04:45,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 18:04:45,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 18:04:45,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828240218] [2023-08-30 18:04:45,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:04:45,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 18:04:45,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:04:45,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 18:04:45,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 18:04:45,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 560 [2023-08-30 18:04:45,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 133 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have 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:45,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:04:45,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 560 [2023-08-30 18:04:45,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:04:47,284 INFO L130 PetriNetUnfolder]: 19961/30642 cut-off events. [2023-08-30 18:04:47,285 INFO L131 PetriNetUnfolder]: For 124/124 co-relation queries the response was YES. [2023-08-30 18:04:47,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58969 conditions, 30642 events. 19961/30642 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 947. Compared 212646 event pairs, 17166 based on Foata normal form. 5462/30473 useless extension candidates. Maximal degree in co-relation 20159. Up to 28224 conditions per place. [2023-08-30 18:04:47,444 INFO L137 encePairwiseOnDemand]: 516/560 looper letters, 73 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2023-08-30 18:04:47,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 93 transitions, 354 flow [2023-08-30 18:04:47,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 18:04:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 18:04:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2023-08-30 18:04:47,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2023-08-30 18:04:47,446 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 882 transitions. [2023-08-30 18:04:47,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 882 transitions. [2023-08-30 18:04:47,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:04:47,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 882 transitions. [2023-08-30 18:04:47,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have 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:47,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 560.0) internal successors, (2240), 4 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have 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:47,450 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 560.0) internal successors, (2240), 4 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have 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:47,450 INFO L175 Difference]: Start difference. First operand has 87 places, 133 transitions, 284 flow. Second operand 3 states and 882 transitions. [2023-08-30 18:04:47,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 93 transitions, 354 flow [2023-08-30 18:04:47,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 93 transitions, 354 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 18:04:47,452 INFO L231 Difference]: Finished difference. Result has 90 places, 93 transitions, 214 flow [2023-08-30 18:04:47,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=90, PETRI_TRANSITIONS=93} [2023-08-30 18:04:47,453 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 3 predicate places. [2023-08-30 18:04:47,454 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 214 flow [2023-08-30 18:04:47,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have 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:47,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:04:47,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:04:47,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 18:04:47,454 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:04:47,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:04:47,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1949750384, now seen corresponding path program 1 times [2023-08-30 18:04:47,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:04:47,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133277067] [2023-08-30 18:04:47,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:04:47,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:04:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:04:47,474 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 18:04:47,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:04:47,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133277067] [2023-08-30 18:04:47,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133277067] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:04:47,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129886698] [2023-08-30 18:04:47,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:04:47,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:04:47,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:04:47,493 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 18:04:47,509 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 18:04:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:04:47,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-30 18:04:47,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:04:47,595 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 18:04:47,596 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 18:04:47,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129886698] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:04:47,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 18:04:47,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-30 18:04:47,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917130479] [2023-08-30 18:04:47,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:04:47,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 18:04:47,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:04:47,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 18:04:47,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 18:04:47,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 560 [2023-08-30 18:04:47,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have 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:47,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:04:47,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 560 [2023-08-30 18:04:47,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:04:49,241 INFO L130 PetriNetUnfolder]: 19644/30266 cut-off events. [2023-08-30 18:04:49,241 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2023-08-30 18:04:49,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58589 conditions, 30266 events. 19644/30266 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 946. Compared 213281 event pairs, 8256 based on Foata normal form. 0/24593 useless extension candidates. Maximal degree in co-relation 58576. Up to 28177 conditions per place. [2023-08-30 18:04:49,382 INFO L137 encePairwiseOnDemand]: 557/560 looper letters, 91 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2023-08-30 18:04:49,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 111 transitions, 436 flow [2023-08-30 18:04:49,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 18:04:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 18:04:49,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 858 transitions. [2023-08-30 18:04:49,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5107142857142857 [2023-08-30 18:04:49,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 858 transitions. [2023-08-30 18:04:49,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 858 transitions. [2023-08-30 18:04:49,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:04:49,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 858 transitions. [2023-08-30 18:04:49,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have 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:49,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 560.0) internal successors, (2240), 4 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have 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:49,387 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 560.0) internal successors, (2240), 4 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have 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:49,387 INFO L175 Difference]: Start difference. First operand has 90 places, 93 transitions, 214 flow. Second operand 3 states and 858 transitions. [2023-08-30 18:04:49,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 111 transitions, 436 flow [2023-08-30 18:04:49,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 111 transitions, 432 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 18:04:49,389 INFO L231 Difference]: Finished difference. Result has 92 places, 94 transitions, 222 flow [2023-08-30 18:04:49,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=92, PETRI_TRANSITIONS=94} [2023-08-30 18:04:49,390 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 5 predicate places. [2023-08-30 18:04:49,390 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 94 transitions, 222 flow [2023-08-30 18:04:49,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have 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:49,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:04:49,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:04:49,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-08-30 18:04:49,595 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,SelfDestructingSolverStorable14 [2023-08-30 18:04:49,595 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:04:49,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:04:49,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1622301242, now seen corresponding path program 1 times [2023-08-30 18:04:49,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:04:49,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226215533] [2023-08-30 18:04:49,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:04:49,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:04:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:04:49,620 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 18:04:49,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:04:49,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226215533] [2023-08-30 18:04:49,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226215533] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:04:49,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360373430] [2023-08-30 18:04:49,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:04:49,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:04:49,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:04:49,622 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 18:04:49,624 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 18:04:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:04:49,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 18:04:49,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:04:49,711 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 18:04:49,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:04:49,721 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 18:04:49,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360373430] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:04:49,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:04:49,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 18:04:49,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496829675] [2023-08-30 18:04:49,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:04:49,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 18:04:49,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:04:49,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 18:04:49,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 18:04:49,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 560 [2023-08-30 18:04:49,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 94 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 256.14285714285717) internal successors, (1793), 7 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have 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:49,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:04:49,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 560 [2023-08-30 18:04:49,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:04:51,738 INFO L130 PetriNetUnfolder]: 20049/30556 cut-off events. [2023-08-30 18:04:51,738 INFO L131 PetriNetUnfolder]: For 676/676 co-relation queries the response was YES. [2023-08-30 18:04:51,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59459 conditions, 30556 events. 20049/30556 cut-off events. For 676/676 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 209547 event pairs, 17166 based on Foata normal form. 3/25146 useless extension candidates. Maximal degree in co-relation 59431. Up to 28195 conditions per place. [2023-08-30 18:04:51,965 INFO L137 encePairwiseOnDemand]: 557/560 looper letters, 74 selfloop transitions, 5 changer transitions 0/97 dead transitions. [2023-08-30 18:04:51,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 97 transitions, 392 flow [2023-08-30 18:04:51,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 18:04:51,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 18:04:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1605 transitions. [2023-08-30 18:04:51,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47767857142857145 [2023-08-30 18:04:51,968 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1605 transitions. [2023-08-30 18:04:51,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1605 transitions. [2023-08-30 18:04:51,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:04:51,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1605 transitions. [2023-08-30 18:04:51,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 267.5) internal successors, (1605), 6 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have 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:51,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have 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:51,998 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have 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:51,998 INFO L175 Difference]: Start difference. First operand has 92 places, 94 transitions, 222 flow. Second operand 6 states and 1605 transitions. [2023-08-30 18:04:51,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 97 transitions, 392 flow [2023-08-30 18:04:51,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 18:04:52,000 INFO L231 Difference]: Finished difference. Result has 99 places, 97 transitions, 256 flow [2023-08-30 18:04:52,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=256, PETRI_PLACES=99, PETRI_TRANSITIONS=97} [2023-08-30 18:04:52,001 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 12 predicate places. [2023-08-30 18:04:52,001 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 256 flow [2023-08-30 18:04:52,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 256.14285714285717) internal successors, (1793), 7 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have 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:52,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:04:52,002 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:04:52,017 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 18:04:52,202 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,SelfDestructingSolverStorable15 [2023-08-30 18:04:52,203 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:04:52,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:04:52,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1803240359, now seen corresponding path program 2 times [2023-08-30 18:04:52,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:04:52,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198515375] [2023-08-30 18:04:52,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:04:52,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:04:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:04:52,250 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 18:04:52,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:04:52,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198515375] [2023-08-30 18:04:52,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198515375] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:04:52,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211097418] [2023-08-30 18:04:52,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 18:04:52,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:04:52,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:04:52,253 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 18:04:52,313 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 18:04:52,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 18:04:52,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:04:52,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-30 18:04:52,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:04:52,417 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:52,446 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:04:52,447 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:52,462 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:52,492 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 18:04:52,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 18:04:52,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211097418] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:04:52,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 18:04:52,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-30 18:04:52,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195558645] [2023-08-30 18:04:52,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:04:52,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 18:04:52,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:04:52,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 18:04:52,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-30 18:04:52,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 560 [2023-08-30 18:04:52,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 97 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 243.66666666666666) internal successors, (1462), 6 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states have 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:52,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:04:52,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 560 [2023-08-30 18:04:52,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:04:55,350 INFO L130 PetriNetUnfolder]: 25507/39740 cut-off events. [2023-08-30 18:04:55,351 INFO L131 PetriNetUnfolder]: For 1007/1007 co-relation queries the response was YES. [2023-08-30 18:04:55,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77831 conditions, 39740 events. 25507/39740 cut-off events. For 1007/1007 co-relation queries the response was YES. Maximal size of possible extension queue 1212. Compared 295299 event pairs, 3964 based on Foata normal form. 0/32642 useless extension candidates. Maximal degree in co-relation 77795. Up to 28026 conditions per place. [2023-08-30 18:04:55,565 INFO L137 encePairwiseOnDemand]: 550/560 looper letters, 193 selfloop transitions, 16 changer transitions 0/227 dead transitions. [2023-08-30 18:04:55,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 227 transitions, 968 flow [2023-08-30 18:04:55,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 18:04:55,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 18:04:55,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1658 transitions. [2023-08-30 18:04:55,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.493452380952381 [2023-08-30 18:04:55,567 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1658 transitions. [2023-08-30 18:04:55,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1658 transitions. [2023-08-30 18:04:55,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:04:55,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1658 transitions. [2023-08-30 18:04:55,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 276.3333333333333) internal successors, (1658), 6 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have 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:55,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have 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:55,587 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have 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:55,587 INFO L175 Difference]: Start difference. First operand has 99 places, 97 transitions, 256 flow. Second operand 6 states and 1658 transitions. [2023-08-30 18:04:55,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 227 transitions, 968 flow [2023-08-30 18:04:55,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 227 transitions, 954 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 18:04:55,606 INFO L231 Difference]: Finished difference. Result has 107 places, 111 transitions, 345 flow [2023-08-30 18:04:55,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=345, PETRI_PLACES=107, PETRI_TRANSITIONS=111} [2023-08-30 18:04:55,608 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 20 predicate places. [2023-08-30 18:04:55,608 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 111 transitions, 345 flow [2023-08-30 18:04:55,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 243.66666666666666) internal successors, (1462), 6 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states have 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:55,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:04:55,609 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:04:55,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-30 18:04:55,809 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,SelfDestructingSolverStorable16 [2023-08-30 18:04:55,810 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:04:55,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:04:55,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1035869640, now seen corresponding path program 1 times [2023-08-30 18:04:55,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:04:55,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715073243] [2023-08-30 18:04:55,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:04:55,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:04:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:04:55,835 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 18:04:55,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:04:55,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715073243] [2023-08-30 18:04:55,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715073243] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:04:55,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690202824] [2023-08-30 18:04:55,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:04:55,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:04:55,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:04:55,853 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 18:04:55,921 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 18:04:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:04:56,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 18:04:56,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:04:56,047 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 18:04:56,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:04:56,091 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 18:04:56,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690202824] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:04:56,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:04:56,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-30 18:04:56,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210136742] [2023-08-30 18:04:56,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:04:56,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 18:04:56,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:04:56,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 18:04:56,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-30 18:04:56,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 560 [2023-08-30 18:04:56,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 111 transitions, 345 flow. Second operand has 14 states, 14 states have (on average 252.92857142857142) internal successors, (3541), 14 states have internal predecessors, (3541), 0 states have call successors, (0), 0 states have 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:56,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:04:56,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 560 [2023-08-30 18:04:56,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:04:58,653 INFO L130 PetriNetUnfolder]: 25483/40304 cut-off events. [2023-08-30 18:04:58,654 INFO L131 PetriNetUnfolder]: For 8365/8367 co-relation queries the response was YES. [2023-08-30 18:04:58,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86542 conditions, 40304 events. 25483/40304 cut-off events. For 8365/8367 co-relation queries the response was YES. Maximal size of possible extension queue 1199. Compared 308509 event pairs, 621 based on Foata normal form. 32/35590 useless extension candidates. Maximal degree in co-relation 86483. Up to 36042 conditions per place. [2023-08-30 18:04:58,954 INFO L137 encePairwiseOnDemand]: 555/560 looper letters, 142 selfloop transitions, 14 changer transitions 0/174 dead transitions. [2023-08-30 18:04:58,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 174 transitions, 849 flow [2023-08-30 18:04:58,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 18:04:58,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 18:04:58,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3657 transitions. [2023-08-30 18:04:58,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46645408163265306 [2023-08-30 18:04:58,958 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3657 transitions. [2023-08-30 18:04:58,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3657 transitions. [2023-08-30 18:04:58,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:04:58,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3657 transitions. [2023-08-30 18:04:58,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 261.2142857142857) internal successors, (3657), 14 states have internal predecessors, (3657), 0 states have call successors, (0), 0 states have 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:58,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 560.0) internal successors, (8400), 15 states have internal predecessors, (8400), 0 states have call successors, (0), 0 states have 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:58,967 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 560.0) internal successors, (8400), 15 states have internal predecessors, (8400), 0 states have call successors, (0), 0 states have 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:58,968 INFO L175 Difference]: Start difference. First operand has 107 places, 111 transitions, 345 flow. Second operand 14 states and 3657 transitions. [2023-08-30 18:04:58,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 174 transitions, 849 flow [2023-08-30 18:04:58,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 174 transitions, 849 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 18:04:58,979 INFO L231 Difference]: Finished difference. Result has 121 places, 117 transitions, 415 flow [2023-08-30 18:04:58,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=415, PETRI_PLACES=121, PETRI_TRANSITIONS=117} [2023-08-30 18:04:58,980 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 34 predicate places. [2023-08-30 18:04:58,980 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 117 transitions, 415 flow [2023-08-30 18:04:58,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 252.92857142857142) internal successors, (3541), 14 states have internal predecessors, (3541), 0 states have call successors, (0), 0 states have 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:58,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:04:58,981 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:04:58,987 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 18:04:59,187 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 18:04:59,187 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:04:59,188 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:04:59,188 INFO L85 PathProgramCache]: Analyzing trace with hash 111083739, now seen corresponding path program 1 times [2023-08-30 18:04:59,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:04:59,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205397440] [2023-08-30 18:04:59,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:04:59,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:04:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:04:59,302 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:04:59,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:04:59,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205397440] [2023-08-30 18:04:59,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205397440] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:04:59,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052186974] [2023-08-30 18:04:59,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:04:59,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:04:59,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:04:59,318 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 18:04:59,319 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 18:04:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:04:59,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-30 18:04:59,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:04:59,442 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:59,490 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:04:59,490 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:59,504 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:59,525 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:59,555 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:04:59,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:05:03,588 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_807 (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_807) |c_~#cache~0.base|))) is different from false [2023-08-30 18:05:03,887 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:05:03,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052186974] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:05:03,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:05:03,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-30 18:05:03,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330104633] [2023-08-30 18:05:03,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:05:03,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 18:05:03,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:05:03,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 18:05:03,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=79, Unknown=3, NotChecked=18, Total=132 [2023-08-30 18:05:03,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 560 [2023-08-30 18:05:03,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 117 transitions, 415 flow. Second operand has 12 states, 12 states have (on average 211.91666666666666) internal successors, (2543), 12 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have 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:03,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:05:03,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 560 [2023-08-30 18:05:03,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:05:07,534 INFO L130 PetriNetUnfolder]: 32541/49862 cut-off events. [2023-08-30 18:05:07,534 INFO L131 PetriNetUnfolder]: For 11987/11991 co-relation queries the response was YES. [2023-08-30 18:05:07,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109085 conditions, 49862 events. 32541/49862 cut-off events. For 11987/11991 co-relation queries the response was YES. Maximal size of possible extension queue 1489. Compared 370175 event pairs, 4806 based on Foata normal form. 4/43973 useless extension candidates. Maximal degree in co-relation 109012. Up to 30239 conditions per place. [2023-08-30 18:05:07,947 INFO L137 encePairwiseOnDemand]: 546/560 looper letters, 251 selfloop transitions, 33 changer transitions 0/300 dead transitions. [2023-08-30 18:05:07,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 300 transitions, 1474 flow [2023-08-30 18:05:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 18:05:07,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 18:05:07,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1725 transitions. [2023-08-30 18:05:07,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44005102040816324 [2023-08-30 18:05:07,950 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1725 transitions. [2023-08-30 18:05:07,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1725 transitions. [2023-08-30 18:05:07,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:05:07,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1725 transitions. [2023-08-30 18:05:07,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 246.42857142857142) internal successors, (1725), 7 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have 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:07,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 560.0) internal successors, (4480), 8 states have internal predecessors, (4480), 0 states have call successors, (0), 0 states have 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:07,955 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 560.0) internal successors, (4480), 8 states have internal predecessors, (4480), 0 states have call successors, (0), 0 states have 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:07,955 INFO L175 Difference]: Start difference. First operand has 121 places, 117 transitions, 415 flow. Second operand 7 states and 1725 transitions. [2023-08-30 18:05:07,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 300 transitions, 1474 flow [2023-08-30 18:05:07,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 300 transitions, 1397 flow, removed 28 selfloop flow, removed 10 redundant places. [2023-08-30 18:05:07,983 INFO L231 Difference]: Finished difference. Result has 123 places, 136 transitions, 573 flow [2023-08-30 18:05:07,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=573, PETRI_PLACES=123, PETRI_TRANSITIONS=136} [2023-08-30 18:05:07,984 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 36 predicate places. [2023-08-30 18:05:07,984 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 136 transitions, 573 flow [2023-08-30 18:05:07,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 211.91666666666666) internal successors, (2543), 12 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have 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:07,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:05:07,985 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:05:07,992 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:05:08,190 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:05:08,191 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:05:08,191 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:05:08,191 INFO L85 PathProgramCache]: Analyzing trace with hash 530400722, now seen corresponding path program 1 times [2023-08-30 18:05:08,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:05:08,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933789765] [2023-08-30 18:05:08,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:08,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:05:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:05:08,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:05:08,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933789765] [2023-08-30 18:05:08,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933789765] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:05:08,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768838687] [2023-08-30 18:05:08,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:08,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:05:08,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:05:08,254 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:05:08,281 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:05:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:08,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 18:05:08,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:05:08,398 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:05:08,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:05:08,423 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:05:08,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768838687] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:05:08,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:05:08,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-08-30 18:05:08,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442528704] [2023-08-30 18:05:08,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:05:08,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 18:05:08,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:05:08,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 18:05:08,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-08-30 18:05:08,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 560 [2023-08-30 18:05:08,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 136 transitions, 573 flow. Second operand has 9 states, 9 states have (on average 256.8888888888889) internal successors, (2312), 9 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have 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:08,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:05:08,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 560 [2023-08-30 18:05:08,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:05:09,070 INFO L130 PetriNetUnfolder]: 2603/4612 cut-off events. [2023-08-30 18:05:09,070 INFO L131 PetriNetUnfolder]: For 3210/3210 co-relation queries the response was YES. [2023-08-30 18:05:09,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12792 conditions, 4612 events. 2603/4612 cut-off events. For 3210/3210 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 28621 event pairs, 181 based on Foata normal form. 477/4902 useless extension candidates. Maximal degree in co-relation 12303. Up to 2957 conditions per place. [2023-08-30 18:05:09,092 INFO L137 encePairwiseOnDemand]: 557/560 looper letters, 122 selfloop transitions, 3 changer transitions 0/134 dead transitions. [2023-08-30 18:05:09,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 134 transitions, 758 flow [2023-08-30 18:05:09,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 18:05:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 18:05:09,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1363 transitions. [2023-08-30 18:05:09,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48678571428571427 [2023-08-30 18:05:09,099 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1363 transitions. [2023-08-30 18:05:09,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1363 transitions. [2023-08-30 18:05:09,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:05:09,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1363 transitions. [2023-08-30 18:05:09,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 272.6) internal successors, (1363), 5 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have 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:09,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 560.0) internal successors, (3360), 6 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have 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:09,102 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 560.0) internal successors, (3360), 6 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have 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:09,102 INFO L175 Difference]: Start difference. First operand has 123 places, 136 transitions, 573 flow. Second operand 5 states and 1363 transitions. [2023-08-30 18:05:09,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 134 transitions, 758 flow [2023-08-30 18:05:09,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 134 transitions, 720 flow, removed 13 selfloop flow, removed 8 redundant places. [2023-08-30 18:05:09,123 INFO L231 Difference]: Finished difference. Result has 79 places, 71 transitions, 253 flow [2023-08-30 18:05:09,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=75, 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=5, PETRI_FLOW=253, PETRI_PLACES=79, PETRI_TRANSITIONS=71} [2023-08-30 18:05:09,123 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -8 predicate places. [2023-08-30 18:05:09,123 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 71 transitions, 253 flow [2023-08-30 18:05:09,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 256.8888888888889) internal successors, (2312), 9 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have 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:09,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:05:09,124 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] [2023-08-30 18:05:09,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-08-30 18:05:09,329 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:05:09,330 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:05:09,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:05:09,330 INFO L85 PathProgramCache]: Analyzing trace with hash -503458137, now seen corresponding path program 1 times [2023-08-30 18:05:09,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:05:09,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868923864] [2023-08-30 18:05:09,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:09,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:05:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:09,510 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 18:05:09,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:05:09,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868923864] [2023-08-30 18:05:09,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868923864] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:05:09,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 18:05:09,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 18:05:09,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551833834] [2023-08-30 18:05:09,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:05:09,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 18:05:09,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:05:09,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 18:05:09,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 18:05:09,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 560 [2023-08-30 18:05:09,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 71 transitions, 253 flow. Second operand has 5 states, 5 states have (on average 232.8) internal successors, (1164), 5 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have 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:09,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:05:09,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 560 [2023-08-30 18:05:09,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:05:09,963 INFO L130 PetriNetUnfolder]: 3663/6158 cut-off events. [2023-08-30 18:05:09,963 INFO L131 PetriNetUnfolder]: For 4875/4875 co-relation queries the response was YES. [2023-08-30 18:05:09,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16341 conditions, 6158 events. 3663/6158 cut-off events. For 4875/4875 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 38326 event pairs, 1273 based on Foata normal form. 198/6087 useless extension candidates. Maximal degree in co-relation 7321. Up to 3359 conditions per place. [2023-08-30 18:05:09,995 INFO L137 encePairwiseOnDemand]: 545/560 looper letters, 91 selfloop transitions, 15 changer transitions 0/113 dead transitions. [2023-08-30 18:05:09,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 113 transitions, 626 flow [2023-08-30 18:05:09,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 18:05:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 18:05:09,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 996 transitions. [2023-08-30 18:05:09,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4446428571428571 [2023-08-30 18:05:09,997 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 996 transitions. [2023-08-30 18:05:09,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 996 transitions. [2023-08-30 18:05:09,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:05:09,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 996 transitions. [2023-08-30 18:05:09,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have 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:10,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 560.0) internal successors, (2800), 5 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have 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:10,001 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 560.0) internal successors, (2800), 5 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have 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:10,001 INFO L175 Difference]: Start difference. First operand has 79 places, 71 transitions, 253 flow. Second operand 4 states and 996 transitions. [2023-08-30 18:05:10,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 113 transitions, 626 flow [2023-08-30 18:05:10,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 113 transitions, 618 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 18:05:10,005 INFO L231 Difference]: Finished difference. Result has 80 places, 79 transitions, 324 flow [2023-08-30 18:05:10,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=324, PETRI_PLACES=80, PETRI_TRANSITIONS=79} [2023-08-30 18:05:10,006 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -7 predicate places. [2023-08-30 18:05:10,006 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 79 transitions, 324 flow [2023-08-30 18:05:10,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 232.8) internal successors, (1164), 5 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have 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:10,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:05:10,007 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] [2023-08-30 18:05:10,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 18:05:10,007 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:05:10,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:05:10,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1294900255, now seen corresponding path program 1 times [2023-08-30 18:05:10,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:05:10,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773991311] [2023-08-30 18:05:10,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:10,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:05:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:05:10,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:05:10,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773991311] [2023-08-30 18:05:10,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773991311] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:05:10,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 18:05:10,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 18:05:10,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104077832] [2023-08-30 18:05:10,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:05:10,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 18:05:10,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:05:10,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 18:05:10,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-30 18:05:10,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 560 [2023-08-30 18:05:10,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 79 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have 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:10,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:05:10,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 560 [2023-08-30 18:05:10,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:05:11,371 INFO L130 PetriNetUnfolder]: 6761/11626 cut-off events. [2023-08-30 18:05:11,371 INFO L131 PetriNetUnfolder]: For 8503/8521 co-relation queries the response was YES. [2023-08-30 18:05:11,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34647 conditions, 11626 events. 6761/11626 cut-off events. For 8503/8521 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 84300 event pairs, 2656 based on Foata normal form. 142/11144 useless extension candidates. Maximal degree in co-relation 27812. Up to 5413 conditions per place. [2023-08-30 18:05:11,464 INFO L137 encePairwiseOnDemand]: 546/560 looper letters, 155 selfloop transitions, 16 changer transitions 0/180 dead transitions. [2023-08-30 18:05:11,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 180 transitions, 1119 flow [2023-08-30 18:05:11,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 18:05:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 18:05:11,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1502 transitions. [2023-08-30 18:05:11,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44702380952380955 [2023-08-30 18:05:11,466 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1502 transitions. [2023-08-30 18:05:11,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1502 transitions. [2023-08-30 18:05:11,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:05:11,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1502 transitions. [2023-08-30 18:05:11,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 250.33333333333334) internal successors, (1502), 6 states have internal predecessors, (1502), 0 states have call successors, (0), 0 states have 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:11,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have 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:11,471 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have 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:11,471 INFO L175 Difference]: Start difference. First operand has 80 places, 79 transitions, 324 flow. Second operand 6 states and 1502 transitions. [2023-08-30 18:05:11,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 180 transitions, 1119 flow [2023-08-30 18:05:11,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 180 transitions, 1118 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 18:05:11,479 INFO L231 Difference]: Finished difference. Result has 87 places, 92 transitions, 475 flow [2023-08-30 18:05:11,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=475, PETRI_PLACES=87, PETRI_TRANSITIONS=92} [2023-08-30 18:05:11,479 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 0 predicate places. [2023-08-30 18:05:11,480 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 92 transitions, 475 flow [2023-08-30 18:05:11,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have 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:11,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:05:11,480 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] [2023-08-30 18:05:11,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 18:05:11,480 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:05:11,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:05:11,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1202449935, now seen corresponding path program 2 times [2023-08-30 18:05:11,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:05:11,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533009386] [2023-08-30 18:05:11,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:11,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:05:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:11,686 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-30 18:05:11,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:05:11,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533009386] [2023-08-30 18:05:11,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533009386] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:05:11,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 18:05:11,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 18:05:11,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569729700] [2023-08-30 18:05:11,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:05:11,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 18:05:11,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:05:11,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 18:05:11,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-30 18:05:11,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 560 [2023-08-30 18:05:11,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 92 transitions, 475 flow. Second operand has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have 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:11,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:05:11,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 560 [2023-08-30 18:05:11,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:05:13,285 INFO L130 PetriNetUnfolder]: 10495/18154 cut-off events. [2023-08-30 18:05:13,285 INFO L131 PetriNetUnfolder]: For 21099/21126 co-relation queries the response was YES. [2023-08-30 18:05:13,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60122 conditions, 18154 events. 10495/18154 cut-off events. For 21099/21126 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 140812 event pairs, 4814 based on Foata normal form. 135/17266 useless extension candidates. Maximal degree in co-relation 23823. Up to 10648 conditions per place. [2023-08-30 18:05:13,441 INFO L137 encePairwiseOnDemand]: 547/560 looper letters, 166 selfloop transitions, 25 changer transitions 0/200 dead transitions. [2023-08-30 18:05:13,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 200 transitions, 1462 flow [2023-08-30 18:05:13,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 18:05:13,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 18:05:13,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1498 transitions. [2023-08-30 18:05:13,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44583333333333336 [2023-08-30 18:05:13,445 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1498 transitions. [2023-08-30 18:05:13,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1498 transitions. [2023-08-30 18:05:13,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:05:13,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1498 transitions. [2023-08-30 18:05:13,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 249.66666666666666) internal successors, (1498), 6 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have 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:13,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have 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:13,448 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have 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:13,449 INFO L175 Difference]: Start difference. First operand has 87 places, 92 transitions, 475 flow. Second operand 6 states and 1498 transitions. [2023-08-30 18:05:13,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 200 transitions, 1462 flow [2023-08-30 18:05:13,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 200 transitions, 1451 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 18:05:13,461 INFO L231 Difference]: Finished difference. Result has 93 places, 113 transitions, 765 flow [2023-08-30 18:05:13,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=765, PETRI_PLACES=93, PETRI_TRANSITIONS=113} [2023-08-30 18:05:13,462 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 6 predicate places. [2023-08-30 18:05:13,462 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 113 transitions, 765 flow [2023-08-30 18:05:13,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have 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:13,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:05:13,463 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] [2023-08-30 18:05:13,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-30 18:05:13,463 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:05:13,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:05:13,463 INFO L85 PathProgramCache]: Analyzing trace with hash 437328155, now seen corresponding path program 3 times [2023-08-30 18:05:13,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:05:13,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598539466] [2023-08-30 18:05:13,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:13,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:05:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:13,723 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:05:13,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:05:13,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598539466] [2023-08-30 18:05:13,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598539466] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:05:13,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459762097] [2023-08-30 18:05:13,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 18:05:13,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:05:13,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:05:13,739 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:05:13,744 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:05:13,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 18:05:13,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:05:13,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-30 18:05:13,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:05:13,923 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:05:13,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:05:13,951 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:05:13,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:05:13,977 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:05:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:05:14,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 18:05:14,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459762097] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:05:14,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 18:05:14,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2023-08-30 18:05:14,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672551580] [2023-08-30 18:05:14,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:05:14,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 18:05:14,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:05:14,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 18:05:14,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-08-30 18:05:14,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 560 [2023-08-30 18:05:14,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 113 transitions, 765 flow. Second operand has 7 states, 7 states have (on average 235.57142857142858) internal successors, (1649), 7 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have 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:14,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:05:14,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 560 [2023-08-30 18:05:14,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:05:15,847 INFO L130 PetriNetUnfolder]: 11089/19274 cut-off events. [2023-08-30 18:05:15,847 INFO L131 PetriNetUnfolder]: For 34114/34162 co-relation queries the response was YES. [2023-08-30 18:05:15,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69158 conditions, 19274 events. 11089/19274 cut-off events. For 34114/34162 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 153048 event pairs, 4650 based on Foata normal form. 21/18219 useless extension candidates. Maximal degree in co-relation 50037. Up to 10164 conditions per place. [2023-08-30 18:05:16,043 INFO L137 encePairwiseOnDemand]: 553/560 looper letters, 197 selfloop transitions, 22 changer transitions 0/228 dead transitions. [2023-08-30 18:05:16,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 228 transitions, 1891 flow [2023-08-30 18:05:16,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 18:05:16,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 18:05:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1520 transitions. [2023-08-30 18:05:16,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2023-08-30 18:05:16,046 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1520 transitions. [2023-08-30 18:05:16,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1520 transitions. [2023-08-30 18:05:16,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:05:16,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1520 transitions. [2023-08-30 18:05:16,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 253.33333333333334) internal successors, (1520), 6 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have 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:16,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have 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:16,050 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have 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:16,050 INFO L175 Difference]: Start difference. First operand has 93 places, 113 transitions, 765 flow. Second operand 6 states and 1520 transitions. [2023-08-30 18:05:16,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 228 transitions, 1891 flow [2023-08-30 18:05:16,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 228 transitions, 1870 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-30 18:05:16,068 INFO L231 Difference]: Finished difference. Result has 98 places, 121 transitions, 891 flow [2023-08-30 18:05:16,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=891, PETRI_PLACES=98, PETRI_TRANSITIONS=121} [2023-08-30 18:05:16,069 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 11 predicate places. [2023-08-30 18:05:16,069 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 121 transitions, 891 flow [2023-08-30 18:05:16,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 235.57142857142858) internal successors, (1649), 7 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have 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:16,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:05:16,069 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] [2023-08-30 18:05:16,076 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:05:16,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-08-30 18:05:16,275 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:05:16,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:05:16,276 INFO L85 PathProgramCache]: Analyzing trace with hash -273617943, now seen corresponding path program 4 times [2023-08-30 18:05:16,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:05:16,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666753285] [2023-08-30 18:05:16,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:16,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:05:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:16,489 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-30 18:05:16,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:05:16,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666753285] [2023-08-30 18:05:16,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666753285] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:05:16,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 18:05:16,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 18:05:16,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435292482] [2023-08-30 18:05:16,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:05:16,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 18:05:16,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:05:16,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 18:05:16,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-30 18:05:16,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 560 [2023-08-30 18:05:16,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 121 transitions, 891 flow. Second operand has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have 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:16,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:05:16,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 560 [2023-08-30 18:05:16,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:05:18,827 INFO L130 PetriNetUnfolder]: 11887/20735 cut-off events. [2023-08-30 18:05:18,827 INFO L131 PetriNetUnfolder]: For 46998/47085 co-relation queries the response was YES. [2023-08-30 18:05:18,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77692 conditions, 20735 events. 11887/20735 cut-off events. For 46998/47085 co-relation queries the response was YES. Maximal size of possible extension queue 811. Compared 165631 event pairs, 5550 based on Foata normal form. 30/19576 useless extension candidates. Maximal degree in co-relation 46642. Up to 11602 conditions per place. [2023-08-30 18:05:18,986 INFO L137 encePairwiseOnDemand]: 548/560 looper letters, 213 selfloop transitions, 30 changer transitions 0/252 dead transitions. [2023-08-30 18:05:18,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 252 transitions, 2267 flow [2023-08-30 18:05:18,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 18:05:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 18:05:18,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1514 transitions. [2023-08-30 18:05:18,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4505952380952381 [2023-08-30 18:05:18,989 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1514 transitions. [2023-08-30 18:05:18,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1514 transitions. [2023-08-30 18:05:18,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:05:18,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1514 transitions. [2023-08-30 18:05:18,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 252.33333333333334) internal successors, (1514), 6 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states have 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:18,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have 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:18,992 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have 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:18,993 INFO L175 Difference]: Start difference. First operand has 98 places, 121 transitions, 891 flow. Second operand 6 states and 1514 transitions. [2023-08-30 18:05:18,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 252 transitions, 2267 flow [2023-08-30 18:05:19,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 252 transitions, 2249 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 18:05:19,010 INFO L231 Difference]: Finished difference. Result has 104 places, 140 transitions, 1240 flow [2023-08-30 18:05:19,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1240, PETRI_PLACES=104, PETRI_TRANSITIONS=140} [2023-08-30 18:05:19,010 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 17 predicate places. [2023-08-30 18:05:19,011 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 140 transitions, 1240 flow [2023-08-30 18:05:19,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have 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:19,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:05:19,011 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] [2023-08-30 18:05:19,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-30 18:05:19,011 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:05:19,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:05:19,012 INFO L85 PathProgramCache]: Analyzing trace with hash -714373981, now seen corresponding path program 5 times [2023-08-30 18:05:19,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:05:19,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975355325] [2023-08-30 18:05:19,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:19,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:05:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:19,190 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:05:19,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:05:19,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975355325] [2023-08-30 18:05:19,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975355325] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:05:19,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 18:05:19,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 18:05:19,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291888732] [2023-08-30 18:05:19,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:05:19,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 18:05:19,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:05:19,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 18:05:19,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-30 18:05:19,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 560 [2023-08-30 18:05:19,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 140 transitions, 1240 flow. Second operand has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have 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:19,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:05:19,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 560 [2023-08-30 18:05:19,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:05:21,234 INFO L130 PetriNetUnfolder]: 11887/20827 cut-off events. [2023-08-30 18:05:21,235 INFO L131 PetriNetUnfolder]: For 54685/54799 co-relation queries the response was YES. [2023-08-30 18:05:21,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79384 conditions, 20827 events. 11887/20827 cut-off events. For 54685/54799 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 167422 event pairs, 5153 based on Foata normal form. 45/19679 useless extension candidates. Maximal degree in co-relation 58432. Up to 10175 conditions per place. [2023-08-30 18:05:21,418 INFO L137 encePairwiseOnDemand]: 548/560 looper letters, 213 selfloop transitions, 34 changer transitions 0/256 dead transitions. [2023-08-30 18:05:21,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 256 transitions, 2453 flow [2023-08-30 18:05:21,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 18:05:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 18:05:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1515 transitions. [2023-08-30 18:05:21,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45089285714285715 [2023-08-30 18:05:21,421 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1515 transitions. [2023-08-30 18:05:21,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1515 transitions. [2023-08-30 18:05:21,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:05:21,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1515 transitions. [2023-08-30 18:05:21,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 252.5) internal successors, (1515), 6 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have 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:21,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have 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:21,425 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have 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:21,425 INFO L175 Difference]: Start difference. First operand has 104 places, 140 transitions, 1240 flow. Second operand 6 states and 1515 transitions. [2023-08-30 18:05:21,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 256 transitions, 2453 flow [2023-08-30 18:05:21,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 256 transitions, 2431 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 18:05:21,458 INFO L231 Difference]: Finished difference. Result has 110 places, 149 transitions, 1472 flow [2023-08-30 18:05:21,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1472, PETRI_PLACES=110, PETRI_TRANSITIONS=149} [2023-08-30 18:05:21,459 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 23 predicate places. [2023-08-30 18:05:21,459 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 149 transitions, 1472 flow [2023-08-30 18:05:21,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have 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:21,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:05:21,460 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] [2023-08-30 18:05:21,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-30 18:05:21,460 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:05:21,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:05:21,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1296490569, now seen corresponding path program 6 times [2023-08-30 18:05:21,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:05:21,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571863501] [2023-08-30 18:05:21,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:21,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:05:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:21,817 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:05:21,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:05:21,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571863501] [2023-08-30 18:05:21,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571863501] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:05:21,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663567558] [2023-08-30 18:05:21,818 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 18:05:21,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:05:21,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:05:21,819 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:05:21,821 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:05:21,930 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-30 18:05:21,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:05:21,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-30 18:05:21,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:05:22,029 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:05:22,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:05:22,060 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:05:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-30 18:05:22,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 18:05:22,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663567558] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:05:22,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 18:05:22,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2023-08-30 18:05:22,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976730524] [2023-08-30 18:05:22,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:05:22,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 18:05:22,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:05:22,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 18:05:22,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-08-30 18:05:22,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 560 [2023-08-30 18:05:22,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 149 transitions, 1472 flow. Second operand has 7 states, 7 states have (on average 235.71428571428572) internal successors, (1650), 7 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have 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:22,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:05:22,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 560 [2023-08-30 18:05:22,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:05:24,122 INFO L130 PetriNetUnfolder]: 11079/19346 cut-off events. [2023-08-30 18:05:24,122 INFO L131 PetriNetUnfolder]: For 54275/54362 co-relation queries the response was YES. [2023-08-30 18:05:24,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74132 conditions, 19346 events. 11079/19346 cut-off events. For 54275/54362 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 154104 event pairs, 5102 based on Foata normal form. 66/18324 useless extension candidates. Maximal degree in co-relation 51805. Up to 10102 conditions per place. [2023-08-30 18:05:24,316 INFO L137 encePairwiseOnDemand]: 553/560 looper letters, 190 selfloop transitions, 20 changer transitions 0/219 dead transitions. [2023-08-30 18:05:24,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 219 transitions, 2097 flow [2023-08-30 18:05:24,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 18:05:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 18:05:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1517 transitions. [2023-08-30 18:05:24,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45148809523809524 [2023-08-30 18:05:24,319 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1517 transitions. [2023-08-30 18:05:24,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1517 transitions. [2023-08-30 18:05:24,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:05:24,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1517 transitions. [2023-08-30 18:05:24,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 252.83333333333334) internal successors, (1517), 6 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have 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:24,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have 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:24,322 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have 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:24,322 INFO L175 Difference]: Start difference. First operand has 110 places, 149 transitions, 1472 flow. Second operand 6 states and 1517 transitions. [2023-08-30 18:05:24,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 219 transitions, 2097 flow [2023-08-30 18:05:24,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 219 transitions, 2064 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-30 18:05:24,364 INFO L231 Difference]: Finished difference. Result has 115 places, 137 transitions, 1278 flow [2023-08-30 18:05:24,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1278, PETRI_PLACES=115, PETRI_TRANSITIONS=137} [2023-08-30 18:05:24,365 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 28 predicate places. [2023-08-30 18:05:24,365 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 137 transitions, 1278 flow [2023-08-30 18:05:24,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 235.71428571428572) internal successors, (1650), 7 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have 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:24,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:05:24,366 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] [2023-08-30 18:05:24,371 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:05:24,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-30 18:05:24,572 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:05:24,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:05:24,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1859196367, now seen corresponding path program 7 times [2023-08-30 18:05:24,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:05:24,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766250113] [2023-08-30 18:05:24,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:24,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:05:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:24,849 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-30 18:05:24,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:05:24,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766250113] [2023-08-30 18:05:24,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766250113] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:05:24,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 18:05:24,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 18:05:24,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18021261] [2023-08-30 18:05:24,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:05:24,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 18:05:24,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:05:24,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 18:05:24,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 18:05:25,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 560 [2023-08-30 18:05:25,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 137 transitions, 1278 flow. Second operand has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have 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:25,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:05:25,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 560 [2023-08-30 18:05:25,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:05:27,154 INFO L130 PetriNetUnfolder]: 10398/18099 cut-off events. [2023-08-30 18:05:27,154 INFO L131 PetriNetUnfolder]: For 51691/51739 co-relation queries the response was YES. [2023-08-30 18:05:27,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69179 conditions, 18099 events. 10398/18099 cut-off events. For 51691/51739 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 141450 event pairs, 5295 based on Foata normal form. 42/17163 useless extension candidates. Maximal degree in co-relation 68161. Up to 11434 conditions per place. [2023-08-30 18:05:27,357 INFO L137 encePairwiseOnDemand]: 553/560 looper letters, 185 selfloop transitions, 19 changer transitions 0/213 dead transitions. [2023-08-30 18:05:27,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 213 transitions, 2038 flow [2023-08-30 18:05:27,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 18:05:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 18:05:27,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1563 transitions. [2023-08-30 18:05:27,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46517857142857144 [2023-08-30 18:05:27,359 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1563 transitions. [2023-08-30 18:05:27,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1563 transitions. [2023-08-30 18:05:27,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:05:27,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1563 transitions. [2023-08-30 18:05:27,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 260.5) internal successors, (1563), 6 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have 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:27,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have 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:27,363 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have 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:27,363 INFO L175 Difference]: Start difference. First operand has 115 places, 137 transitions, 1278 flow. Second operand 6 states and 1563 transitions. [2023-08-30 18:05:27,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 213 transitions, 2038 flow [2023-08-30 18:05:27,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 213 transitions, 1976 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-08-30 18:05:27,405 INFO L231 Difference]: Finished difference. Result has 119 places, 131 transitions, 1185 flow [2023-08-30 18:05:27,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1185, PETRI_PLACES=119, PETRI_TRANSITIONS=131} [2023-08-30 18:05:27,407 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 32 predicate places. [2023-08-30 18:05:27,407 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 131 transitions, 1185 flow [2023-08-30 18:05:27,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have 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:27,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:05:27,407 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] [2023-08-30 18:05:27,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-30 18:05:27,408 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:05:27,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:05:27,408 INFO L85 PathProgramCache]: Analyzing trace with hash 923061181, now seen corresponding path program 1 times [2023-08-30 18:05:27,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:05:27,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706445913] [2023-08-30 18:05:27,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:27,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:05:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:27,827 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:05:27,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:05:27,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706445913] [2023-08-30 18:05:27,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706445913] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:05:27,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973930804] [2023-08-30 18:05:27,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:27,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:05:27,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:05:27,829 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:05:27,831 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:05:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:27,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-30 18:05:27,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:05:28,042 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:05:28,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:05:28,077 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:05:28,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:05:28,096 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:05:28,136 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-30 18:05:28,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 18:05:28,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973930804] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:05:28,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 18:05:28,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 14 [2023-08-30 18:05:28,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815196960] [2023-08-30 18:05:28,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:05:28,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 18:05:28,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:05:28,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 18:05:28,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-08-30 18:05:28,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 560 [2023-08-30 18:05:28,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 131 transitions, 1185 flow. Second operand has 7 states, 7 states have (on average 235.57142857142858) internal successors, (1649), 7 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have 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:28,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:05:28,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 560 [2023-08-30 18:05:28,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:05:30,604 INFO L130 PetriNetUnfolder]: 11000/19194 cut-off events. [2023-08-30 18:05:30,605 INFO L131 PetriNetUnfolder]: For 57790/57838 co-relation queries the response was YES. [2023-08-30 18:05:30,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73888 conditions, 19194 events. 11000/19194 cut-off events. For 57790/57838 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 152878 event pairs, 5042 based on Foata normal form. 21/18203 useless extension candidates. Maximal degree in co-relation 72838. Up to 11611 conditions per place. [2023-08-30 18:05:30,807 INFO L137 encePairwiseOnDemand]: 553/560 looper letters, 199 selfloop transitions, 28 changer transitions 0/236 dead transitions. [2023-08-30 18:05:30,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 236 transitions, 2286 flow [2023-08-30 18:05:30,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 18:05:30,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 18:05:30,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1519 transitions. [2023-08-30 18:05:30,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45208333333333334 [2023-08-30 18:05:30,809 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1519 transitions. [2023-08-30 18:05:30,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1519 transitions. [2023-08-30 18:05:30,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:05:30,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1519 transitions. [2023-08-30 18:05:30,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 253.16666666666666) internal successors, (1519), 6 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have 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:30,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have 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:30,813 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have 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:30,813 INFO L175 Difference]: Start difference. First operand has 119 places, 131 transitions, 1185 flow. Second operand 6 states and 1519 transitions. [2023-08-30 18:05:30,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 236 transitions, 2286 flow [2023-08-30 18:05:30,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 236 transitions, 2234 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-30 18:05:30,870 INFO L231 Difference]: Finished difference. Result has 123 places, 138 transitions, 1328 flow [2023-08-30 18:05:30,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1328, PETRI_PLACES=123, PETRI_TRANSITIONS=138} [2023-08-30 18:05:30,870 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 36 predicate places. [2023-08-30 18:05:30,870 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 138 transitions, 1328 flow [2023-08-30 18:05:30,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 235.57142857142858) internal successors, (1649), 7 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have 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:30,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:05:30,871 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] [2023-08-30 18:05:30,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-30 18:05:31,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-30 18:05:31,075 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:05:31,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:05:31,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1557358783, now seen corresponding path program 2 times [2023-08-30 18:05:31,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:05:31,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932622540] [2023-08-30 18:05:31,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:31,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:05:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:31,466 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:05:31,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:05:31,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932622540] [2023-08-30 18:05:31,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932622540] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:05:31,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396236899] [2023-08-30 18:05:31,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 18:05:31,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:05:31,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:05:31,468 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:05:31,471 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:05:31,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 18:05:31,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:05:31,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-30 18:05:31,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:05:31,688 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:05:31,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:05:31,733 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:05:31,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:05:31,750 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:05:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-30 18:05:31,771 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 18:05:31,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396236899] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:05:31,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 18:05:31,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 14 [2023-08-30 18:05:31,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064416235] [2023-08-30 18:05:31,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:05:31,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 18:05:31,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:05:31,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 18:05:31,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-08-30 18:05:32,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 560 [2023-08-30 18:05:32,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 138 transitions, 1328 flow. Second operand has 7 states, 7 states have (on average 235.57142857142858) internal successors, (1649), 7 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have 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:32,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:05:32,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 560 [2023-08-30 18:05:32,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:05:34,014 INFO L130 PetriNetUnfolder]: 10701/18687 cut-off events. [2023-08-30 18:05:34,014 INFO L131 PetriNetUnfolder]: For 54242/54278 co-relation queries the response was YES. [2023-08-30 18:05:34,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71813 conditions, 18687 events. 10701/18687 cut-off events. For 54242/54278 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 147149 event pairs, 5493 based on Foata normal form. 18/17705 useless extension candidates. Maximal degree in co-relation 71130. Up to 11545 conditions per place. [2023-08-30 18:05:34,187 INFO L137 encePairwiseOnDemand]: 553/560 looper letters, 186 selfloop transitions, 18 changer transitions 0/213 dead transitions. [2023-08-30 18:05:34,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 213 transitions, 2015 flow [2023-08-30 18:05:34,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 18:05:34,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 18:05:34,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1516 transitions. [2023-08-30 18:05:34,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4511904761904762 [2023-08-30 18:05:34,189 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1516 transitions. [2023-08-30 18:05:34,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1516 transitions. [2023-08-30 18:05:34,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:05:34,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1516 transitions. [2023-08-30 18:05:34,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 252.66666666666666) internal successors, (1516), 6 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have 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:34,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have 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:34,192 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have 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:34,192 INFO L175 Difference]: Start difference. First operand has 123 places, 138 transitions, 1328 flow. Second operand 6 states and 1516 transitions. [2023-08-30 18:05:34,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 213 transitions, 2015 flow [2023-08-30 18:05:34,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 213 transitions, 1992 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-30 18:05:34,243 INFO L231 Difference]: Finished difference. Result has 126 places, 131 transitions, 1199 flow [2023-08-30 18:05:34,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1163, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1199, PETRI_PLACES=126, PETRI_TRANSITIONS=131} [2023-08-30 18:05:34,244 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 39 predicate places. [2023-08-30 18:05:34,244 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 131 transitions, 1199 flow [2023-08-30 18:05:34,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 235.57142857142858) internal successors, (1649), 7 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have 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:34,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:05:34,244 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] [2023-08-30 18:05:34,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-08-30 18:05:34,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:05:34,452 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:05:34,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:05:34,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1858616422, now seen corresponding path program 1 times [2023-08-30 18:05:34,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:05:34,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856276109] [2023-08-30 18:05:34,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:34,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:05:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:34,683 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:05:34,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:05:34,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856276109] [2023-08-30 18:05:34,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856276109] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:05:34,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579721206] [2023-08-30 18:05:34,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:34,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:05:34,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:05:34,685 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:05:34,687 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:05:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:34,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-30 18:05:34,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:05:34,819 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:05:34,873 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:05:34,873 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:05:34,887 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:05:34,951 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:05:35,000 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:05:40,020 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:05:40,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:05:50,079 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_69| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_69|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_69| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-30 18:05:52,095 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1523 Int)) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_69| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1523)) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_69|) 0))) is different from false [2023-08-30 18:06:04,219 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1520 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (v_ArrVal_1523 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1520) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_1523) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_69|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_69| (+ |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_70| 28)))) is different from false [2023-08-30 18:06:04,326 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-30 18:06:04,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579721206] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:06:04,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:06:04,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2023-08-30 18:06:04,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817028744] [2023-08-30 18:06:04,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:06:04,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-30 18:06:04,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:06:04,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-30 18:06:04,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=247, Unknown=16, NotChecked=108, Total=462 [2023-08-30 18:06:04,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 560 [2023-08-30 18:06:04,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 131 transitions, 1199 flow. Second operand has 22 states, 22 states have (on average 205.36363636363637) internal successors, (4518), 22 states have internal predecessors, (4518), 0 states have call successors, (0), 0 states have 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:06:04,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:06:04,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 560 [2023-08-30 18:06:04,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:06:05,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:06,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:08,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:10,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:12,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:13,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:14,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:19,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:20,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:21,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:23,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:24,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:25,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:26,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:28,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:29,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:30,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:32,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:33,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:34,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:36,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:37,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:38,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:40,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:44,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:46,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:48,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:49,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:50,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:52,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:53,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:54,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:56,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:58,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:06:59,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:07:03,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:07:04,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:07:06,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:07:07,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:07:08,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:07:10,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:07:12,685 INFO L130 PetriNetUnfolder]: 17890/30735 cut-off events. [2023-08-30 18:07:12,686 INFO L131 PetriNetUnfolder]: For 89102/89114 co-relation queries the response was YES. [2023-08-30 18:07:12,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119296 conditions, 30735 events. 17890/30735 cut-off events. For 89102/89114 co-relation queries the response was YES. Maximal size of possible extension queue 1388. Compared 256516 event pairs, 3241 based on Foata normal form. 135/29400 useless extension candidates. Maximal degree in co-relation 118563. Up to 15125 conditions per place. [2023-08-30 18:07:12,979 INFO L137 encePairwiseOnDemand]: 550/560 looper letters, 355 selfloop transitions, 50 changer transitions 0/413 dead transitions. [2023-08-30 18:07:12,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 413 transitions, 4475 flow [2023-08-30 18:07:12,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 18:07:12,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 18:07:12,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2227 transitions. [2023-08-30 18:07:12,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39767857142857144 [2023-08-30 18:07:12,982 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2227 transitions. [2023-08-30 18:07:12,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2227 transitions. [2023-08-30 18:07:12,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:07:12,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2227 transitions. [2023-08-30 18:07:12,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 222.7) internal successors, (2227), 10 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have 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:07:12,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 560.0) internal successors, (6160), 11 states have internal predecessors, (6160), 0 states have call successors, (0), 0 states have 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:07:12,986 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 560.0) internal successors, (6160), 11 states have internal predecessors, (6160), 0 states have call successors, (0), 0 states have 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:07:12,986 INFO L175 Difference]: Start difference. First operand has 126 places, 131 transitions, 1199 flow. Second operand 10 states and 2227 transitions. [2023-08-30 18:07:12,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 413 transitions, 4475 flow [2023-08-30 18:07:13,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 413 transitions, 4375 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 18:07:13,059 INFO L231 Difference]: Finished difference. Result has 137 places, 172 transitions, 1788 flow [2023-08-30 18:07:13,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1788, PETRI_PLACES=137, PETRI_TRANSITIONS=172} [2023-08-30 18:07:13,060 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 50 predicate places. [2023-08-30 18:07:13,060 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 172 transitions, 1788 flow [2023-08-30 18:07:13,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 205.36363636363637) internal successors, (4518), 22 states have internal predecessors, (4518), 0 states have call successors, (0), 0 states have 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:07:13,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:07:13,060 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:07:13,066 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:07:13,265 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,SelfDestructingSolverStorable30 [2023-08-30 18:07:13,266 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:07:13,266 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:07:13,266 INFO L85 PathProgramCache]: Analyzing trace with hash 835738970, now seen corresponding path program 1 times [2023-08-30 18:07:13,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:07:13,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885612783] [2023-08-30 18:07:13,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:07:13,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:07:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:07:13,529 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:07:13,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:07:13,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885612783] [2023-08-30 18:07:13,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885612783] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:07:13,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137624397] [2023-08-30 18:07:13,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:07:13,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:07:13,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:07:13,531 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:07:13,556 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:07:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:07:13,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-30 18:07:13,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:07:13,674 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:07:13,722 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:07:13,723 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:07:13,739 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:07:13,814 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:07:13,869 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:07:13,900 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:07:17,562 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:07:17,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:07:27,619 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73| Int)) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73|) 0))) is different from false [2023-08-30 18:07:29,635 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1625 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73| Int)) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1625) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73|) 0))) is different from false [2023-08-30 18:07:31,655 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1623 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73| Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1623)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1625) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-30 18:07:31,709 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1625 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74| Int) (v_ArrVal_1623 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73| Int)) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73| (+ |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74| 28)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_1623)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1625) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73|) 0))) is different from false [2023-08-30 18:07:31,739 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74| Int) (v_ArrVal_1623 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73| Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1620))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_1623))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1625) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73| (+ |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74| 28)))) is different from false [2023-08-30 18:07:31,862 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-30 18:07:31,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137624397] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:07:31,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:07:31,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2023-08-30 18:07:31,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828968400] [2023-08-30 18:07:31,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:07:31,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 18:07:31,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:07:31,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 18:07:31,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=231, Unknown=12, NotChecked=180, Total=506 [2023-08-30 18:07:31,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 560 [2023-08-30 18:07:31,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 172 transitions, 1788 flow. Second operand has 23 states, 23 states have (on average 205.52173913043478) internal successors, (4727), 23 states have internal predecessors, (4727), 0 states have call successors, (0), 0 states have 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:07:31,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:07:31,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 560 [2023-08-30 18:07:31,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:07:33,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:07:34,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:07:35,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:07:40,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:07:43,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:07:44,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:07:45,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:07:52,915 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 39 DAG size of output: 25 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:07:54,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:07:55,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:07:56,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:07:57,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:07:59,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:00,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:02,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:03,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:04,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:05,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:07,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:08,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:09,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:11,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:12,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:13,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:15,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:21,211 WARN L222 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 38 DAG size of output: 24 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:08:25,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:26,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:27,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:28,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:30,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:31,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:32,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:34,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:35,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:37,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:38,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:42,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:44,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:45,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:46,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:48,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:49,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:08:53,338 INFO L130 PetriNetUnfolder]: 22626/38915 cut-off events. [2023-08-30 18:08:53,339 INFO L131 PetriNetUnfolder]: For 172220/172259 co-relation queries the response was YES. [2023-08-30 18:08:53,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172320 conditions, 38915 events. 22626/38915 cut-off events. For 172220/172259 co-relation queries the response was YES. Maximal size of possible extension queue 1569. Compared 332019 event pairs, 4314 based on Foata normal form. 159/37214 useless extension candidates. Maximal degree in co-relation 170949. Up to 14212 conditions per place. [2023-08-30 18:08:53,878 INFO L137 encePairwiseOnDemand]: 536/560 looper letters, 372 selfloop transitions, 92 changer transitions 0/472 dead transitions. [2023-08-30 18:08:53,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 472 transitions, 5396 flow [2023-08-30 18:08:53,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 18:08:53,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 18:08:53,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2451 transitions. [2023-08-30 18:08:53,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978896103896104 [2023-08-30 18:08:53,881 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2451 transitions. [2023-08-30 18:08:53,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2451 transitions. [2023-08-30 18:08:53,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:08:53,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2451 transitions. [2023-08-30 18:08:53,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 222.8181818181818) internal successors, (2451), 11 states have internal predecessors, (2451), 0 states have call successors, (0), 0 states have 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:08:53,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 560.0) internal successors, (6720), 12 states have internal predecessors, (6720), 0 states have call successors, (0), 0 states have 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:08:53,886 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 560.0) internal successors, (6720), 12 states have internal predecessors, (6720), 0 states have call successors, (0), 0 states have 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:08:53,887 INFO L175 Difference]: Start difference. First operand has 137 places, 172 transitions, 1788 flow. Second operand 11 states and 2451 transitions. [2023-08-30 18:08:53,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 472 transitions, 5396 flow [2023-08-30 18:08:54,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 472 transitions, 5360 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-30 18:08:54,133 INFO L231 Difference]: Finished difference. Result has 150 places, 221 transitions, 2687 flow [2023-08-30 18:08:54,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1758, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2687, PETRI_PLACES=150, PETRI_TRANSITIONS=221} [2023-08-30 18:08:54,134 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 63 predicate places. [2023-08-30 18:08:54,134 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 221 transitions, 2687 flow [2023-08-30 18:08:54,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 205.52173913043478) internal successors, (4727), 23 states have internal predecessors, (4727), 0 states have call successors, (0), 0 states have 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:08:54,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:08:54,135 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 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:08:54,142 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:08:54,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:08:54,341 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:08:54,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:08:54,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1383321978, now seen corresponding path program 1 times [2023-08-30 18:08:54,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:08:54,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311121685] [2023-08-30 18:08:54,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:08:54,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:08:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:08:54,551 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:08:54,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:08:54,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311121685] [2023-08-30 18:08:54,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311121685] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:08:54,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434002266] [2023-08-30 18:08:54,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:08:54,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:08:54,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:08:54,553 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:08:54,554 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:08:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:08:54,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-30 18:08:54,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:08:54,703 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:08:54,754 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:08:54,755 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:08:54,770 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:08:54,791 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:08:54,859 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:08:54,909 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:08:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-30 18:08:54,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:09:07,043 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1722 (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_1722) |c_~#cache~0.base|))) is different from false [2023-08-30 18:09:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 57 trivial. 1 not checked. [2023-08-30 18:09:07,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434002266] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:09:07,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:09:07,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2023-08-30 18:09:07,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224450218] [2023-08-30 18:09:07,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:09:07,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-30 18:09:07,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:09:07,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-30 18:09:07,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=341, Unknown=3, NotChecked=38, Total=462 [2023-08-30 18:09:07,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 560 [2023-08-30 18:09:07,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 221 transitions, 2687 flow. Second operand has 22 states, 22 states have (on average 202.0909090909091) internal successors, (4446), 22 states have internal predecessors, (4446), 0 states have call successors, (0), 0 states have 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:09:07,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:09:07,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 560 [2023-08-30 18:09:07,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:09:15,250 INFO L130 PetriNetUnfolder]: 25825/44601 cut-off events. [2023-08-30 18:09:15,250 INFO L131 PetriNetUnfolder]: For 259402/259453 co-relation queries the response was YES. [2023-08-30 18:09:15,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223480 conditions, 44601 events. 25825/44601 cut-off events. For 259402/259453 co-relation queries the response was YES. Maximal size of possible extension queue 1724. Compared 389642 event pairs, 5675 based on Foata normal form. 144/42630 useless extension candidates. Maximal degree in co-relation 221913. Up to 25479 conditions per place. [2023-08-30 18:09:15,893 INFO L137 encePairwiseOnDemand]: 546/560 looper letters, 491 selfloop transitions, 65 changer transitions 0/564 dead transitions. [2023-08-30 18:09:15,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 564 transitions, 7745 flow [2023-08-30 18:09:15,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-30 18:09:15,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-30 18:09:15,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2804 transitions. [2023-08-30 18:09:15,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3851648351648352 [2023-08-30 18:09:15,904 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2804 transitions. [2023-08-30 18:09:15,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2804 transitions. [2023-08-30 18:09:15,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:09:15,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2804 transitions. [2023-08-30 18:09:15,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 215.69230769230768) internal successors, (2804), 13 states have internal predecessors, (2804), 0 states have call successors, (0), 0 states have 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:09:15,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 560.0) internal successors, (7840), 14 states have internal predecessors, (7840), 0 states have call successors, (0), 0 states have 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:09:15,916 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 560.0) internal successors, (7840), 14 states have internal predecessors, (7840), 0 states have call successors, (0), 0 states have 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:09:15,916 INFO L175 Difference]: Start difference. First operand has 150 places, 221 transitions, 2687 flow. Second operand 13 states and 2804 transitions. [2023-08-30 18:09:15,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 564 transitions, 7745 flow [2023-08-30 18:09:16,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 564 transitions, 7665 flow, removed 18 selfloop flow, removed 4 redundant places. [2023-08-30 18:09:16,620 INFO L231 Difference]: Finished difference. Result has 166 places, 266 transitions, 3368 flow [2023-08-30 18:09:16,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=2631, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3368, PETRI_PLACES=166, PETRI_TRANSITIONS=266} [2023-08-30 18:09:16,622 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 79 predicate places. [2023-08-30 18:09:16,622 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 266 transitions, 3368 flow [2023-08-30 18:09:16,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 202.0909090909091) internal successors, (4446), 22 states have internal predecessors, (4446), 0 states have call successors, (0), 0 states have 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:09:16,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:09:16,623 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 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:09:16,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-08-30 18:09:17,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:09:17,077 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:09:17,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:09:17,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1960762675, now seen corresponding path program 1 times [2023-08-30 18:09:17,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:09:17,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265249684] [2023-08-30 18:09:17,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:09:17,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:09:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:09:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:09:17,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:09:17,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265249684] [2023-08-30 18:09:17,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265249684] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:09:17,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090559133] [2023-08-30 18:09:17,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:09:17,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:09:17,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:09:17,432 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:09:17,434 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:09:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:09:17,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-30 18:09:17,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:09:17,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:09:17,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-30 18:09:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:09:17,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:09:20,047 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (v_ArrVal_1821 Int)) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_77| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1821) |c_~#cache~0.offset|) 0))) is different from false [2023-08-30 18:09:20,063 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:09:20,064 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 23 [2023-08-30 18:09:20,073 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 6 treesize of output 4 [2023-08-30 18:09:20,084 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:09:20,084 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 28 treesize of output 32 [2023-08-30 18:09:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:09:20,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090559133] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:09:20,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:09:20,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2023-08-30 18:09:20,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711076544] [2023-08-30 18:09:20,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:09:20,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-30 18:09:20,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:09:20,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-30 18:09:20,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=612, Unknown=1, NotChecked=50, Total=756 [2023-08-30 18:09:20,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 560 [2023-08-30 18:09:20,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 266 transitions, 3368 flow. Second operand has 28 states, 28 states have (on average 195.5) internal successors, (5474), 28 states have internal predecessors, (5474), 0 states have call successors, (0), 0 states have 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:09:20,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:09:20,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 560 [2023-08-30 18:09:20,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:09:33,269 INFO L130 PetriNetUnfolder]: 39638/68037 cut-off events. [2023-08-30 18:09:33,269 INFO L131 PetriNetUnfolder]: For 458969/459061 co-relation queries the response was YES. [2023-08-30 18:09:34,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359861 conditions, 68037 events. 39638/68037 cut-off events. For 458969/459061 co-relation queries the response was YES. Maximal size of possible extension queue 2208. Compared 609203 event pairs, 7069 based on Foata normal form. 270/65024 useless extension candidates. Maximal degree in co-relation 358067. Up to 26740 conditions per place. [2023-08-30 18:09:34,336 INFO L137 encePairwiseOnDemand]: 542/560 looper letters, 1028 selfloop transitions, 368 changer transitions 3/1407 dead transitions. [2023-08-30 18:09:34,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 1407 transitions, 17733 flow [2023-08-30 18:09:34,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-08-30 18:09:34,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2023-08-30 18:09:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 10377 transitions. [2023-08-30 18:09:34,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37060714285714286 [2023-08-30 18:09:34,345 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 10377 transitions. [2023-08-30 18:09:34,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 10377 transitions. [2023-08-30 18:09:34,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:09:34,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 10377 transitions. [2023-08-30 18:09:34,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 207.54) internal successors, (10377), 50 states have internal predecessors, (10377), 0 states have call successors, (0), 0 states have 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:09:34,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 560.0) internal successors, (28560), 51 states have internal predecessors, (28560), 0 states have call successors, (0), 0 states have 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:09:34,369 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 560.0) internal successors, (28560), 51 states have internal predecessors, (28560), 0 states have call successors, (0), 0 states have 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:09:34,369 INFO L175 Difference]: Start difference. First operand has 166 places, 266 transitions, 3368 flow. Second operand 50 states and 10377 transitions. [2023-08-30 18:09:34,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 1407 transitions, 17733 flow [2023-08-30 18:09:36,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 1407 transitions, 17411 flow, removed 135 selfloop flow, removed 3 redundant places. [2023-08-30 18:09:36,710 INFO L231 Difference]: Finished difference. Result has 246 places, 588 transitions, 9000 flow [2023-08-30 18:09:36,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=3296, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=9000, PETRI_PLACES=246, PETRI_TRANSITIONS=588} [2023-08-30 18:09:36,711 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 159 predicate places. [2023-08-30 18:09:36,711 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 588 transitions, 9000 flow [2023-08-30 18:09:36,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 195.5) internal successors, (5474), 28 states have internal predecessors, (5474), 0 states have call successors, (0), 0 states have 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:09:36,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:09:36,712 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, 1, 1] [2023-08-30 18:09:36,722 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:09:36,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:09:36,918 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:09:36,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:09:36,919 INFO L85 PathProgramCache]: Analyzing trace with hash -130961342, now seen corresponding path program 1 times [2023-08-30 18:09:36,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:09:36,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587968632] [2023-08-30 18:09:36,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:09:36,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:09:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:09:37,271 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:09:37,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:09:37,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587968632] [2023-08-30 18:09:37,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587968632] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:09:37,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840191683] [2023-08-30 18:09:37,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:09:37,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:09:37,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:09:37,273 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:09:37,275 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:09:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:09:37,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 54 conjunts are in the unsatisfiable core [2023-08-30 18:09:37,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:09:37,445 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:09:37,522 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:09:37,523 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:09:37,546 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:09:37,576 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:09:37,745 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:09:37,841 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:09:37,914 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:09:37,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:09:38,209 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:09:38,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840191683] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:09:38,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:09:38,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 9] total 27 [2023-08-30 18:09:38,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868596886] [2023-08-30 18:09:38,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:09:38,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-30 18:09:38,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:09:38,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-30 18:09:38,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=672, Unknown=7, NotChecked=0, Total=812 [2023-08-30 18:09:40,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 560 [2023-08-30 18:09:40,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 588 transitions, 9000 flow. Second operand has 29 states, 29 states have (on average 210.27586206896552) internal successors, (6098), 29 states have internal predecessors, (6098), 0 states have call successors, (0), 0 states have 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:09:40,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:09:40,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 560 [2023-08-30 18:09:40,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:10:03,456 INFO L130 PetriNetUnfolder]: 52116/89391 cut-off events. [2023-08-30 18:10:03,456 INFO L131 PetriNetUnfolder]: For 983547/983657 co-relation queries the response was YES. [2023-08-30 18:10:04,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541075 conditions, 89391 events. 52116/89391 cut-off events. For 983547/983657 co-relation queries the response was YES. Maximal size of possible extension queue 2820. Compared 828591 event pairs, 7818 based on Foata normal form. 1065/85892 useless extension candidates. Maximal degree in co-relation 539061. Up to 34482 conditions per place. [2023-08-30 18:10:05,590 INFO L137 encePairwiseOnDemand]: 541/560 looper letters, 1269 selfloop transitions, 702 changer transitions 35/2014 dead transitions. [2023-08-30 18:10:05,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 2014 transitions, 30160 flow [2023-08-30 18:10:05,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2023-08-30 18:10:05,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2023-08-30 18:10:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 18424 transitions. [2023-08-30 18:10:05,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2023-08-30 18:10:05,605 INFO L72 ComplementDD]: Start complementDD. Operand 84 states and 18424 transitions. [2023-08-30 18:10:05,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 18424 transitions. [2023-08-30 18:10:05,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:10:05,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 84 states and 18424 transitions. [2023-08-30 18:10:05,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 85 states, 84 states have (on average 219.33333333333334) internal successors, (18424), 84 states have internal predecessors, (18424), 0 states have call successors, (0), 0 states have 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:05,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 85 states, 85 states have (on average 560.0) internal successors, (47600), 85 states have internal predecessors, (47600), 0 states have call successors, (0), 0 states have 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:05,652 INFO L81 ComplementDD]: Finished complementDD. Result has 85 states, 85 states have (on average 560.0) internal successors, (47600), 85 states have internal predecessors, (47600), 0 states have call successors, (0), 0 states have 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:05,652 INFO L175 Difference]: Start difference. First operand has 246 places, 588 transitions, 9000 flow. Second operand 84 states and 18424 transitions. [2023-08-30 18:10:05,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 2014 transitions, 30160 flow [2023-08-30 18:10:13,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 2014 transitions, 28538 flow, removed 479 selfloop flow, removed 10 redundant places. [2023-08-30 18:10:13,624 INFO L231 Difference]: Finished difference. Result has 364 places, 1107 transitions, 18545 flow [2023-08-30 18:10:13,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=8188, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=255, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=84, PETRI_FLOW=18545, PETRI_PLACES=364, PETRI_TRANSITIONS=1107} [2023-08-30 18:10:13,625 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 277 predicate places. [2023-08-30 18:10:13,625 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 1107 transitions, 18545 flow [2023-08-30 18:10:13,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 210.27586206896552) internal successors, (6098), 29 states have internal predecessors, (6098), 0 states have call successors, (0), 0 states have 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:13,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:10:13,626 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 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:13,632 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:10:13,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:10:13,832 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:10:13,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:10:13,832 INFO L85 PathProgramCache]: Analyzing trace with hash -218508123, now seen corresponding path program 2 times [2023-08-30 18:10:13,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:10:13,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804539730] [2023-08-30 18:10:13,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:10:13,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:10:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:10:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:10:14,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:10:14,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804539730] [2023-08-30 18:10:14,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804539730] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:10:14,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149545863] [2023-08-30 18:10:14,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 18:10:14,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:10:14,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:10:14,075 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:10:14,077 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:10:14,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 18:10:14,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:10:14,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 49 conjunts are in the unsatisfiable core [2023-08-30 18:10:14,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:10:14,244 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:14,318 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:10:14,318 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:14,337 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:14,360 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:14,496 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:10:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:10:14,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:10:16,685 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2021 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| Int)) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| v_ArrVal_2021) |c_~#cache~0.offset|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-30 18:10:16,830 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 2 not checked. [2023-08-30 18:10:16,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149545863] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:10:16,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:10:16,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 26 [2023-08-30 18:10:16,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16275875] [2023-08-30 18:10:16,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:10:16,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-30 18:10:16,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:10:16,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-30 18:10:16,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=544, Unknown=6, NotChecked=50, Total=756 [2023-08-30 18:10:16,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 560 [2023-08-30 18:10:16,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 1107 transitions, 18545 flow. Second operand has 28 states, 28 states have (on average 195.57142857142858) internal successors, (5476), 28 states have internal predecessors, (5476), 0 states have call successors, (0), 0 states have 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:16,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:10:16,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 560 [2023-08-30 18:10:16,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:10:18,820 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2021 Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2021)) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_119| Int)) (or (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_119| v_ArrVal_2020) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_119|) 0)))) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2020) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) (forall ((v_ArrVal_2021 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| Int)) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| v_ArrVal_2021) |c_~#cache~0.offset|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))))) is different from false [2023-08-30 18:10:23,014 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2021 Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2021)) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2020) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) (forall ((v_ArrVal_2021 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| Int)) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| v_ArrVal_2021) |c_~#cache~0.offset|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))))) is different from false [2023-08-30 18:10:23,636 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2021 Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2021)) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2020) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0))) is different from false [2023-08-30 18:10:43,782 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:47,154 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2021 Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_2021)) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_119| Int)) (or (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_119| v_ArrVal_2020) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_119|) 0)))) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2020) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) (= (select (select |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (forall ((v_ArrVal_2021 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| Int)) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| v_ArrVal_2021) |c_~#cache~0.offset|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))))) is different from false [2023-08-30 18:10:53,005 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:56,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:11:26,226 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_119| Int)) (or (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_119| v_ArrVal_2020) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_119|) 0)))) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2020) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) (= (select (select |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (forall ((v_ArrVal_2021 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| Int)) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| v_ArrVal_2021) |c_~#cache~0.offset|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))))) is different from false [2023-08-30 18:11:27,891 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_119| Int)) (or (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_119| v_ArrVal_2020) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_119|) 0)))) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2020) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) (forall ((v_ArrVal_2021 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| Int)) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| v_ArrVal_2021) |c_~#cache~0.offset|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))))) is different from false Killed by 15