./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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-inc-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 cd94157895dc71e9f24fce5dbc4a71d4e4b55c4da9be28372139a3001decae0a --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 03:06:58,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 03:06:58,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 03:06:58,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 03:06:58,803 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 03:06:58,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 03:06:58,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 03:06:58,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 03:06:58,811 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 03:06:58,815 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 03:06:58,816 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 03:06:58,817 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 03:06:58,817 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 03:06:58,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 03:06:58,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 03:06:58,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 03:06:58,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 03:06:58,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 03:06:58,830 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 03:06:58,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 03:06:58,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 03:06:58,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 03:06:58,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 03:06:58,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 03:06:58,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 03:06:58,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 03:06:58,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 03:06:58,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 03:06:58,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 03:06:58,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 03:06:58,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 03:06:58,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 03:06:58,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 03:06:58,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 03:06:58,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 03:06:58,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 03:06:58,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 03:06:58,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 03:06:58,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 03:06:58,861 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 03:06:58,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 03:06:58,862 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 03:06:58,888 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 03:06:58,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 03:06:58,888 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 03:06:58,889 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 03:06:58,890 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 03:06:58,890 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 03:06:58,890 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 03:06:58,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 03:06:58,891 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 03:06:58,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 03:06:58,892 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 03:06:58,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 03:06:58,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 03:06:58,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 03:06:58,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 03:06:58,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 03:06:58,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 03:06:58,893 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 03:06:58,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 03:06:58,893 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 03:06:58,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 03:06:58,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 03:06:58,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 03:06:58,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 03:06:58,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 03:06:58,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 03:06:58,894 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 03:06:58,895 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 03:06:58,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 03:06:58,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 03:06:58,895 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 03:06:58,895 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 03:06:58,896 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 03:06:58,896 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 03:06:58,896 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 -> cd94157895dc71e9f24fce5dbc4a71d4e4b55c4da9be28372139a3001decae0a [2021-12-16 03:06:59,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 03:06:59,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 03:06:59,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 03:06:59,159 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 03:06:59,163 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 03:06:59,165 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c [2021-12-16 03:06:59,242 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59deb5e1b/4d1cfd78ca004af59133c2bc046c3163/FLAG5daa128b2 [2021-12-16 03:06:59,588 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 03:06:59,592 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c [2021-12-16 03:06:59,602 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59deb5e1b/4d1cfd78ca004af59133c2bc046c3163/FLAG5daa128b2 [2021-12-16 03:07:00,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59deb5e1b/4d1cfd78ca004af59133c2bc046c3163 [2021-12-16 03:07:00,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 03:07:00,010 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 03:07:00,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 03:07:00,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 03:07:00,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 03:07:00,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:07:00" (1/1) ... [2021-12-16 03:07:00,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bb173a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:07:00, skipping insertion in model container [2021-12-16 03:07:00,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:07:00" (1/1) ... [2021-12-16 03:07:00,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 03:07:00,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 03:07:00,168 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-inc-subseq.wvr.c[2924,2937] [2021-12-16 03:07:00,177 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 03:07:00,184 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 03:07:00,216 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-inc-subseq.wvr.c[2924,2937] [2021-12-16 03:07:00,218 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 03:07:00,229 INFO L208 MainTranslator]: Completed translation [2021-12-16 03:07:00,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:07:00 WrapperNode [2021-12-16 03:07:00,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 03:07:00,231 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 03:07:00,231 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 03:07:00,231 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 03:07:00,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:07:00" (1/1) ... [2021-12-16 03:07:00,252 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:07:00" (1/1) ... [2021-12-16 03:07:00,275 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2021-12-16 03:07:00,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 03:07:00,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 03:07:00,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 03:07:00,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 03:07:00,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:07:00" (1/1) ... [2021-12-16 03:07:00,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:07:00" (1/1) ... [2021-12-16 03:07:00,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:07:00" (1/1) ... [2021-12-16 03:07:00,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:07:00" (1/1) ... [2021-12-16 03:07:00,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:07:00" (1/1) ... [2021-12-16 03:07:00,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:07:00" (1/1) ... [2021-12-16 03:07:00,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:07:00" (1/1) ... [2021-12-16 03:07:00,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 03:07:00,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 03:07:00,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 03:07:00,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 03:07:00,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:07:00" (1/1) ... [2021-12-16 03:07:00,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 03:07:00,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:07:00,368 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) [2021-12-16 03:07:00,395 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 [2021-12-16 03:07:00,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 03:07:00,416 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-16 03:07:00,416 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-16 03:07:00,417 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-16 03:07:00,417 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-16 03:07:00,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 03:07:00,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 03:07:00,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 03:07:00,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-16 03:07:00,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-16 03:07:00,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 03:07:00,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 03:07:00,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 03:07:00,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 03:07:00,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 03:07:00,420 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-16 03:07:00,491 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 03:07:00,492 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 03:07:00,817 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 03:07:00,881 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 03:07:00,883 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-16 03:07:00,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:07:00 BoogieIcfgContainer [2021-12-16 03:07:00,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 03:07:00,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 03:07:00,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 03:07:00,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 03:07:00,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:07:00" (1/3) ... [2021-12-16 03:07:00,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad99038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:07:00, skipping insertion in model container [2021-12-16 03:07:00,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:07:00" (2/3) ... [2021-12-16 03:07:00,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad99038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:07:00, skipping insertion in model container [2021-12-16 03:07:00,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:07:00" (3/3) ... [2021-12-16 03:07:00,896 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2021-12-16 03:07:00,900 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-16 03:07:00,901 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 03:07:00,901 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 03:07:00,901 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-16 03:07:00,937 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,938 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,938 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,938 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,938 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,939 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,939 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,939 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,939 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,939 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,940 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,940 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,940 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,940 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,940 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,941 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,941 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,941 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,942 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,942 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,942 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,943 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,944 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,944 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,945 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,945 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,945 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,946 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,946 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,946 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,946 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,946 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,947 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,947 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,950 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,950 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,950 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,950 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,964 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,964 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,965 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,965 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,965 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,967 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,967 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,967 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,967 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:07:00,972 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-12-16 03:07:01,023 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 03:07:01,032 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-16 03:07:01,032 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-12-16 03:07:01,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 181 places, 189 transitions, 394 flow [2021-12-16 03:07:01,126 INFO L129 PetriNetUnfolder]: 15/187 cut-off events. [2021-12-16 03:07:01,126 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-12-16 03:07:01,129 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 102 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. [2021-12-16 03:07:01,129 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 189 transitions, 394 flow [2021-12-16 03:07:01,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 178 transitions, 368 flow [2021-12-16 03:07:01,204 INFO L129 PetriNetUnfolder]: 15/177 cut-off events. [2021-12-16 03:07:01,204 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-12-16 03:07:01,205 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:07:01,205 INFO L254 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] [2021-12-16 03:07:01,206 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-16 03:07:01,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:07:01,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1982625687, now seen corresponding path program 1 times [2021-12-16 03:07:01,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:07:01,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843763479] [2021-12-16 03:07:01,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:07:01,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:07:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:07:01,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:07:01,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:07:01,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843763479] [2021-12-16 03:07:01,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843763479] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:07:01,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:07:01,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 03:07:01,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451951990] [2021-12-16 03:07:01,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:07:01,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-16 03:07:01,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:07:01,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-16 03:07:01,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 03:07:01,546 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 189 [2021-12-16 03:07:01,551 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.0) internal successors, (348), 2 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:01,551 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:07:01,551 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 189 [2021-12-16 03:07:01,552 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:07:01,618 INFO L129 PetriNetUnfolder]: 14/193 cut-off events. [2021-12-16 03:07:01,619 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-12-16 03:07:01,620 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 168 event pairs, 3 based on Foata normal form. 15/195 useless extension candidates. Maximal degree in co-relation 147. Up to 20 conditions per place. [2021-12-16 03:07:01,625 INFO L132 encePairwiseOnDemand]: 179/189 looper letters, 7 selfloop transitions, 0 changer transitions 6/168 dead transitions. [2021-12-16 03:07:01,625 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 168 transitions, 362 flow [2021-12-16 03:07:01,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-16 03:07:01,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-16 03:07:01,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 359 transitions. [2021-12-16 03:07:01,637 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9497354497354498 [2021-12-16 03:07:01,637 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 359 transitions. [2021-12-16 03:07:01,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 359 transitions. [2021-12-16 03:07:01,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:07:01,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 359 transitions. [2021-12-16 03:07:01,644 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) [2021-12-16 03:07:01,649 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) [2021-12-16 03:07:01,649 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) [2021-12-16 03:07:01,650 INFO L186 Difference]: Start difference. First operand has 170 places, 178 transitions, 368 flow. Second operand 2 states and 359 transitions. [2021-12-16 03:07:01,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 168 transitions, 362 flow [2021-12-16 03:07:01,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 168 transitions, 354 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-16 03:07:01,657 INFO L242 Difference]: Finished difference. Result has 167 places, 162 transitions, 328 flow [2021-12-16 03:07:01,659 INFO L317 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} [2021-12-16 03:07:01,662 INFO L334 CegarLoopForPetriNet]: 170 programPoint places, -3 predicate places. [2021-12-16 03:07:01,662 INFO L470 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 328 flow [2021-12-16 03:07:01,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 174.0) internal successors, (348), 2 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:01,663 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:07:01,663 INFO L254 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] [2021-12-16 03:07:01,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 03:07:01,663 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-16 03:07:01,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:07:01,664 INFO L85 PathProgramCache]: Analyzing trace with hash -955987473, now seen corresponding path program 1 times [2021-12-16 03:07:01,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:07:01,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947783888] [2021-12-16 03:07:01,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:07:01,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:07:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:07:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:07:01,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:07:01,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947783888] [2021-12-16 03:07:01,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947783888] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:07:01,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:07:01,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 03:07:01,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277989861] [2021-12-16 03:07:01,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:07:01,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 03:07:01,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:07:01,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 03:07:01,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 03:07:01,879 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 189 [2021-12-16 03:07:01,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 162 transitions, 328 flow. Second operand has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:01,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:07:01,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 189 [2021-12-16 03:07:01,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:07:01,992 INFO L129 PetriNetUnfolder]: 22/216 cut-off events. [2021-12-16 03:07:01,992 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-12-16 03:07:01,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 216 events. 22/216 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 296 event pairs, 3 based on Foata normal form. 1/208 useless extension candidates. Maximal degree in co-relation 283. Up to 38 conditions per place. [2021-12-16 03:07:01,994 INFO L132 encePairwiseOnDemand]: 184/189 looper letters, 37 selfloop transitions, 2 changer transitions 4/171 dead transitions. [2021-12-16 03:07:01,994 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 171 transitions, 434 flow [2021-12-16 03:07:01,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 03:07:01,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-16 03:07:01,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 734 transitions. [2021-12-16 03:07:01,999 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7767195767195767 [2021-12-16 03:07:01,999 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 734 transitions. [2021-12-16 03:07:01,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 734 transitions. [2021-12-16 03:07:02,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:07:02,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 734 transitions. [2021-12-16 03:07:02,002 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) [2021-12-16 03:07:02,005 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) [2021-12-16 03:07:02,006 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) [2021-12-16 03:07:02,006 INFO L186 Difference]: Start difference. First operand has 167 places, 162 transitions, 328 flow. Second operand 5 states and 734 transitions. [2021-12-16 03:07:02,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 171 transitions, 434 flow [2021-12-16 03:07:02,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 171 transitions, 434 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-16 03:07:02,011 INFO L242 Difference]: Finished difference. Result has 168 places, 163 transitions, 344 flow [2021-12-16 03:07:02,011 INFO L317 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=344, PETRI_PLACES=168, PETRI_TRANSITIONS=163} [2021-12-16 03:07:02,012 INFO L334 CegarLoopForPetriNet]: 170 programPoint places, -2 predicate places. [2021-12-16 03:07:02,012 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 163 transitions, 344 flow [2021-12-16 03:07:02,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:02,013 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:07:02,013 INFO L254 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] [2021-12-16 03:07:02,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 03:07:02,014 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-16 03:07:02,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:07:02,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1493556367, now seen corresponding path program 1 times [2021-12-16 03:07:02,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:07:02,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696526342] [2021-12-16 03:07:02,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:07:02,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:07:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:07:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:07:02,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:07:02,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696526342] [2021-12-16 03:07:02,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696526342] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:07:02,235 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:07:02,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 03:07:02,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209147666] [2021-12-16 03:07:02,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:07:02,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 03:07:02,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:07:02,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 03:07:02,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-16 03:07:02,241 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 189 [2021-12-16 03:07:02,242 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 163 transitions, 344 flow. Second operand has 5 states, 5 states have (on average 157.8) internal successors, (789), 5 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:02,242 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:07:02,242 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 189 [2021-12-16 03:07:02,242 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:07:02,364 INFO L129 PetriNetUnfolder]: 103/466 cut-off events. [2021-12-16 03:07:02,365 INFO L130 PetriNetUnfolder]: For 21/25 co-relation queries the response was YES. [2021-12-16 03:07:02,367 INFO L84 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 466 events. 103/466 cut-off events. For 21/25 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1727 event pairs, 21 based on Foata normal form. 8/419 useless extension candidates. Maximal degree in co-relation 700. Up to 81 conditions per place. [2021-12-16 03:07:02,368 INFO L132 encePairwiseOnDemand]: 181/189 looper letters, 34 selfloop transitions, 9 changer transitions 10/192 dead transitions. [2021-12-16 03:07:02,369 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 192 transitions, 516 flow [2021-12-16 03:07:02,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 03:07:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-16 03:07:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 980 transitions. [2021-12-16 03:07:02,372 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8641975308641975 [2021-12-16 03:07:02,372 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 980 transitions. [2021-12-16 03:07:02,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 980 transitions. [2021-12-16 03:07:02,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:07:02,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 980 transitions. [2021-12-16 03:07:02,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 163.33333333333334) internal successors, (980), 6 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:02,377 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) [2021-12-16 03:07:02,378 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) [2021-12-16 03:07:02,378 INFO L186 Difference]: Start difference. First operand has 168 places, 163 transitions, 344 flow. Second operand 6 states and 980 transitions. [2021-12-16 03:07:02,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 192 transitions, 516 flow [2021-12-16 03:07:02,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 192 transitions, 510 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-12-16 03:07:02,403 INFO L242 Difference]: Finished difference. Result has 171 places, 170 transitions, 396 flow [2021-12-16 03:07:02,404 INFO L317 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=396, PETRI_PLACES=171, PETRI_TRANSITIONS=170} [2021-12-16 03:07:02,405 INFO L334 CegarLoopForPetriNet]: 170 programPoint places, 1 predicate places. [2021-12-16 03:07:02,405 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 170 transitions, 396 flow [2021-12-16 03:07:02,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 157.8) internal successors, (789), 5 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:02,406 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:07:02,406 INFO L254 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] [2021-12-16 03:07:02,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 03:07:02,406 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-16 03:07:02,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:07:02,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1590314738, now seen corresponding path program 1 times [2021-12-16 03:07:02,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:07:02,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955682260] [2021-12-16 03:07:02,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:07:02,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:07:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:07:02,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:07:02,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:07:02,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955682260] [2021-12-16 03:07:02,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955682260] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:07:02,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:07:02,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 03:07:02,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141602092] [2021-12-16 03:07:02,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:07:02,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 03:07:02,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:07:02,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 03:07:02,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 03:07:02,488 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 189 [2021-12-16 03:07:02,489 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 170 transitions, 396 flow. Second operand has 6 states, 6 states have (on average 149.16666666666666) internal successors, (895), 6 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:02,489 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:07:02,489 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 189 [2021-12-16 03:07:02,489 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:07:02,624 INFO L129 PetriNetUnfolder]: 31/373 cut-off events. [2021-12-16 03:07:02,624 INFO L130 PetriNetUnfolder]: For 74/88 co-relation queries the response was YES. [2021-12-16 03:07:02,625 INFO L84 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 373 events. 31/373 cut-off events. For 74/88 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 961 event pairs, 8 based on Foata normal form. 6/367 useless extension candidates. Maximal degree in co-relation 560. Up to 47 conditions per place. [2021-12-16 03:07:02,628 INFO L132 encePairwiseOnDemand]: 179/189 looper letters, 31 selfloop transitions, 8 changer transitions 18/192 dead transitions. [2021-12-16 03:07:02,628 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 192 transitions, 562 flow [2021-12-16 03:07:02,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 03:07:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-16 03:07:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1361 transitions. [2021-12-16 03:07:02,632 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8001175778953556 [2021-12-16 03:07:02,632 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1361 transitions. [2021-12-16 03:07:02,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1361 transitions. [2021-12-16 03:07:02,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:07:02,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1361 transitions. [2021-12-16 03:07:02,637 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) [2021-12-16 03:07:02,640 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) [2021-12-16 03:07:02,642 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) [2021-12-16 03:07:02,642 INFO L186 Difference]: Start difference. First operand has 171 places, 170 transitions, 396 flow. Second operand 9 states and 1361 transitions. [2021-12-16 03:07:02,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 192 transitions, 562 flow [2021-12-16 03:07:02,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 192 transitions, 562 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-16 03:07:02,650 INFO L242 Difference]: Finished difference. Result has 181 places, 171 transitions, 424 flow [2021-12-16 03:07:02,651 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=424, PETRI_PLACES=181, PETRI_TRANSITIONS=171} [2021-12-16 03:07:02,652 INFO L334 CegarLoopForPetriNet]: 170 programPoint places, 11 predicate places. [2021-12-16 03:07:02,652 INFO L470 AbstractCegarLoop]: Abstraction has has 181 places, 171 transitions, 424 flow [2021-12-16 03:07:02,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.16666666666666) internal successors, (895), 6 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:02,653 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:07:02,653 INFO L254 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] [2021-12-16 03:07:02,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 03:07:02,654 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-16 03:07:02,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:07:02,655 INFO L85 PathProgramCache]: Analyzing trace with hash -496358003, now seen corresponding path program 1 times [2021-12-16 03:07:02,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:07:02,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562247122] [2021-12-16 03:07:02,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:07:02,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:07:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:07:02,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 03:07:02,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:07:02,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562247122] [2021-12-16 03:07:02,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562247122] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:07:02,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:07:02,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 03:07:02,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609545976] [2021-12-16 03:07:02,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:07:02,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 03:07:02,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:07:02,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 03:07:02,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-16 03:07:02,797 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 189 [2021-12-16 03:07:02,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 171 transitions, 424 flow. Second operand has 7 states, 7 states have (on average 142.28571428571428) internal successors, (996), 7 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:02,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:07:02,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 189 [2021-12-16 03:07:02,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:07:02,999 INFO L129 PetriNetUnfolder]: 93/578 cut-off events. [2021-12-16 03:07:03,000 INFO L130 PetriNetUnfolder]: For 196/200 co-relation queries the response was YES. [2021-12-16 03:07:03,002 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 578 events. 93/578 cut-off events. For 196/200 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2599 event pairs, 19 based on Foata normal form. 4/555 useless extension candidates. Maximal degree in co-relation 1052. Up to 137 conditions per place. [2021-12-16 03:07:03,004 INFO L132 encePairwiseOnDemand]: 178/189 looper letters, 56 selfloop transitions, 9 changer transitions 13/201 dead transitions. [2021-12-16 03:07:03,004 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 201 transitions, 691 flow [2021-12-16 03:07:03,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 03:07:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-16 03:07:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1301 transitions. [2021-12-16 03:07:03,008 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7648442092886537 [2021-12-16 03:07:03,008 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1301 transitions. [2021-12-16 03:07:03,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1301 transitions. [2021-12-16 03:07:03,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:07:03,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1301 transitions. [2021-12-16 03:07:03,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 144.55555555555554) internal successors, (1301), 9 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:03,014 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) [2021-12-16 03:07:03,015 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) [2021-12-16 03:07:03,015 INFO L186 Difference]: Start difference. First operand has 181 places, 171 transitions, 424 flow. Second operand 9 states and 1301 transitions. [2021-12-16 03:07:03,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 201 transitions, 691 flow [2021-12-16 03:07:03,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 201 transitions, 671 flow, removed 2 selfloop flow, removed 6 redundant places. [2021-12-16 03:07:03,022 INFO L242 Difference]: Finished difference. Result has 184 places, 174 transitions, 459 flow [2021-12-16 03:07:03,024 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=459, PETRI_PLACES=184, PETRI_TRANSITIONS=174} [2021-12-16 03:07:03,026 INFO L334 CegarLoopForPetriNet]: 170 programPoint places, 14 predicate places. [2021-12-16 03:07:03,026 INFO L470 AbstractCegarLoop]: Abstraction has has 184 places, 174 transitions, 459 flow [2021-12-16 03:07:03,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 142.28571428571428) internal successors, (996), 7 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:03,027 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:07:03,027 INFO L254 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] [2021-12-16 03:07:03,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 03:07:03,028 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-16 03:07:03,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:07:03,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1666740558, now seen corresponding path program 1 times [2021-12-16 03:07:03,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:07:03,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213908592] [2021-12-16 03:07:03,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:07:03,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:07:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:07:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 03:07:03,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:07:03,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213908592] [2021-12-16 03:07:03,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213908592] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:07:03,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:07:03,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 03:07:03,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593601537] [2021-12-16 03:07:03,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:07:03,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 03:07:03,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:07:03,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 03:07:03,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 03:07:03,139 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 189 [2021-12-16 03:07:03,139 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 174 transitions, 459 flow. Second operand has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:03,139 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:07:03,140 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 189 [2021-12-16 03:07:03,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:07:03,276 INFO L129 PetriNetUnfolder]: 198/745 cut-off events. [2021-12-16 03:07:03,276 INFO L130 PetriNetUnfolder]: For 392/396 co-relation queries the response was YES. [2021-12-16 03:07:03,279 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1618 conditions, 745 events. 198/745 cut-off events. For 392/396 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3714 event pairs, 41 based on Foata normal form. 25/741 useless extension candidates. Maximal degree in co-relation 1605. Up to 127 conditions per place. [2021-12-16 03:07:03,284 INFO L132 encePairwiseOnDemand]: 184/189 looper letters, 36 selfloop transitions, 17 changer transitions 0/198 dead transitions. [2021-12-16 03:07:03,284 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 198 transitions, 674 flow [2021-12-16 03:07:03,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 03:07:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-16 03:07:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 831 transitions. [2021-12-16 03:07:03,287 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8793650793650793 [2021-12-16 03:07:03,287 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 831 transitions. [2021-12-16 03:07:03,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 831 transitions. [2021-12-16 03:07:03,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:07:03,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 831 transitions. [2021-12-16 03:07:03,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.2) internal successors, (831), 5 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:03,292 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) [2021-12-16 03:07:03,292 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) [2021-12-16 03:07:03,293 INFO L186 Difference]: Start difference. First operand has 184 places, 174 transitions, 459 flow. Second operand 5 states and 831 transitions. [2021-12-16 03:07:03,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 198 transitions, 674 flow [2021-12-16 03:07:03,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 198 transitions, 653 flow, removed 4 selfloop flow, removed 5 redundant places. [2021-12-16 03:07:03,300 INFO L242 Difference]: Finished difference. Result has 184 places, 183 transitions, 557 flow [2021-12-16 03:07:03,301 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=557, PETRI_PLACES=184, PETRI_TRANSITIONS=183} [2021-12-16 03:07:03,303 INFO L334 CegarLoopForPetriNet]: 170 programPoint places, 14 predicate places. [2021-12-16 03:07:03,303 INFO L470 AbstractCegarLoop]: Abstraction has has 184 places, 183 transitions, 557 flow [2021-12-16 03:07:03,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:03,304 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:07:03,304 INFO L254 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] [2021-12-16 03:07:03,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 03:07:03,305 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-16 03:07:03,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:07:03,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1403839526, now seen corresponding path program 2 times [2021-12-16 03:07:03,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:07:03,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325306701] [2021-12-16 03:07:03,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:07:03,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:07:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:07:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:07:04,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:07:04,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325306701] [2021-12-16 03:07:04,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325306701] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:07:04,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610559359] [2021-12-16 03:07:04,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 03:07:04,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:07:04,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:07:04,911 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) [2021-12-16 03:07:04,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-16 03:07:05,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 03:07:05,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 03:07:05,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-16 03:07:05,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:07:07,313 INFO L388 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 19 treesize of output 7 [2021-12-16 03:07:07,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 03:07:07,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:07:07,846 INFO L354 Elim1Store]: treesize reduction 23, result has 58.2 percent of original size [2021-12-16 03:07:07,847 INFO L388 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 50 treesize of output 49 [2021-12-16 03:07:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 03:07:09,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610559359] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 03:07:09,307 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 03:07:09,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25, 18] total 60 [2021-12-16 03:07:09,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891412440] [2021-12-16 03:07:09,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 03:07:09,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2021-12-16 03:07:09,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:07:09,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-12-16 03:07:09,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=2987, Unknown=0, NotChecked=0, Total=3540 [2021-12-16 03:07:09,316 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 189 [2021-12-16 03:07:09,322 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 183 transitions, 557 flow. Second operand has 60 states, 60 states have (on average 69.58333333333333) internal successors, (4175), 60 states have internal predecessors, (4175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:09,322 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:07:09,322 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 189 [2021-12-16 03:07:09,322 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:07:16,033 INFO L129 PetriNetUnfolder]: 3535/7271 cut-off events. [2021-12-16 03:07:16,033 INFO L130 PetriNetUnfolder]: For 7075/7075 co-relation queries the response was YES. [2021-12-16 03:07:16,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19619 conditions, 7271 events. 3535/7271 cut-off events. For 7075/7075 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 59671 event pairs, 449 based on Foata normal form. 2/6968 useless extension candidates. Maximal degree in co-relation 19604. Up to 1713 conditions per place. [2021-12-16 03:07:16,120 INFO L132 encePairwiseOnDemand]: 137/189 looper letters, 374 selfloop transitions, 178 changer transitions 156/763 dead transitions. [2021-12-16 03:07:16,120 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 763 transitions, 4333 flow [2021-12-16 03:07:16,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-12-16 03:07:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2021-12-16 03:07:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 6883 transitions. [2021-12-16 03:07:16,144 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.3793540564373898 [2021-12-16 03:07:16,145 INFO L72 ComplementDD]: Start complementDD. Operand 96 states and 6883 transitions. [2021-12-16 03:07:16,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 6883 transitions. [2021-12-16 03:07:16,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:07:16,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 96 states and 6883 transitions. [2021-12-16 03:07:16,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 97 states, 96 states have (on average 71.69791666666667) internal successors, (6883), 96 states have internal predecessors, (6883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:16,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 97 states, 97 states have (on average 189.0) internal successors, (18333), 97 states have internal predecessors, (18333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:16,204 INFO L81 ComplementDD]: Finished complementDD. Result has 97 states, 97 states have (on average 189.0) internal successors, (18333), 97 states have internal predecessors, (18333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:16,205 INFO L186 Difference]: Start difference. First operand has 184 places, 183 transitions, 557 flow. Second operand 96 states and 6883 transitions. [2021-12-16 03:07:16,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 763 transitions, 4333 flow [2021-12-16 03:07:16,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 763 transitions, 4333 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-16 03:07:16,248 INFO L242 Difference]: Finished difference. Result has 332 places, 358 transitions, 2135 flow [2021-12-16 03:07:16,249 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=96, PETRI_FLOW=2135, PETRI_PLACES=332, PETRI_TRANSITIONS=358} [2021-12-16 03:07:16,250 INFO L334 CegarLoopForPetriNet]: 170 programPoint places, 162 predicate places. [2021-12-16 03:07:16,250 INFO L470 AbstractCegarLoop]: Abstraction has has 332 places, 358 transitions, 2135 flow [2021-12-16 03:07:16,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 69.58333333333333) internal successors, (4175), 60 states have internal predecessors, (4175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:16,252 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:07:16,252 INFO L254 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] [2021-12-16 03:07:16,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-16 03:07:16,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:07:16,472 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-16 03:07:16,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:07:16,472 INFO L85 PathProgramCache]: Analyzing trace with hash 735380230, now seen corresponding path program 3 times [2021-12-16 03:07:16,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:07:16,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995903570] [2021-12-16 03:07:16,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:07:16,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:07:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:07:17,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 03:07:17,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:07:17,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995903570] [2021-12-16 03:07:17,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995903570] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:07:17,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20078165] [2021-12-16 03:07:17,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 03:07:17,556 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:07:17,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:07:17,557 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) [2021-12-16 03:07:17,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-16 03:07:17,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-16 03:07:17,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 03:07:17,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-16 03:07:17,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:07:17,759 INFO L388 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 [2021-12-16 03:07:17,789 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-16 03:07:17,790 INFO L388 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-16 03:07:18,323 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-16 03:07:18,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-16 03:07:18,612 INFO L388 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 [2021-12-16 03:07:19,492 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-12-16 03:07:19,492 INFO L388 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 25 [2021-12-16 03:07:19,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2021-12-16 03:07:20,094 INFO L388 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 [2021-12-16 03:07:20,223 INFO L388 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 [2021-12-16 03:07:20,705 INFO L354 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2021-12-16 03:07:20,705 INFO L388 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 [2021-12-16 03:07:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:07:20,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:07:25,896 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 03:07:25,896 INFO L388 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 131 treesize of output 95 [2021-12-16 03:07:25,943 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 03:07:25,944 INFO L388 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 13300 treesize of output 12330 [2021-12-16 03:07:26,020 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 03:07:26,021 INFO L388 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 12276 treesize of output 11556 [2021-12-16 03:07:26,117 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 03:07:26,118 INFO L388 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 11508 treesize of output 8484 [2021-12-16 03:07:26,194 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 03:07:26,195 INFO L388 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 8436 treesize of output 6948 [2021-12-16 03:07:26,246 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-16 03:07:26,246 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-16 03:07:26,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2021-12-16 03:07:26,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654759792] [2021-12-16 03:07:26,247 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-16 03:07:26,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-16 03:07:26,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:07:26,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-16 03:07:26,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=711, Invalid=3789, Unknown=56, NotChecked=0, Total=4556 [2021-12-16 03:07:26,250 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 189 [2021-12-16 03:07:26,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 358 transitions, 2135 flow. Second operand has 26 states, 26 states have (on average 72.88461538461539) internal successors, (1895), 26 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:26,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:07:26,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 189 [2021-12-16 03:07:26,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:07:28,814 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([538] L49-5-->L59: Formula: (= v_~i~0_15 (+ v_~i~0_16 1)) InVars {~i~0=v_~i~0_16} OutVars{thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_1|, ~i~0=v_~i~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post6#1, ~i~0][393], [Black: 251#(< ~i~0 ~N~0), Black: 254#(and (<= 1 |thread2Thread1of1ForFork1_~cond~0#1|) (< ~i~0 ~N~0) (<= (div |thread2Thread1of1ForFork1_~cond~0#1| 256) 0)), 189#(= ~ok~0 1), 56#L103-1true, 260#true, Black: 1295#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_main_#t~ret12#1.offset| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1345#(and (= ~ok~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (<= ~v_old~0 ~last~0) (<= ~n~0 ~end~0) (< ~end~0 0)) (or (< |thread1Thread1of1ForFork0_#t~mem1#1| ~last~0) (<= ~n~0 ~end~0) (< ~end~0 0) (forall ((~queue~0.base Int)) (or (and (not (= 0 (mod ~ok~0 256))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~end~0 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))))))), Black: 1362#(and (<= ~n~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 284#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~start~0 0) (< 0 (+ (* 4 ~start~0) ~queue~0.offset 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))), Black: 1390#(and (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 1289#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1309#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))), Black: 1376#(and (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ (* 4 ~end~0) ~queue~0.offset) 0) (<= ~n~0 1)) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (and (< 0 (+ (* 4 ~start~0) ~queue~0.offset 1)) (or (<= (+ (* 4 ~start~0) ~queue~0.offset) 0) (<= (+ ~n~0 ~start~0) (+ ~end~0 1))))) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (= ~last~0 ~v_old~0)), Black: 1347#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 1400#(and (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ (* 4 ~end~0) ~queue~0.offset) 0) (<= ~n~0 1)) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (or (<= 1 ~end~0) (= (* 4 ~start~0) (* 4 ~end~0)) (< ~end~0 0)) (= ~last~0 ~v_old~0)), 9#L59true, Black: 864#(or (and (not (= 0 (mod ~ok~0 256))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256))), Black: 1313#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))), Black: 860#(and (not (= 0 (mod ~ok~0 256))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))), Black: 1392#(and (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ (* 4 ~end~0) ~queue~0.offset) 0) (<= ~n~0 1)) (exists ((~A~0.offset Int) (v_~end~0_60 Int) (~i~0 Int) (~A~0.base Int)) (and (< v_~end~0_60 1) (<= ~start~0 v_~end~0_60) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_60 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= 0 v_~end~0_60) (<= v_~end~0_60 ~start~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~last~0 ~v_old~0)), 1506#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~start~0 0) (< 0 (+ (* 4 ~start~0) ~queue~0.offset 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))), Black: 1353#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 1378#(and (= ~ok~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (or (<= ~v_old~0 ~last~0) (<= ~n~0 ~end~0) (< ~end~0 0)) (or (< |thread1Thread1of1ForFork0_#t~mem1#1| ~last~0) (<= ~n~0 ~end~0) (< ~end~0 0) (forall ((~queue~0.base Int)) (or (and (not (= 0 (mod ~ok~0 256))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~end~0 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))))))), Black: 1305#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0)), Black: 1307#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 1335#(and (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 1301#(and (= ~queue~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1327#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (= ~last~0 ~v_old~0)), Black: 1297#(and (= ~queue~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_main_#t~ret12#1.offset| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1358#(and (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 1422#(and (<= ~v_old~0 ~new~0) (not (= 0 (mod ~ok~0 256))) (or (<= 1 ~end~0) (= (* 4 ~start~0) (* 4 ~end~0)) (< ~end~0 0))), Black: 1311#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 4294967294)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 1287#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 700#(and (= ~queue~0.offset 0) (= ~ok~0 1) (< ~i~0 ~N~0) (exists ((~A~0.offset Int) (v_~end~0_60 Int) (~A~0.base Int)) (and (< v_~end~0_60 1) (<= ~start~0 v_~end~0_60) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_60 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= 0 v_~end~0_60) (<= v_~end~0_60 ~start~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))))), Black: 1428#(and (<= ~v_old~0 ~new~0) (= ~ok~0 1) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (or (<= 1 ~end~0) (= (* 4 ~start~0) (* 4 ~end~0)) (< ~end~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1291#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~n~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1426#(and (<= ~v_old~0 ~new~0) (= ~ok~0 1) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1374#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (= ~last~0 ~v_old~0)), Black: 1349#(and (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (= ~last~0 ~v_old~0)), Black: 1406#(and (<= ~v_old~0 ~new~0) (= ~ok~0 1) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset))))), Black: 1315#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))))), Black: 1293#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1396#(and (= ~ok~0 1) (or (<= 1 ~end~0) (= (* 4 ~start~0) (* 4 ~end~0)) (< ~end~0 0)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))), 184#true, Black: 1430#(and (<= ~v_old~0 ~new~0) (= ~ok~0 1) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (or (<= 1 ~end~0) (= (* 4 ~start~0) (* 4 ~end~0)) (< ~end~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1339#(and (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ (* 4 ~end~0) ~queue~0.offset) 0) (<= ~n~0 1)) (or (not (= (* 4 ~start~0) (* 4 ~end~0))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))) (< ~i~0 ~N~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|)) (exists ((~A~0.offset Int) (v_~end~0_60 Int) (~A~0.base Int)) (and (< v_~end~0_60 1) (<= ~start~0 v_~end~0_60) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_60 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= 0 v_~end~0_60) (<= v_~end~0_60 ~start~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))))), Black: 1416#(and (not (= 0 (mod ~ok~0 256))) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset))))), Black: 1331#(and (= ~ok~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (<= ~v_old~0 ~last~0) (<= ~n~0 ~end~0) (< ~end~0 0))), Black: 1317#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 1329#(and (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 1165#(or (<= 1 ~end~0) (< ~end~0 0) (and (= (* 4 ~start~0) (* 4 ~end~0)) (not (= 0 (mod ~ok~0 256))))), Black: 1418#(and (<= ~v_old~0 ~new~0) (= ~ok~0 1) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (or (<= 1 ~end~0) (= (* 4 ~start~0) (* 4 ~end~0)) (< ~end~0 0))), Black: 1364#(and (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ (* 4 ~end~0) ~queue~0.offset) 0) (<= ~n~0 1)) (or (not (= (* 4 ~start~0) (* 4 ~end~0))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))) (< ~i~0 ~N~0) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|)) (exists ((~A~0.offset Int) (v_~end~0_60 Int) (~A~0.base Int)) (and (< v_~end~0_60 1) (<= ~start~0 v_~end~0_60) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_60 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= 0 v_~end~0_60) (<= v_~end~0_60 ~start~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))))), Black: 1341#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (= ~last~0 ~v_old~0)), Black: 1424#(and (<= ~v_old~0 ~new~0) (= ~ok~0 1) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1283#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 506#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0)), Black: 707#(and (= ~queue~0.offset 0) (= ~ok~0 1) (exists ((~A~0.offset Int) (v_~end~0_60 Int) (~i~0 Int) (~A~0.base Int)) (and (< v_~end~0_60 1) (<= ~start~0 v_~end~0_60) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_60 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= 0 v_~end~0_60) (<= v_~end~0_60 ~start~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)), Black: 1370#(and (= ~ok~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (or (<= ~v_old~0 ~last~0) (<= ~n~0 ~end~0) (< ~end~0 0))), Black: 856#(and (<= ~v_old~0 ~new~0) (not (= 0 (mod ~ok~0 256)))), Black: 1382#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 208#(and (<= ~end~0 ~start~0) (or (= 0 |thread2Thread1of1ForFork1_~cond~0#1|) (< ~i~0 ~N~0))), Black: 206#(and (< ~i~0 ~N~0) (<= ~end~0 ~start~0)), Black: 202#(<= ~end~0 ~start~0), Black: 222#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 122#L70true, 252#(and (<= 1 |thread2Thread1of1ForFork1_~cond~0#1|) (<= (div |thread2Thread1of1ForFork1_~cond~0#1| 256) 0)), 200#true, Black: 240#(and (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 238#(and (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-16 03:07:28,818 INFO L384 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2021-12-16 03:07:28,818 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2021-12-16 03:07:28,818 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2021-12-16 03:07:28,818 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2021-12-16 03:07:29,770 INFO L129 PetriNetUnfolder]: 3991/8008 cut-off events. [2021-12-16 03:07:29,770 INFO L130 PetriNetUnfolder]: For 82683/83373 co-relation queries the response was YES. [2021-12-16 03:07:29,836 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44430 conditions, 8008 events. 3991/8008 cut-off events. For 82683/83373 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 66271 event pairs, 863 based on Foata normal form. 68/7772 useless extension candidates. Maximal degree in co-relation 44361. Up to 2040 conditions per place. [2021-12-16 03:07:29,887 INFO L132 encePairwiseOnDemand]: 153/189 looper letters, 373 selfloop transitions, 84 changer transitions 15/538 dead transitions. [2021-12-16 03:07:29,888 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 538 transitions, 4514 flow [2021-12-16 03:07:29,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-16 03:07:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2021-12-16 03:07:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2603 transitions. [2021-12-16 03:07:29,891 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.405073140367258 [2021-12-16 03:07:29,892 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 2603 transitions. [2021-12-16 03:07:29,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 2603 transitions. [2021-12-16 03:07:29,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:07:29,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 2603 transitions. [2021-12-16 03:07:29,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 76.55882352941177) internal successors, (2603), 34 states have internal predecessors, (2603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:29,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 189.0) internal successors, (6615), 35 states have internal predecessors, (6615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:29,905 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 189.0) internal successors, (6615), 35 states have internal predecessors, (6615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:29,905 INFO L186 Difference]: Start difference. First operand has 332 places, 358 transitions, 2135 flow. Second operand 34 states and 2603 transitions. [2021-12-16 03:07:29,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 538 transitions, 4514 flow [2021-12-16 03:07:30,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 538 transitions, 4226 flow, removed 137 selfloop flow, removed 22 redundant places. [2021-12-16 03:07:30,178 INFO L242 Difference]: Finished difference. Result has 326 places, 379 transitions, 2419 flow [2021-12-16 03:07:30,179 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=1995, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2419, PETRI_PLACES=326, PETRI_TRANSITIONS=379} [2021-12-16 03:07:30,180 INFO L334 CegarLoopForPetriNet]: 170 programPoint places, 156 predicate places. [2021-12-16 03:07:30,180 INFO L470 AbstractCegarLoop]: Abstraction has has 326 places, 379 transitions, 2419 flow [2021-12-16 03:07:30,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 72.88461538461539) internal successors, (1895), 26 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:30,181 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:07:30,181 INFO L254 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] [2021-12-16 03:07:30,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-16 03:07:30,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-12-16 03:07:30,408 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-16 03:07:30,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:07:30,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1715049940, now seen corresponding path program 4 times [2021-12-16 03:07:30,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:07:30,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433759248] [2021-12-16 03:07:30,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:07:30,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:07:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:07:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 03:07:31,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:07:31,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433759248] [2021-12-16 03:07:31,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433759248] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:07:31,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870678761] [2021-12-16 03:07:31,299 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-16 03:07:31,299 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:07:31,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:07:31,300 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) [2021-12-16 03:07:31,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-16 03:07:31,395 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-16 03:07:31,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 03:07:31,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-16 03:07:31,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:07:31,819 INFO L388 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 [2021-12-16 03:07:31,999 INFO L388 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 15 treesize of output 11 [2021-12-16 03:07:32,652 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 03:07:32,652 INFO L388 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 [2021-12-16 03:07:32,831 INFO L388 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 [2021-12-16 03:07:33,191 INFO L388 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 6 treesize of output 5 [2021-12-16 03:07:33,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 03:07:33,661 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-12-16 03:07:33,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2021-12-16 03:07:33,674 INFO L388 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 27 treesize of output 15 [2021-12-16 03:07:33,907 INFO L388 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 23 treesize of output 7 [2021-12-16 03:07:33,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 03:07:33,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:07:34,268 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 0 (mod c_~ok~0 256))) (forall ((v_ArrVal_188 (Array Int Int))) (<= c_~v_old~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_188) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset))))) is different from false [2021-12-16 03:07:40,288 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 03:07:40,289 INFO L388 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 122 treesize of output 86 [2021-12-16 03:07:40,345 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 03:07:40,346 INFO L388 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 14912 treesize of output 13217 [2021-12-16 03:07:40,403 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 03:07:40,404 INFO L388 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 13217 treesize of output 10577 [2021-12-16 03:07:40,483 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 03:07:40,484 INFO L388 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 10577 treesize of output 9281 [2021-12-16 03:07:40,577 INFO L388 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 8189 treesize of output 6653 [2021-12-16 03:07:40,637 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-16 03:07:40,637 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-16 03:07:40,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2021-12-16 03:07:40,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972227180] [2021-12-16 03:07:40,638 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-16 03:07:40,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-16 03:07:40,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:07:40,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-16 03:07:40,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=4608, Unknown=33, NotChecked=140, Total=5256 [2021-12-16 03:07:40,642 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 189 [2021-12-16 03:07:40,644 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 379 transitions, 2419 flow. Second operand has 25 states, 25 states have (on average 68.16) internal successors, (1704), 25 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:40,644 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:07:40,644 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 189 [2021-12-16 03:07:40,644 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:07:43,358 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([538] L49-5-->L59: Formula: (= v_~i~0_15 (+ v_~i~0_16 1)) InVars {~i~0=v_~i~0_16} OutVars{thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_1|, ~i~0=v_~i~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post6#1, ~i~0][395], [Black: 251#(< ~i~0 ~N~0), Black: 254#(and (<= 1 |thread2Thread1of1ForFork1_~cond~0#1|) (< ~i~0 ~N~0) (<= (div |thread2Thread1of1ForFork1_~cond~0#1| 256) 0)), 189#(= ~ok~0 1), 56#L103-1true, 260#true, Black: 1295#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_main_#t~ret12#1.offset| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1345#(and (= ~ok~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (<= ~v_old~0 ~last~0) (<= ~n~0 ~end~0) (< ~end~0 0)) (or (< |thread1Thread1of1ForFork0_#t~mem1#1| ~last~0) (<= ~n~0 ~end~0) (< ~end~0 0) (forall ((~queue~0.base Int)) (or (and (not (= 0 (mod ~ok~0 256))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~end~0 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))))))), Black: 284#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~start~0 0) (< 0 (+ (* 4 ~start~0) ~queue~0.offset 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))), Black: 1289#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1309#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))), Black: 1376#(and (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ (* 4 ~end~0) ~queue~0.offset) 0) (<= ~n~0 1)) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (and (< 0 (+ (* 4 ~start~0) ~queue~0.offset 1)) (or (<= (+ (* 4 ~start~0) ~queue~0.offset) 0) (<= (+ ~n~0 ~start~0) (+ ~end~0 1))))) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (= ~last~0 ~v_old~0)), Black: 1347#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 1400#(and (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ (* 4 ~end~0) ~queue~0.offset) 0) (<= ~n~0 1)) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (or (<= 1 ~end~0) (= (* 4 ~start~0) (* 4 ~end~0)) (< ~end~0 0)) (= ~last~0 ~v_old~0)), 9#L59true, Black: 864#(or (and (not (= 0 (mod ~ok~0 256))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))) (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256))), Black: 1313#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))), Black: 860#(and (not (= 0 (mod ~ok~0 256))) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))), Black: 1392#(and (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ (* 4 ~end~0) ~queue~0.offset) 0) (<= ~n~0 1)) (exists ((~A~0.offset Int) (v_~end~0_60 Int) (~i~0 Int) (~A~0.base Int)) (and (< v_~end~0_60 1) (<= ~start~0 v_~end~0_60) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_60 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= 0 v_~end~0_60) (<= v_~end~0_60 ~start~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~last~0 ~v_old~0)), 1506#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~start~0 0) (< 0 (+ (* 4 ~start~0) ~queue~0.offset 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset)))), Black: 1353#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 1305#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0)), Black: 1307#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 1335#(and (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 1301#(and (= ~queue~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1327#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (= ~last~0 ~v_old~0)), Black: 1297#(and (= ~queue~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_main_#t~ret12#1.offset| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1422#(and (<= ~v_old~0 ~new~0) (not (= 0 (mod ~ok~0 256))) (or (<= 1 ~end~0) (= (* 4 ~start~0) (* 4 ~end~0)) (< ~end~0 0))), Black: 1311#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 4294967294)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 1287#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 700#(and (= ~queue~0.offset 0) (= ~ok~0 1) (< ~i~0 ~N~0) (exists ((~A~0.offset Int) (v_~end~0_60 Int) (~A~0.base Int)) (and (< v_~end~0_60 1) (<= ~start~0 v_~end~0_60) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_60 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= 0 v_~end~0_60) (<= v_~end~0_60 ~start~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))))), Black: 1291#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~n~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), Black: 1406#(and (<= ~v_old~0 ~new~0) (= ~ok~0 1) (or (= 0 (mod |thread2Thread1of1ForFork1_~cond~0#1| 256)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset))))), Black: 1315#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))))), Black: 1293#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), 184#true, Black: 1339#(and (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ (* 4 ~end~0) ~queue~0.offset) 0) (<= ~n~0 1)) (or (not (= (* 4 ~start~0) (* 4 ~end~0))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))) (< ~i~0 ~N~0) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|)) (exists ((~A~0.offset Int) (v_~end~0_60 Int) (~A~0.base Int)) (and (< v_~end~0_60 1) (<= ~start~0 v_~end~0_60) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_60 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= 0 v_~end~0_60) (<= v_~end~0_60 ~start~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))))), Black: 1331#(and (= ~ok~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (<= ~v_old~0 ~last~0) (<= ~n~0 ~end~0) (< ~end~0 0))), Black: 1317#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (or (= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (or (= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 1329#(and (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (and (= |ULTIMATE.start_create_fresh_int_array_#t~post22#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)))) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| (+ (* 4294967296 (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296)) 1073741823)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|))), Black: 1165#(or (<= 1 ~end~0) (< ~end~0 0) (and (= (* 4 ~start~0) (* 4 ~end~0)) (not (= 0 (mod ~ok~0 256))))), Black: 1364#(and (= ~queue~0.offset 0) (= ~ok~0 1) (or (<= (+ (* 4 ~end~0) ~queue~0.offset) 0) (<= ~n~0 1)) (or (not (= (* 4 ~start~0) (* 4 ~end~0))) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))) (< ~i~0 ~N~0) (= ~last~0 ~v_old~0) (or (not (= 0 (+ (* 4 ~end~0) ~queue~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))) |thread1Thread1of1ForFork0_#t~mem1#1|)) (exists ((~A~0.offset Int) (v_~end~0_60 Int) (~A~0.base Int)) (and (< v_~end~0_60 1) (<= ~start~0 v_~end~0_60) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_60 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= 0 v_~end~0_60) (<= v_~end~0_60 ~start~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4))))))), Black: 1341#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (< ~i~0 ~N~0) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (= ~last~0 ~v_old~0)), Black: 1283#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 506#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= ~n~0 1) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0)), Black: 707#(and (= ~queue~0.offset 0) (= ~ok~0 1) (exists ((~A~0.offset Int) (v_~end~0_60 Int) (~i~0 Int) (~A~0.base Int)) (and (< v_~end~0_60 1) (<= ~start~0 v_~end~0_60) (= (select (select |#memory_int| ~queue~0.base) (+ (* v_~end~0_60 4) ~queue~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))) (<= 0 v_~end~0_60) (<= v_~end~0_60 ~start~0) (<= ~v_old~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~i~0 4)))))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)), Black: 856#(and (<= ~v_old~0 ~new~0) (not (= 0 (mod ~ok~0 256)))), Black: 208#(and (<= ~end~0 ~start~0) (or (= 0 |thread2Thread1of1ForFork1_~cond~0#1|) (< ~i~0 ~N~0))), Black: 206#(and (< ~i~0 ~N~0) (<= ~end~0 ~start~0)), Black: 202#(<= ~end~0 ~start~0), Black: 2349#(and (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= (+ ~n~0 ~start~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~end~0)) (<= ~start~0 ~end~0) (<= ~end~0 ~start~0) (<= (+ ~n~0 ~start~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~end~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1507#(and (<= ~v_old~0 ~new~0) (= ~ok~0 1)), Black: 2387#(and (<= ~v_old~0 ~new~0) (= ~ok~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2385#(and (<= ~v_old~0 ~new~0) (= ~ok~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1487#(= ~ok~0 1), 3292#(and (= ~queue~0.offset 0) (= ~ok~0 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~start~0 0) (< 0 (+ (* 4 ~start~0) ~queue~0.offset 1)) (<= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~start~0 4) ~queue~0.offset))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 222#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 122#L70true, 252#(and (<= 1 |thread2Thread1of1ForFork1_~cond~0#1|) (<= (div |thread2Thread1of1ForFork1_~cond~0#1| 256) 0)), 200#true, Black: 240#(and (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 238#(and (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-16 03:07:43,359 INFO L384 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2021-12-16 03:07:43,359 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2021-12-16 03:07:43,359 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2021-12-16 03:07:43,359 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2021-12-16 03:07:44,156 INFO L129 PetriNetUnfolder]: 4732/9367 cut-off events. [2021-12-16 03:07:44,157 INFO L130 PetriNetUnfolder]: For 85509/86201 co-relation queries the response was YES. [2021-12-16 03:07:44,266 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50592 conditions, 9367 events. 4732/9367 cut-off events. For 85509/86201 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 79575 event pairs, 934 based on Foata normal form. 90/9110 useless extension candidates. Maximal degree in co-relation 50531. Up to 2391 conditions per place. [2021-12-16 03:07:44,310 INFO L132 encePairwiseOnDemand]: 157/189 looper letters, 385 selfloop transitions, 82 changer transitions 15/545 dead transitions. [2021-12-16 03:07:44,311 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 545 transitions, 4634 flow [2021-12-16 03:07:44,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-16 03:07:44,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2021-12-16 03:07:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2244 transitions. [2021-12-16 03:07:44,314 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.3830005120327701 [2021-12-16 03:07:44,314 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 2244 transitions. [2021-12-16 03:07:44,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 2244 transitions. [2021-12-16 03:07:44,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:07:44,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2244 transitions. [2021-12-16 03:07:44,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 72.38709677419355) internal successors, (2244), 31 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:44,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 189.0) internal successors, (6048), 32 states have internal predecessors, (6048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:44,328 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 189.0) internal successors, (6048), 32 states have internal predecessors, (6048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:44,328 INFO L186 Difference]: Start difference. First operand has 326 places, 379 transitions, 2419 flow. Second operand 31 states and 2244 transitions. [2021-12-16 03:07:44,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 545 transitions, 4634 flow [2021-12-16 03:07:44,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 545 transitions, 4528 flow, removed 5 selfloop flow, removed 29 redundant places. [2021-12-16 03:07:44,530 INFO L242 Difference]: Finished difference. Result has 330 places, 388 transitions, 2671 flow [2021-12-16 03:07:44,531 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=2317, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=2671, PETRI_PLACES=330, PETRI_TRANSITIONS=388} [2021-12-16 03:07:44,532 INFO L334 CegarLoopForPetriNet]: 170 programPoint places, 160 predicate places. [2021-12-16 03:07:44,532 INFO L470 AbstractCegarLoop]: Abstraction has has 330 places, 388 transitions, 2671 flow [2021-12-16 03:07:44,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 68.16) internal successors, (1704), 25 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 03:07:44,532 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:07:44,533 INFO L254 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] [2021-12-16 03:07:44,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-16 03:07:44,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:07:44,735 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-16 03:07:44,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:07:44,735 INFO L85 PathProgramCache]: Analyzing trace with hash -454610096, now seen corresponding path program 5 times [2021-12-16 03:07:44,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:07:44,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572582097] [2021-12-16 03:07:44,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:07:44,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:07:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:07:45,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 03:07:45,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:07:45,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572582097] [2021-12-16 03:07:45,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572582097] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:07:45,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440779449] [2021-12-16 03:07:45,775 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 03:07:45,775 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:07:45,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:07:45,777 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) [2021-12-16 03:07:45,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-16 03:07:45,869 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 03:07:45,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 03:07:45,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-16 03:07:45,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:07:47,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 03:07:47,873 INFO L388 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 18 treesize of output 20 [2021-12-16 03:07:48,383 INFO L388 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 19 treesize of output 7 [2021-12-16 03:07:48,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 03:07:48,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:07:49,370 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 03:07:49,370 INFO L388 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 151 treesize of output 157 [2021-12-16 03:07:49,392 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 03:07:49,392 INFO L388 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 100 treesize of output 118