./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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 ../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ecda181bd3fe1882667151a04232fb9d04292dd6ca3491d98fdc8de5d539856a --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:34:20,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:34:20,608 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:34:20,644 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:34:20,645 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:34:20,646 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:34:20,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:34:20,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:34:20,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:34:20,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:34:20,668 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:34:20,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:34:20,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:34:20,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:34:20,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:34:20,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:34:20,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:34:20,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:34:20,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:34:20,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:34:20,689 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:34:20,691 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:34:20,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:34:20,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:34:20,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:34:20,701 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:34:20,701 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:34:20,702 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:34:20,703 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:34:20,704 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:34:20,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:34:20,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:34:20,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:34:20,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:34:20,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:34:20,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:34:20,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:34:20,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:34:20,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:34:20,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:34:20,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:34:20,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:34:20,713 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:34:20,743 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:34:20,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:34:20,744 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:34:20,744 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:34:20,745 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:34:20,745 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:34:20,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:34:20,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:34:20,746 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:34:20,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:34:20,747 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:34:20,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:34:20,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:34:20,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:34:20,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:34:20,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:34:20,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:34:20,749 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:34:20,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:34:20,750 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:34:20,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:34:20,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:34:20,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:34:20,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:34:20,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:34:20,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:34:20,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:34:20,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:34:20,752 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:34:20,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:34:20,752 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:34:20,753 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:34:20,753 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:34:20,753 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> ecda181bd3fe1882667151a04232fb9d04292dd6ca3491d98fdc8de5d539856a [2022-07-12 10:34:20,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:34:21,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:34:21,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:34:21,030 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:34:21,031 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:34:21,032 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2022-07-12 10:34:21,124 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7e484696/e1abfe85e1d045eeb4a853b404b72622/FLAG865f6e938 [2022-07-12 10:34:21,495 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:34:21,495 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2022-07-12 10:34:21,505 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7e484696/e1abfe85e1d045eeb4a853b404b72622/FLAG865f6e938 [2022-07-12 10:34:21,907 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7e484696/e1abfe85e1d045eeb4a853b404b72622 [2022-07-12 10:34:21,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:34:21,911 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:34:21,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:34:21,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:34:21,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:34:21,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:34:21" (1/1) ... [2022-07-12 10:34:21,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@593e25d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:21, skipping insertion in model container [2022-07-12 10:34:21,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:34:21" (1/1) ... [2022-07-12 10:34:21,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:34:21,946 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:34:22,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2022-07-12 10:34:22,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:34:22,176 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:34:22,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2022-07-12 10:34:22,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:34:22,238 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:34:22,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:22 WrapperNode [2022-07-12 10:34:22,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:34:22,241 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:34:22,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:34:22,241 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:34:22,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:22" (1/1) ... [2022-07-12 10:34:22,266 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:22" (1/1) ... [2022-07-12 10:34:22,295 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-07-12 10:34:22,296 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:34:22,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:34:22,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:34:22,297 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:34:22,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:22" (1/1) ... [2022-07-12 10:34:22,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:22" (1/1) ... [2022-07-12 10:34:22,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:22" (1/1) ... [2022-07-12 10:34:22,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:22" (1/1) ... [2022-07-12 10:34:22,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:22" (1/1) ... [2022-07-12 10:34:22,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:22" (1/1) ... [2022-07-12 10:34:22,346 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:22" (1/1) ... [2022-07-12 10:34:22,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:34:22,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:34:22,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:34:22,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:34:22,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:22" (1/1) ... [2022-07-12 10:34:22,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:34:22,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:34:22,397 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) [2022-07-12 10:34:22,404 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 [2022-07-12 10:34:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:34:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-12 10:34:22,432 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-12 10:34:22,432 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-12 10:34:22,432 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-12 10:34:22,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:34:22,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:34:22,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:34:22,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:34:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:34:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 10:34:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:34:22,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:34:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:34:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:34:22,435 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:34:22,528 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:34:22,529 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:34:22,786 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:34:22,906 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:34:22,906 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-12 10:34:22,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:34:22 BoogieIcfgContainer [2022-07-12 10:34:22,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:34:22,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:34:22,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:34:22,915 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:34:22,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:34:21" (1/3) ... [2022-07-12 10:34:22,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe1f4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:34:22, skipping insertion in model container [2022-07-12 10:34:22,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:34:22" (2/3) ... [2022-07-12 10:34:22,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe1f4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:34:22, skipping insertion in model container [2022-07-12 10:34:22,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:34:22" (3/3) ... [2022-07-12 10:34:22,918 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2022-07-12 10:34:22,927 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:34:22,936 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:34:22,936 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 10:34:22,937 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:34:23,021 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-12 10:34:23,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 181 places, 189 transitions, 394 flow [2022-07-12 10:34:23,158 INFO L129 PetriNetUnfolder]: 15/187 cut-off events. [2022-07-12 10:34:23,158 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-12 10:34:23,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 187 events. 15/187 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 152. Up to 2 conditions per place. [2022-07-12 10:34:23,163 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 189 transitions, 394 flow [2022-07-12 10:34:23,170 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 178 transitions, 368 flow [2022-07-12 10:34:23,187 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:34:23,196 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d458c7a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4af71584 [2022-07-12 10:34:23,196 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-12 10:34:23,238 INFO L129 PetriNetUnfolder]: 15/177 cut-off events. [2022-07-12 10:34:23,243 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-12 10:34:23,243 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:34:23,244 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:34:23,245 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:34:23,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:34:23,252 INFO L85 PathProgramCache]: Analyzing trace with hash 577602676, now seen corresponding path program 1 times [2022-07-12 10:34:23,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:34:23,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903908757] [2022-07-12 10:34:23,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:34:23,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:34:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:34:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:34:23,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:34:23,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903908757] [2022-07-12 10:34:23,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903908757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:34:23,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:34:23,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:34:23,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280918841] [2022-07-12 10:34:23,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:34:23,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 10:34:23,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:34:23,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 10:34:23,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 10:34:23,536 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 189 [2022-07-12 10:34:23,550 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 178 transitions, 368 flow. Second operand has 2 states, 2 states have (on average 174.5) internal successors, (349), 2 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:23,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:34:23,552 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 189 [2022-07-12 10:34:23,553 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:34:23,625 INFO L129 PetriNetUnfolder]: 14/193 cut-off events. [2022-07-12 10:34:23,626 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-07-12 10:34:23,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 193 events. 14/193 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 172 event pairs, 3 based on Foata normal form. 15/194 useless extension candidates. Maximal degree in co-relation 147. Up to 20 conditions per place. [2022-07-12 10:34:23,628 INFO L132 encePairwiseOnDemand]: 179/189 looper letters, 7 selfloop transitions, 0 changer transitions 6/168 dead transitions. [2022-07-12 10:34:23,629 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 168 transitions, 362 flow [2022-07-12 10:34:23,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 10:34:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-12 10:34:23,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 359 transitions. [2022-07-12 10:34:23,645 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9497354497354498 [2022-07-12 10:34:23,646 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 359 transitions. [2022-07-12 10:34:23,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 359 transitions. [2022-07-12 10:34:23,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:34:23,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 359 transitions. [2022-07-12 10:34:23,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 179.5) internal successors, (359), 2 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:23,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:23,664 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:23,666 INFO L186 Difference]: Start difference. First operand has 170 places, 178 transitions, 368 flow. Second operand 2 states and 359 transitions. [2022-07-12 10:34:23,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 168 transitions, 362 flow [2022-07-12 10:34:23,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 168 transitions, 354 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-12 10:34:23,676 INFO L242 Difference]: Finished difference. Result has 167 places, 162 transitions, 328 flow [2022-07-12 10:34:23,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=328, PETRI_PLACES=167, PETRI_TRANSITIONS=162} [2022-07-12 10:34:23,683 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -3 predicate places. [2022-07-12 10:34:23,683 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 328 flow [2022-07-12 10:34:23,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 174.5) internal successors, (349), 2 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:23,684 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:34:23,685 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:34:23,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:34:23,685 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:34:23,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:34:23,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1660907215, now seen corresponding path program 1 times [2022-07-12 10:34:23,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:34:23,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876652119] [2022-07-12 10:34:23,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:34:23,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:34:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:34:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:34:24,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:34:24,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876652119] [2022-07-12 10:34:24,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876652119] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:34:24,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:34:24,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:34:24,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263233186] [2022-07-12 10:34:24,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:34:24,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:34:24,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:34:24,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:34:24,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:34:24,081 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 189 [2022-07-12 10:34:24,082 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 162 transitions, 328 flow. Second operand has 6 states, 6 states have (on average 136.66666666666666) internal successors, (820), 6 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:24,082 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:34:24,083 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 189 [2022-07-12 10:34:24,083 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:34:24,325 INFO L129 PetriNetUnfolder]: 56/309 cut-off events. [2022-07-12 10:34:24,326 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-12 10:34:24,327 INFO L84 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 309 events. 56/309 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 848 event pairs, 12 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 445. Up to 64 conditions per place. [2022-07-12 10:34:24,328 INFO L132 encePairwiseOnDemand]: 183/189 looper letters, 45 selfloop transitions, 5 changer transitions 0/171 dead transitions. [2022-07-12 10:34:24,329 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 171 transitions, 447 flow [2022-07-12 10:34:24,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 10:34:24,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-12 10:34:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 837 transitions. [2022-07-12 10:34:24,333 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2022-07-12 10:34:24,333 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 837 transitions. [2022-07-12 10:34:24,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 837 transitions. [2022-07-12 10:34:24,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:34:24,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 837 transitions. [2022-07-12 10:34:24,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.5) internal successors, (837), 6 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:24,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:24,340 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:24,341 INFO L186 Difference]: Start difference. First operand has 167 places, 162 transitions, 328 flow. Second operand 6 states and 837 transitions. [2022-07-12 10:34:24,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 171 transitions, 447 flow [2022-07-12 10:34:24,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 171 transitions, 447 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:34:24,345 INFO L242 Difference]: Finished difference. Result has 167 places, 163 transitions, 346 flow [2022-07-12 10:34:24,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=346, PETRI_PLACES=167, PETRI_TRANSITIONS=163} [2022-07-12 10:34:24,346 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -3 predicate places. [2022-07-12 10:34:24,346 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 163 transitions, 346 flow [2022-07-12 10:34:24,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 136.66666666666666) internal successors, (820), 6 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:24,347 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:34:24,347 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:34:24,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:34:24,348 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:34:24,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:34:24,349 INFO L85 PathProgramCache]: Analyzing trace with hash 730860721, now seen corresponding path program 1 times [2022-07-12 10:34:24,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:34:24,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382389724] [2022-07-12 10:34:24,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:34:24,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:34:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:34:24,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:34:24,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:34:24,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382389724] [2022-07-12 10:34:24,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382389724] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:34:24,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:34:24,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:34:24,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387483935] [2022-07-12 10:34:24,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:34:24,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:34:24,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:34:24,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:34:24,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:34:24,502 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 189 [2022-07-12 10:34:24,503 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 163 transitions, 346 flow. Second operand has 7 states, 7 states have (on average 141.14285714285714) internal successors, (988), 7 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:24,503 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:34:24,503 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 189 [2022-07-12 10:34:24,503 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:34:24,669 INFO L129 PetriNetUnfolder]: 57/353 cut-off events. [2022-07-12 10:34:24,670 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-07-12 10:34:24,672 INFO L84 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 353 events. 57/353 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 981 event pairs, 12 based on Foata normal form. 4/338 useless extension candidates. Maximal degree in co-relation 525. Up to 60 conditions per place. [2022-07-12 10:34:24,673 INFO L132 encePairwiseOnDemand]: 179/189 looper letters, 46 selfloop transitions, 8 changer transitions 7/182 dead transitions. [2022-07-12 10:34:24,673 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 182 transitions, 511 flow [2022-07-12 10:34:24,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:34:24,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-12 10:34:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1158 transitions. [2022-07-12 10:34:24,686 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7658730158730159 [2022-07-12 10:34:24,686 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1158 transitions. [2022-07-12 10:34:24,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1158 transitions. [2022-07-12 10:34:24,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:34:24,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1158 transitions. [2022-07-12 10:34:24,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 144.75) internal successors, (1158), 8 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:24,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 189.0) internal successors, (1701), 9 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:24,697 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 189.0) internal successors, (1701), 9 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:24,697 INFO L186 Difference]: Start difference. First operand has 167 places, 163 transitions, 346 flow. Second operand 8 states and 1158 transitions. [2022-07-12 10:34:24,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 182 transitions, 511 flow [2022-07-12 10:34:24,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 182 transitions, 501 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-12 10:34:24,702 INFO L242 Difference]: Finished difference. Result has 172 places, 164 transitions, 364 flow [2022-07-12 10:34:24,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=364, PETRI_PLACES=172, PETRI_TRANSITIONS=164} [2022-07-12 10:34:24,705 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 2 predicate places. [2022-07-12 10:34:24,705 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 164 transitions, 364 flow [2022-07-12 10:34:24,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 141.14285714285714) internal successors, (988), 7 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:24,706 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:34:24,706 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:34:24,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:34:24,709 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:34:24,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:34:24,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1033182428, now seen corresponding path program 1 times [2022-07-12 10:34:24,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:34:24,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697003059] [2022-07-12 10:34:24,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:34:24,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:34:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:34:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:34:24,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:34:24,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697003059] [2022-07-12 10:34:24,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697003059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:34:24,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:34:24,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 10:34:24,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019418250] [2022-07-12 10:34:24,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:34:24,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:34:24,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:34:24,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:34:24,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 10:34:24,885 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 189 [2022-07-12 10:34:24,886 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 164 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:24,887 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:34:24,888 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 189 [2022-07-12 10:34:24,888 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:34:25,036 INFO L129 PetriNetUnfolder]: 156/581 cut-off events. [2022-07-12 10:34:25,037 INFO L130 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-07-12 10:34:25,038 INFO L84 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 581 events. 156/581 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2610 event pairs, 14 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 959. Up to 141 conditions per place. [2022-07-12 10:34:25,042 INFO L132 encePairwiseOnDemand]: 183/189 looper letters, 44 selfloop transitions, 11 changer transitions 0/194 dead transitions. [2022-07-12 10:34:25,042 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 194 transitions, 558 flow [2022-07-12 10:34:25,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:34:25,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-12 10:34:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 823 transitions. [2022-07-12 10:34:25,045 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.870899470899471 [2022-07-12 10:34:25,045 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 823 transitions. [2022-07-12 10:34:25,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 823 transitions. [2022-07-12 10:34:25,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:34:25,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 823 transitions. [2022-07-12 10:34:25,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:25,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:25,055 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:25,055 INFO L186 Difference]: Start difference. First operand has 172 places, 164 transitions, 364 flow. Second operand 5 states and 823 transitions. [2022-07-12 10:34:25,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 194 transitions, 558 flow [2022-07-12 10:34:25,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 194 transitions, 534 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-07-12 10:34:25,060 INFO L242 Difference]: Finished difference. Result has 172 places, 174 transitions, 437 flow [2022-07-12 10:34:25,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=437, PETRI_PLACES=172, PETRI_TRANSITIONS=174} [2022-07-12 10:34:25,061 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 2 predicate places. [2022-07-12 10:34:25,062 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 174 transitions, 437 flow [2022-07-12 10:34:25,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:25,062 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:34:25,063 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:34:25,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:34:25,063 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:34:25,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:34:25,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2124401224, now seen corresponding path program 2 times [2022-07-12 10:34:25,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:34:25,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529936059] [2022-07-12 10:34:25,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:34:25,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:34:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:34:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:34:25,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:34:25,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529936059] [2022-07-12 10:34:25,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529936059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:34:25,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:34:25,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 10:34:25,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893238297] [2022-07-12 10:34:25,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:34:25,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:34:25,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:34:25,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:34:25,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:34:25,163 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 189 [2022-07-12 10:34:25,164 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 174 transitions, 437 flow. Second operand has 5 states, 5 states have (on average 144.2) internal successors, (721), 5 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:25,164 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:34:25,164 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 189 [2022-07-12 10:34:25,164 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:34:25,293 INFO L129 PetriNetUnfolder]: 106/528 cut-off events. [2022-07-12 10:34:25,293 INFO L130 PetriNetUnfolder]: For 330/355 co-relation queries the response was YES. [2022-07-12 10:34:25,295 INFO L84 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 528 events. 106/528 cut-off events. For 330/355 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2395 event pairs, 13 based on Foata normal form. 8/515 useless extension candidates. Maximal degree in co-relation 985. Up to 100 conditions per place. [2022-07-12 10:34:25,298 INFO L132 encePairwiseOnDemand]: 184/189 looper letters, 51 selfloop transitions, 2 changer transitions 4/190 dead transitions. [2022-07-12 10:34:25,298 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 190 transitions, 630 flow [2022-07-12 10:34:25,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:34:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-12 10:34:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 734 transitions. [2022-07-12 10:34:25,301 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7767195767195767 [2022-07-12 10:34:25,301 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 734 transitions. [2022-07-12 10:34:25,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 734 transitions. [2022-07-12 10:34:25,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:34:25,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 734 transitions. [2022-07-12 10:34:25,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.8) internal successors, (734), 5 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:25,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:25,306 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:25,306 INFO L186 Difference]: Start difference. First operand has 172 places, 174 transitions, 437 flow. Second operand 5 states and 734 transitions. [2022-07-12 10:34:25,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 190 transitions, 630 flow [2022-07-12 10:34:25,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 190 transitions, 630 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:34:25,313 INFO L242 Difference]: Finished difference. Result has 179 places, 175 transitions, 453 flow [2022-07-12 10:34:25,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=453, PETRI_PLACES=179, PETRI_TRANSITIONS=175} [2022-07-12 10:34:25,316 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 9 predicate places. [2022-07-12 10:34:25,316 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 175 transitions, 453 flow [2022-07-12 10:34:25,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.2) internal successors, (721), 5 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:25,317 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:34:25,317 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:34:25,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:34:25,318 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:34:25,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:34:25,319 INFO L85 PathProgramCache]: Analyzing trace with hash -8030758, now seen corresponding path program 1 times [2022-07-12 10:34:25,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:34:25,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787981768] [2022-07-12 10:34:25,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:34:25,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:34:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:34:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:34:25,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:34:25,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787981768] [2022-07-12 10:34:25,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787981768] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:34:25,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:34:25,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:34:25,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851861929] [2022-07-12 10:34:25,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:34:25,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:34:25,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:34:25,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:34:25,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:34:25,403 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 189 [2022-07-12 10:34:25,403 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 175 transitions, 453 flow. Second operand has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:25,404 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:34:25,404 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 189 [2022-07-12 10:34:25,404 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:34:25,488 INFO L129 PetriNetUnfolder]: 78/488 cut-off events. [2022-07-12 10:34:25,488 INFO L130 PetriNetUnfolder]: For 286/308 co-relation queries the response was YES. [2022-07-12 10:34:25,490 INFO L84 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 488 events. 78/488 cut-off events. For 286/308 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1966 event pairs, 9 based on Foata normal form. 11/480 useless extension candidates. Maximal degree in co-relation 880. Up to 106 conditions per place. [2022-07-12 10:34:25,492 INFO L132 encePairwiseOnDemand]: 186/189 looper letters, 29 selfloop transitions, 2 changer transitions 2/185 dead transitions. [2022-07-12 10:34:25,492 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 185 transitions, 570 flow [2022-07-12 10:34:25,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:34:25,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:34:25,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2022-07-12 10:34:25,494 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.908289241622575 [2022-07-12 10:34:25,494 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 515 transitions. [2022-07-12 10:34:25,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 515 transitions. [2022-07-12 10:34:25,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:34:25,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 515 transitions. [2022-07-12 10:34:25,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:25,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:25,497 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:25,498 INFO L186 Difference]: Start difference. First operand has 179 places, 175 transitions, 453 flow. Second operand 3 states and 515 transitions. [2022-07-12 10:34:25,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 185 transitions, 570 flow [2022-07-12 10:34:25,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 185 transitions, 564 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-07-12 10:34:25,504 INFO L242 Difference]: Finished difference. Result has 177 places, 176 transitions, 463 flow [2022-07-12 10:34:25,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=463, PETRI_PLACES=177, PETRI_TRANSITIONS=176} [2022-07-12 10:34:25,507 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 7 predicate places. [2022-07-12 10:34:25,507 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 176 transitions, 463 flow [2022-07-12 10:34:25,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:25,508 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:34:25,508 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:34:25,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:34:25,509 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:34:25,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:34:25,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1086060663, now seen corresponding path program 1 times [2022-07-12 10:34:25,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:34:25,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565639999] [2022-07-12 10:34:25,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:34:25,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:34:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:34:25,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:34:25,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:34:25,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565639999] [2022-07-12 10:34:25,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565639999] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:34:25,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:34:25,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:34:25,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354557921] [2022-07-12 10:34:25,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:34:25,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:34:25,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:34:25,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:34:25,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:34:25,612 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 189 [2022-07-12 10:34:25,613 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 176 transitions, 463 flow. Second operand has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:25,613 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:34:25,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 189 [2022-07-12 10:34:25,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:34:25,774 INFO L129 PetriNetUnfolder]: 77/620 cut-off events. [2022-07-12 10:34:25,775 INFO L130 PetriNetUnfolder]: For 367/396 co-relation queries the response was YES. [2022-07-12 10:34:25,777 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 620 events. 77/620 cut-off events. For 367/396 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2606 event pairs, 16 based on Foata normal form. 15/608 useless extension candidates. Maximal degree in co-relation 1125. Up to 110 conditions per place. [2022-07-12 10:34:25,779 INFO L132 encePairwiseOnDemand]: 179/189 looper letters, 38 selfloop transitions, 8 changer transitions 22/202 dead transitions. [2022-07-12 10:34:25,779 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 202 transitions, 685 flow [2022-07-12 10:34:25,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:34:25,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:34:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1361 transitions. [2022-07-12 10:34:25,783 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8001175778953556 [2022-07-12 10:34:25,783 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1361 transitions. [2022-07-12 10:34:25,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1361 transitions. [2022-07-12 10:34:25,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:34:25,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1361 transitions. [2022-07-12 10:34:25,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 151.22222222222223) internal successors, (1361), 9 states have internal predecessors, (1361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:25,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 189.0) internal successors, (1890), 10 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:25,791 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 189.0) internal successors, (1890), 10 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:25,791 INFO L186 Difference]: Start difference. First operand has 177 places, 176 transitions, 463 flow. Second operand 9 states and 1361 transitions. [2022-07-12 10:34:25,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 202 transitions, 685 flow [2022-07-12 10:34:25,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 202 transitions, 683 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:34:25,799 INFO L242 Difference]: Finished difference. Result has 186 places, 177 transitions, 489 flow [2022-07-12 10:34:25,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=489, PETRI_PLACES=186, PETRI_TRANSITIONS=177} [2022-07-12 10:34:25,800 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 16 predicate places. [2022-07-12 10:34:25,801 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 177 transitions, 489 flow [2022-07-12 10:34:25,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:25,802 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:34:25,802 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:34:25,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:34:25,802 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:34:25,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:34:25,803 INFO L85 PathProgramCache]: Analyzing trace with hash -751624308, now seen corresponding path program 1 times [2022-07-12 10:34:25,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:34:25,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020859559] [2022-07-12 10:34:25,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:34:25,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:34:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:34:27,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:34:27,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:34:27,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020859559] [2022-07-12 10:34:27,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020859559] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:34:27,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020726804] [2022-07-12 10:34:27,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:34:27,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:34:27,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:34:27,536 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) [2022-07-12 10:34:27,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 10:34:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:34:27,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-12 10:34:27,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:34:29,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 10:34:29,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:34:29,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:34:29,802 INFO L356 Elim1Store]: treesize reduction 23, result has 77.2 percent of original size [2022-07-12 10:34:29,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 101 [2022-07-12 10:34:31,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:34:31,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020726804] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:34:31,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:34:31,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 19] total 63 [2022-07-12 10:34:31,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298436560] [2022-07-12 10:34:31,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:34:31,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-12 10:34:31,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:34:31,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-12 10:34:31,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=3361, Unknown=0, NotChecked=0, Total=3906 [2022-07-12 10:34:31,371 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 189 [2022-07-12 10:34:31,375 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 177 transitions, 489 flow. Second operand has 63 states, 63 states have (on average 59.476190476190474) internal successors, (3747), 63 states have internal predecessors, (3747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:31,376 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:34:31,376 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 189 [2022-07-12 10:34:31,376 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:34:45,950 INFO L129 PetriNetUnfolder]: 9164/17955 cut-off events. [2022-07-12 10:34:45,950 INFO L130 PetriNetUnfolder]: For 11386/11386 co-relation queries the response was YES. [2022-07-12 10:34:46,012 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45147 conditions, 17955 events. 9164/17955 cut-off events. For 11386/11386 co-relation queries the response was YES. Maximal size of possible extension queue 861. Compared 165866 event pairs, 721 based on Foata normal form. 32/17327 useless extension candidates. Maximal degree in co-relation 45133. Up to 2845 conditions per place. [2022-07-12 10:34:46,096 INFO L132 encePairwiseOnDemand]: 142/189 looper letters, 825 selfloop transitions, 284 changer transitions 218/1376 dead transitions. [2022-07-12 10:34:46,096 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 1376 transitions, 7649 flow [2022-07-12 10:34:46,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-07-12 10:34:46,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2022-07-12 10:34:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 8023 transitions. [2022-07-12 10:34:46,117 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.3395978835978836 [2022-07-12 10:34:46,117 INFO L72 ComplementDD]: Start complementDD. Operand 125 states and 8023 transitions. [2022-07-12 10:34:46,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 8023 transitions. [2022-07-12 10:34:46,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:34:46,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 125 states and 8023 transitions. [2022-07-12 10:34:46,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 126 states, 125 states have (on average 64.184) internal successors, (8023), 125 states have internal predecessors, (8023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:46,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 126 states, 126 states have (on average 189.0) internal successors, (23814), 126 states have internal predecessors, (23814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:46,231 INFO L81 ComplementDD]: Finished complementDD. Result has 126 states, 126 states have (on average 189.0) internal successors, (23814), 126 states have internal predecessors, (23814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:46,231 INFO L186 Difference]: Start difference. First operand has 186 places, 177 transitions, 489 flow. Second operand 125 states and 8023 transitions. [2022-07-12 10:34:46,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 1376 transitions, 7649 flow [2022-07-12 10:34:46,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 1376 transitions, 7615 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-07-12 10:34:46,282 INFO L242 Difference]: Finished difference. Result has 371 places, 492 transitions, 3069 flow [2022-07-12 10:34:46,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=125, PETRI_FLOW=3069, PETRI_PLACES=371, PETRI_TRANSITIONS=492} [2022-07-12 10:34:46,284 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 201 predicate places. [2022-07-12 10:34:46,285 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 492 transitions, 3069 flow [2022-07-12 10:34:46,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 59.476190476190474) internal successors, (3747), 63 states have internal predecessors, (3747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:34:46,298 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:34:46,298 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:34:46,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 10:34:46,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:34:46,512 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:34:46,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:34:46,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1738378008, now seen corresponding path program 2 times [2022-07-12 10:34:46,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:34:46,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170606825] [2022-07-12 10:34:46,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:34:46,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:34:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:34:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:34:47,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:34:47,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170606825] [2022-07-12 10:34:47,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170606825] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:34:47,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484274479] [2022-07-12 10:34:47,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:34:47,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:34:47,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:34:47,902 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) [2022-07-12 10:34:47,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 10:34:48,083 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:34:48,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:34:48,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-12 10:34:48,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:34:48,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:34:48,658 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 10:34:48,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 10:34:49,654 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:34:49,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 10:34:50,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:34:50,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 10:34:50,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 10:34:50,977 INFO L356 Elim1Store]: treesize reduction 14, result has 65.9 percent of original size [2022-07-12 10:34:50,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 36 [2022-07-12 10:34:51,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:34:51,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:34:53,001 INFO L356 Elim1Store]: treesize reduction 25, result has 84.2 percent of original size [2022-07-12 10:34:53,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1871 treesize of output 1727 [2022-07-12 10:34:53,045 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:34:53,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 792 treesize of output 732 [2022-07-12 10:34:53,074 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:34:53,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 748 treesize of output 580 [2022-07-12 10:34:56,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 10 [2022-07-12 10:34:56,096 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-12 10:34:56,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 4 [2022-07-12 10:34:56,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-07-12 10:34:56,116 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 10:34:56,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-07-12 10:34:56,150 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-12 10:34:56,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 4 [2022-07-12 10:34:56,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-07-12 10:34:56,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-07-12 10:34:56,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-07-12 10:34:56,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 10 [2022-07-12 10:34:56,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-07-12 10:34:56,250 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 10:34:56,262 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-12 10:34:56,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 4 [2022-07-12 10:35:02,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-12 10:35:02,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-12 10:35:02,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:35:02,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484274479] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:35:02,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:35:02,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 36, 32] total 89 [2022-07-12 10:35:02,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483821098] [2022-07-12 10:35:02,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:35:02,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-07-12 10:35:02,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:35:02,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-07-12 10:35:02,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=770, Invalid=7035, Unknown=27, NotChecked=0, Total=7832 [2022-07-12 10:35:02,408 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 189 [2022-07-12 10:35:02,413 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 492 transitions, 3069 flow. Second operand has 89 states, 89 states have (on average 56.449438202247194) internal successors, (5024), 89 states have internal predecessors, (5024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:35:02,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:35:02,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 189 [2022-07-12 10:35:02,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:35:23,906 INFO L129 PetriNetUnfolder]: 14333/26467 cut-off events. [2022-07-12 10:35:23,906 INFO L130 PetriNetUnfolder]: For 245732/245798 co-relation queries the response was YES. [2022-07-12 10:35:24,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122482 conditions, 26467 events. 14333/26467 cut-off events. For 245732/245798 co-relation queries the response was YES. Maximal size of possible extension queue 1262. Compared 246900 event pairs, 2578 based on Foata normal form. 26/26449 useless extension candidates. Maximal degree in co-relation 122400. Up to 14573 conditions per place. [2022-07-12 10:35:24,576 INFO L132 encePairwiseOnDemand]: 131/189 looper letters, 956 selfloop transitions, 545 changer transitions 39/1587 dead transitions. [2022-07-12 10:35:24,576 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 1587 transitions, 14762 flow [2022-07-12 10:35:24,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-07-12 10:35:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2022-07-12 10:35:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 7520 transitions. [2022-07-12 10:35:24,596 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.3084368975841844 [2022-07-12 10:35:24,597 INFO L72 ComplementDD]: Start complementDD. Operand 129 states and 7520 transitions. [2022-07-12 10:35:24,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 7520 transitions. [2022-07-12 10:35:24,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:35:24,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 129 states and 7520 transitions. [2022-07-12 10:35:24,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 130 states, 129 states have (on average 58.29457364341085) internal successors, (7520), 129 states have internal predecessors, (7520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:35:24,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 130 states, 130 states have (on average 189.0) internal successors, (24570), 130 states have internal predecessors, (24570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:35:24,663 INFO L81 ComplementDD]: Finished complementDD. Result has 130 states, 130 states have (on average 189.0) internal successors, (24570), 130 states have internal predecessors, (24570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:35:24,663 INFO L186 Difference]: Start difference. First operand has 371 places, 492 transitions, 3069 flow. Second operand 129 states and 7520 transitions. [2022-07-12 10:35:24,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 1587 transitions, 14762 flow [2022-07-12 10:35:25,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 1587 transitions, 13538 flow, removed 576 selfloop flow, removed 30 redundant places. [2022-07-12 10:35:25,839 INFO L242 Difference]: Finished difference. Result has 493 places, 1007 transitions, 8667 flow [2022-07-12 10:35:25,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=2726, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=129, PETRI_FLOW=8667, PETRI_PLACES=493, PETRI_TRANSITIONS=1007} [2022-07-12 10:35:25,840 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 323 predicate places. [2022-07-12 10:35:25,840 INFO L495 AbstractCegarLoop]: Abstraction has has 493 places, 1007 transitions, 8667 flow [2022-07-12 10:35:25,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 56.449438202247194) internal successors, (5024), 89 states have internal predecessors, (5024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:35:25,842 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:35:25,842 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:35:25,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 10:35:26,042 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,SelfDestructingSolverStorable8 [2022-07-12 10:35:26,043 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:35:26,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:35:26,044 INFO L85 PathProgramCache]: Analyzing trace with hash -620764720, now seen corresponding path program 3 times [2022-07-12 10:35:26,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:35:26,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721434902] [2022-07-12 10:35:26,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:35:26,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:35:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:35:27,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:35:27,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:35:27,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721434902] [2022-07-12 10:35:27,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721434902] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:35:27,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064783548] [2022-07-12 10:35:27,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 10:35:27,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:35:27,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:35:27,154 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) [2022-07-12 10:35:27,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 10:35:27,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-12 10:35:27,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:35:27,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-12 10:35:27,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:35:27,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:35:27,309 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 10:35:27,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 10:35:27,726 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-07-12 10:35:27,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-07-12 10:35:27,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-12 10:35:28,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:35:28,659 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-12 10:35:28,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 21 [2022-07-12 10:35:28,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:35:29,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:35:30,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:35:30,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 10:35:30,900 INFO L356 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2022-07-12 10:35:30,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 13 [2022-07-12 10:35:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:35:30,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:35:31,605 WARN L833 $PredicateComparison]: unable to prove that (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (not (<= 0 c_~end~0)) (and (or (forall ((v_ArrVal_200 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select (select .cse0 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)))))) (not (= (mod c_~ok~0 256) 0))) (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse1 (select .cse2 c_~queue~0.base))) (or (<= (select .cse1 (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0) (not (= (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select .cse1 (+ (* c_~end~0 4) c_~queue~0.offset))))))))) (<= c_~n~0 c_~start~0)) is different from false [2022-07-12 10:35:31,898 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (and (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199)) (.cse1 (+ (* ~i~0 4) ~A~0.offset))) (or (not (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse0 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse0 c_~A~0.base) .cse1)))) (< c_~last~0 (select (select .cse2 c_~A~0.base) .cse1))))) (not (= (mod c_~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int))) (or (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse3 (select .cse4 c_~queue~0.base))) (or (not (= (select .cse3 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse4 c_~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (select .cse3 (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))))) (< c_~last~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) c_~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-07-12 10:35:31,996 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (and (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse0 (select .cse1 c_~queue~0.base)) (.cse2 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 c_~A~0.base) .cse2))) (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select .cse3 c_~A~0.base) .cse2))))))) (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (not (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse4 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse4 c_~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (= (mod c_~ok~0 256) 0)))) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-07-12 10:35:32,280 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (not (<= 0 c_~end~0)) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (not (<= v_~A~0.base_19 |c_ULTIMATE.start_main_#t~ret13#1.base|)) (not (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse0 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse0 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)))))))) (forall ((v_~A~0.base_19 Int)) (or (not (<= v_~A~0.base_19 |c_ULTIMATE.start_main_#t~ret13#1.base|)) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse1 (select .cse4 c_~queue~0.base)) (.cse3 (+ (* ~i~0 4) ~A~0.offset))) (or (<= (select .cse1 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select .cse2 v_~A~0.base_19) .cse3)) (not (= (select .cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse4 v_~A~0.base_19) .cse3))))))))))) (<= c_~n~0 c_~start~0)) is different from false [2022-07-12 10:35:32,342 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (and (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse0 (select .cse3 c_~queue~0.base)) (.cse2 (+ (* ~i~0 4) ~A~0.offset))) (or (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select .cse1 v_~A~0.base_19) .cse2)) (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse3 v_~A~0.base_19) .cse2))) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| v_~A~0.base_19)))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (not (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse4 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse4 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset))))) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| v_~A~0.base_19))))) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-07-12 10:35:32,377 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse0 (select .cse3 c_~queue~0.base)) (.cse2 (+ (* ~i~0 4) ~A~0.offset))) (or (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select .cse1 v_~A~0.base_19) .cse2)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19) (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse3 v_~A~0.base_19) .cse2)))))))) (or (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19) (not (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse4 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse4 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset))))))) (not (= (mod c_~ok~0 256) 0)))) (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-07-12 10:35:32,553 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (and (or (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_198 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (not (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_198) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse0 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse0 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset))))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19))) (not (= (mod c_~ok~0 256) 0))) (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_198 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_198) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (let ((.cse1 (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse3 (select .cse1 c_~queue~0.base)) (.cse2 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select (select .cse1 v_~A~0.base_19) .cse2) (select .cse3 (+ (* c_~end~0 4) c_~queue~0.offset)))) (<= (select .cse3 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select .cse4 v_~A~0.base_19) .cse2)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19))))))) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-07-12 10:35:32,706 WARN L833 $PredicateComparison]: unable to prove that (or (and (or (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_198 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (not (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_ArrVal_198) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse0 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse0 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset))))) (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_~A~0.base_19))) (not (= (mod c_~ok~0 256) 0))) (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (~i~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_198 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_ArrVal_198) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse1 (select .cse2 c_~queue~0.base)) (.cse3 (+ (* ~i~0 4) ~A~0.offset))) (or (not (= (select .cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 v_~A~0.base_19) .cse3))) (<= (select .cse1 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select .cse4 v_~A~0.base_19) .cse3)) (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_~A~0.base_19))))))) (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-07-12 10:35:35,393 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:35,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 51 [2022-07-12 10:35:35,414 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:35,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3382 treesize of output 3146 [2022-07-12 10:35:35,443 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:35,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3126 treesize of output 2375 [2022-07-12 10:35:35,474 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:35,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2358 treesize of output 1991 [2022-07-12 10:35:35,505 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:35,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1974 treesize of output 1799 [2022-07-12 10:35:37,546 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:37,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 85 [2022-07-12 10:35:37,587 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:37,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16844 treesize of output 15490 [2022-07-12 10:35:37,674 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:37,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 15436 treesize of output 12028 [2022-07-12 10:35:37,752 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:37,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 11980 treesize of output 9916 [2022-07-12 10:35:37,830 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:37,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 9868 treesize of output 8860 [2022-07-12 10:36:09,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-12 10:36:09,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064783548] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:36:09,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:36:09,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 35, 35] total 91 [2022-07-12 10:36:09,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482127495] [2022-07-12 10:36:09,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:36:09,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-07-12 10:36:09,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:36:09,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-07-12 10:36:09,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=792, Invalid=5976, Unknown=70, NotChecked=1352, Total=8190 [2022-07-12 10:36:09,046 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 189 [2022-07-12 10:36:09,050 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 1007 transitions, 8667 flow. Second operand has 91 states, 91 states have (on average 57.21978021978022) internal successors, (5207), 91 states have internal predecessors, (5207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:36:09,050 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:36:09,050 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 189 [2022-07-12 10:36:09,050 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:36:15,082 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< c_~end~0 c_~n~0))) (.cse1 (< c_~start~0 0)) (.cse2 (not (<= 0 c_~end~0))) (.cse5 (not (= (mod c_~ok~0 256) 0))) (.cse8 (<= c_~n~0 c_~start~0))) (and (or .cse0 .cse1 .cse2 (and (forall ((~A~0.offset Int)) (or (< c_~last~0 (select (select |c_#memory_int| c_~A~0.base) (+ ~A~0.offset (* c_~i~0 4)))) (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse4 (select .cse3 c_~queue~0.base))) (or (not (= (select (select .cse3 c_~A~0.base) (+ ~A~0.offset (* c_~i~0 4))) (select .cse4 (+ (* c_~end~0 4) c_~queue~0.offset)))) (<= (select .cse4 (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))))))) (or .cse5 (forall ((~A~0.offset Int) (v_ArrVal_200 (Array Int Int))) (let ((.cse6 (+ ~A~0.offset (* c_~i~0 4)))) (or (< c_~last~0 (select (select |c_#memory_int| c_~A~0.base) .cse6)) (not (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse7 c_~A~0.base) .cse6) (select (select .cse7 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)))))))))) .cse8) (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) .cse0 .cse1 .cse2 (and (or (forall ((v_ArrVal_200 (Array Int Int))) (not (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (= (select (select .cse9 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select (select .cse9 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)))))) .cse5) (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse10 (select .cse11 c_~queue~0.base))) (or (<= (select .cse10 (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0) (not (= (select (select .cse11 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select .cse10 (+ (* c_~end~0 4) c_~queue~0.offset))))))))) .cse8))) is different from false [2022-07-12 10:36:26,434 INFO L129 PetriNetUnfolder]: 19842/37338 cut-off events. [2022-07-12 10:36:26,434 INFO L130 PetriNetUnfolder]: For 562191/562276 co-relation queries the response was YES. [2022-07-12 10:36:27,258 INFO L84 FinitePrefix]: Finished finitePrefix Result has 235844 conditions, 37338 events. 19842/37338 cut-off events. For 562191/562276 co-relation queries the response was YES. Maximal size of possible extension queue 1675. Compared 363089 event pairs, 4050 based on Foata normal form. 36/37265 useless extension candidates. Maximal degree in co-relation 235739. Up to 24569 conditions per place. [2022-07-12 10:36:27,533 INFO L132 encePairwiseOnDemand]: 132/189 looper letters, 1099 selfloop transitions, 626 changer transitions 5/1779 dead transitions. [2022-07-12 10:36:27,534 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 1779 transitions, 20111 flow [2022-07-12 10:36:27,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-07-12 10:36:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2022-07-12 10:36:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 3810 transitions. [2022-07-12 10:36:27,543 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.3199798437893676 [2022-07-12 10:36:27,543 INFO L72 ComplementDD]: Start complementDD. Operand 63 states and 3810 transitions. [2022-07-12 10:36:27,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 3810 transitions. [2022-07-12 10:36:27,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:36:27,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 63 states and 3810 transitions. [2022-07-12 10:36:27,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 64 states, 63 states have (on average 60.476190476190474) internal successors, (3810), 63 states have internal predecessors, (3810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:36:27,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 64 states, 64 states have (on average 189.0) internal successors, (12096), 64 states have internal predecessors, (12096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:36:27,565 INFO L81 ComplementDD]: Finished complementDD. Result has 64 states, 64 states have (on average 189.0) internal successors, (12096), 64 states have internal predecessors, (12096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:36:27,565 INFO L186 Difference]: Start difference. First operand has 493 places, 1007 transitions, 8667 flow. Second operand 63 states and 3810 transitions. [2022-07-12 10:36:27,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 1779 transitions, 20111 flow [2022-07-12 10:36:31,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 1779 transitions, 19134 flow, removed 433 selfloop flow, removed 49 redundant places. [2022-07-12 10:36:31,102 INFO L242 Difference]: Finished difference. Result has 521 places, 1460 transitions, 15356 flow [2022-07-12 10:36:31,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=8011, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1007, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=281, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=15356, PETRI_PLACES=521, PETRI_TRANSITIONS=1460} [2022-07-12 10:36:31,104 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 351 predicate places. [2022-07-12 10:36:31,105 INFO L495 AbstractCegarLoop]: Abstraction has has 521 places, 1460 transitions, 15356 flow [2022-07-12 10:36:31,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 57.21978021978022) internal successors, (5207), 91 states have internal predecessors, (5207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:36:31,107 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:36:31,108 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:36:31,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 10:36:31,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:36:31,333 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:36:31,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:36:31,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1665281110, now seen corresponding path program 4 times [2022-07-12 10:36:31,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:36:31,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88354037] [2022-07-12 10:36:31,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:36:31,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:36:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:36:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:36:33,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:36:33,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88354037] [2022-07-12 10:36:33,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88354037] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:36:33,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76854634] [2022-07-12 10:36:33,440 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 10:36:33,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:36:33,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:36:33,444 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) [2022-07-12 10:36:33,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 10:36:33,547 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 10:36:33,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:36:33,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-12 10:36:33,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:36:34,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 10:36:35,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:36:35,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 10:36:35,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:36:35,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 10:36:35,778 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-12 10:36:35,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 10 [2022-07-12 10:36:35,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:36:35,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:36:36,195 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (and (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (let ((.cse1 (select .cse0 ~queue~0.base))) (or (not (= (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select .cse1 (+ (* c_~end~0 4) c_~queue~0.offset)))) (<= (select .cse1 (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int))) (not (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (= (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)))))))) (not (<= 0 c_~end~0))) is different from false [2022-07-12 10:36:36,291 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (< c_~end~0 0) (and (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (let ((.cse1 (select .cse0 ~queue~0.base))) (or (not (= (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select .cse1 (+ (* c_~end~0 4) c_~queue~0.offset)))) (<= (select .cse1 (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int))) (not (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (= (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset))))))))) is different from false [2022-07-12 10:36:36,318 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (< c_~end~0 0) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (= (select (select .cse0 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))))))) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (let ((.cse1 (select .cse2 ~queue~0.base))) (or (<= (select .cse1 (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0) (not (= (select .cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))))))) is different from false [2022-07-12 10:36:36,386 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (and (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) |c_ULTIMATE.start_main_#t~mem14#1|) (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (= (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))))) (< c_~end~0 0)) is different from false [2022-07-12 10:36:36,405 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (< c_~end~0 0) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (= (select (select .cse0 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))))))) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (let ((.cse1 (select .cse2 ~queue~0.base))) (or (<= (select .cse1 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (not (= (select .cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))))))) is different from false [2022-07-12 10:36:36,519 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (and (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 |c_ULTIMATE.start_main_#t~ret13#1.base|) (+ |c_ULTIMATE.start_main_#t~ret13#1.offset| (* c_~i~0 4))))) (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| |c_ULTIMATE.start_main_#t~ret13#1.base|) |c_ULTIMATE.start_main_#t~ret13#1.offset|)))))) (or (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (= (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 |c_ULTIMATE.start_main_#t~ret13#1.base|) (+ |c_ULTIMATE.start_main_#t~ret13#1.offset| (* c_~i~0 4))))))) (not (= (mod c_~ok~0 256) 0)))) (< c_~end~0 0)) is different from false [2022-07-12 10:36:36,552 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) (or (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (= (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) (not (= (mod c_~ok~0 256) 0)))) (<= c_~n~0 c_~end~0) (< c_~end~0 0)) is different from false [2022-07-12 10:36:36,571 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (< c_~end~0 0) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (= (select (select .cse0 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((~queue~0.base Int) (v_ArrVal_236 (Array Int Int)) (v_ArrVal_235 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_236))) (let ((.cse1 (select .cse2 ~queue~0.base))) (or (<= (select .cse1 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (= (select .cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))))) is different from false [2022-07-12 10:36:36,668 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:36:36,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 72 [2022-07-12 10:36:36,691 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:36:36,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1085 treesize of output 1055 [2022-07-12 10:36:36,728 INFO L356 Elim1Store]: treesize reduction 44, result has 54.6 percent of original size [2022-07-12 10:36:36,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1499 treesize of output 1480 [2022-07-12 10:36:36,757 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:36:36,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1516 treesize of output 1300 [2022-07-12 10:36:36,786 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:36:36,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1086 treesize of output 1002 [2022-07-12 10:36:40,803 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-12 10:36:40,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 126 treesize of output 1 [2022-07-12 10:36:40,824 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:36:40,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 88 [2022-07-12 10:36:40,979 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:36:40,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 45 [2022-07-12 10:36:40,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:36:40,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:36:40,989 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-12 10:36:40,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 138 [2022-07-12 10:36:42,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 10:36:42,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76854634] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:36:42,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:36:42,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 31, 30] total 88 [2022-07-12 10:36:42,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227818492] [2022-07-12 10:36:42,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:36:42,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-07-12 10:36:42,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:36:42,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-07-12 10:36:42,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=557, Invalid=5787, Unknown=8, NotChecked=1304, Total=7656 [2022-07-12 10:36:42,491 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 189 [2022-07-12 10:36:42,494 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 1460 transitions, 15356 flow. Second operand has 88 states, 88 states have (on average 59.45454545454545) internal successors, (5232), 88 states have internal predecessors, (5232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:36:42,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:36:42,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 189 [2022-07-12 10:36:42,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:37:20,886 INFO L129 PetriNetUnfolder]: 29318/55828 cut-off events. [2022-07-12 10:37:20,887 INFO L130 PetriNetUnfolder]: For 952729/953067 co-relation queries the response was YES. [2022-07-12 10:37:22,617 INFO L84 FinitePrefix]: Finished finitePrefix Result has 383100 conditions, 55828 events. 29318/55828 cut-off events. For 952729/953067 co-relation queries the response was YES. Maximal size of possible extension queue 2499. Compared 579935 event pairs, 4904 based on Foata normal form. 138/55809 useless extension candidates. Maximal degree in co-relation 382984. Up to 22940 conditions per place. [2022-07-12 10:37:22,968 INFO L132 encePairwiseOnDemand]: 120/189 looper letters, 1462 selfloop transitions, 1702 changer transitions 55/3269 dead transitions. [2022-07-12 10:37:22,968 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 3269 transitions, 41959 flow [2022-07-12 10:37:22,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2022-07-12 10:37:22,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2022-07-12 10:37:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 9063 transitions. [2022-07-12 10:37:22,980 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.324002574002574 [2022-07-12 10:37:22,980 INFO L72 ComplementDD]: Start complementDD. Operand 148 states and 9063 transitions. [2022-07-12 10:37:22,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 9063 transitions. [2022-07-12 10:37:22,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:37:22,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 148 states and 9063 transitions. [2022-07-12 10:37:22,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 149 states, 148 states have (on average 61.236486486486484) internal successors, (9063), 148 states have internal predecessors, (9063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:37:23,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 149 states, 149 states have (on average 189.0) internal successors, (28161), 149 states have internal predecessors, (28161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:37:23,027 INFO L81 ComplementDD]: Finished complementDD. Result has 149 states, 149 states have (on average 189.0) internal successors, (28161), 149 states have internal predecessors, (28161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:37:23,027 INFO L186 Difference]: Start difference. First operand has 521 places, 1460 transitions, 15356 flow. Second operand 148 states and 9063 transitions. [2022-07-12 10:37:23,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 3269 transitions, 41959 flow [2022-07-12 10:37:45,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 3269 transitions, 40191 flow, removed 739 selfloop flow, removed 36 redundant places. [2022-07-12 10:37:45,854 INFO L242 Difference]: Finished difference. Result has 688 places, 2487 transitions, 32906 flow [2022-07-12 10:37:45,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=14703, PETRI_DIFFERENCE_MINUEND_PLACES=483, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=792, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=148, PETRI_FLOW=32906, PETRI_PLACES=688, PETRI_TRANSITIONS=2487} [2022-07-12 10:37:45,857 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 518 predicate places. [2022-07-12 10:37:45,857 INFO L495 AbstractCegarLoop]: Abstraction has has 688 places, 2487 transitions, 32906 flow [2022-07-12 10:37:45,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 59.45454545454545) internal successors, (5232), 88 states have internal predecessors, (5232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:37:45,858 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:37:45,858 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:37:45,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 10:37:46,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:37:46,076 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:37:46,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:37:46,076 INFO L85 PathProgramCache]: Analyzing trace with hash 829284030, now seen corresponding path program 5 times [2022-07-12 10:37:46,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:37:46,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609804788] [2022-07-12 10:37:46,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:37:46,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:37:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:37:47,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:37:47,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:37:47,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609804788] [2022-07-12 10:37:47,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609804788] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:37:47,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931925269] [2022-07-12 10:37:47,759 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 10:37:47,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:37:47,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:37:47,763 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) [2022-07-12 10:37:47,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 10:37:47,849 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:37:47,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:37:47,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-12 10:37:47,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:37:49,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 10:37:49,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:37:49,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 10:37:50,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:37:50,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 10:37:50,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:37:50,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:37:50,649 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-07-12 10:37:50,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 13 [2022-07-12 10:37:50,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:37:50,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:37:51,121 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (<= (+ c_~end~0 1) c_~start~0) (< c_~start~0 0) (and (forall ((v_ArrVal_272 (Array Int Int)) (~queue~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0) (not (= (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)))))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_272 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (= (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset))))))))) is different from false [2022-07-12 10:37:51,287 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (<= (+ c_~end~0 1) c_~start~0) (< c_~start~0 0) (and (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0) (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))))) (or (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (= (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))) (not (= (mod c_~ok~0 256) 0))))) is different from false [2022-07-12 10:37:51,389 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (<= (+ c_~end~0 1) c_~start~0) (and (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) |c_ULTIMATE.start_main_#t~mem14#1|))))) (or (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (= (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))) (not (= (mod c_~ok~0 256) 0)))) (< c_~start~0 0)) is different from false [2022-07-12 10:37:51,419 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))))) (or (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (= (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))))) (not (= (mod c_~ok~0 256) 0)))) (<= c_~n~0 c_~end~0) (<= (+ c_~end~0 1) c_~start~0) (< c_~start~0 0)) is different from false [2022-07-12 10:37:51,605 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (<= (+ c_~end~0 1) c_~start~0) (< c_~start~0 0) (and (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| |c_ULTIMATE.start_main_#t~ret13#1.base|) |c_ULTIMATE.start_main_#t~ret13#1.offset|)) (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 |c_ULTIMATE.start_main_#t~ret13#1.base|) (+ |c_ULTIMATE.start_main_#t~ret13#1.offset| (* c_~i~0 4))))))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (= (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 |c_ULTIMATE.start_main_#t~ret13#1.base|) (+ |c_ULTIMATE.start_main_#t~ret13#1.offset| (* c_~i~0 4)))))))))) is different from false [2022-07-12 10:37:51,653 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (and (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))))) (or (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (= (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) (not (= (mod c_~ok~0 256) 0)))) (<= (+ c_~end~0 1) c_~start~0) (< c_~start~0 0)) is different from false [2022-07-12 10:37:51,681 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (and (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (<= (select .cse0 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (= (select (select .cse2 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (<= (+ c_~end~0 1) c_~start~0) (< c_~start~0 0)) is different from false [2022-07-12 10:37:51,801 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:37:51,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 45 [2022-07-12 10:37:51,812 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:37:51,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 854 treesize of output 746 [2022-07-12 10:37:51,825 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:37:51,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 726 treesize of output 647 [2022-07-12 10:37:51,840 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:37:51,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 630 treesize of output 455 [2022-07-12 10:37:51,987 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:37:51,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 72 [2022-07-12 10:37:52,004 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:37:52,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1085 treesize of output 1055 [2022-07-12 10:37:52,050 INFO L356 Elim1Store]: treesize reduction 44, result has 54.6 percent of original size [2022-07-12 10:37:52,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1499 treesize of output 1480 [2022-07-12 10:37:52,087 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:37:52,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1314 treesize of output 1230 [2022-07-12 10:37:52,121 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:37:52,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1384 treesize of output 1168 [2022-07-12 10:37:58,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 26 [2022-07-12 10:37:58,149 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:37:58,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 107 treesize of output 105 [2022-07-12 10:37:58,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 26 [2022-07-12 10:37:58,535 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:37:58,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 88 [2022-07-12 10:38:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 10:38:00,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931925269] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:38:00,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:38:00,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 29] total 91 [2022-07-12 10:38:00,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480362594] [2022-07-12 10:38:00,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:38:00,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-07-12 10:38:00,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:38:00,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-07-12 10:38:00,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=801, Invalid=6192, Unknown=7, NotChecked=1190, Total=8190 [2022-07-12 10:38:00,531 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 189 [2022-07-12 10:38:00,533 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 688 places, 2487 transitions, 32906 flow. Second operand has 91 states, 91 states have (on average 59.34065934065934) internal successors, (5400), 91 states have internal predecessors, (5400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:38:00,534 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:38:00,534 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 189 [2022-07-12 10:38:00,534 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:38:06,457 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n~0 c_~end~0)) (.cse2 (<= (+ c_~end~0 1) c_~start~0)) (.cse3 (< c_~start~0 0)) (.cse1 (not (= (mod c_~ok~0 256) 0)))) (and (= c_~i~0 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse0 (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse1 (= (* c_~end~0 4) (* c_~start~0 4)) (= (* c_~i~0 4) 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse2 .cse3) (= (+ (- 1) c_~ok~0) 0) (= c_~ok~0 1) (or .cse0 .cse2 .cse3 (and (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (let ((.cse4 (select .cse5 ~queue~0.base))) (or (<= (select .cse4 (+ (* c_~start~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| |c_ULTIMATE.start_main_#t~ret13#1.base|) |c_ULTIMATE.start_main_#t~ret13#1.offset|)) (not (= (select .cse4 (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse5 |c_ULTIMATE.start_main_#t~ret13#1.base|) (+ |c_ULTIMATE.start_main_#t~ret13#1.offset| (* c_~i~0 4))))))))) (or .cse1 (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272))) (= (select (select .cse6 ~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select .cse6 |c_ULTIMATE.start_main_#t~ret13#1.base|) (+ |c_ULTIMATE.start_main_#t~ret13#1.offset| (* c_~i~0 4)))))))))) (<= c_~start~0 c_~end~0) (<= c_~end~0 c_~start~0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false