./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-max-array-hom.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-max-array-hom.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 251696ec6cec82b3ac56ff493f8f4412eaff7e5010650cc9da1e4c426de80d8c --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 23:02:16,892 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 23:02:16,902 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 23:02:16,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 23:02:16,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 23:02:16,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 23:02:16,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 23:02:16,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 23:02:16,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 23:02:16,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 23:02:16,969 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 23:02:16,970 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 23:02:16,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 23:02:16,973 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 23:02:16,974 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 23:02:16,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 23:02:16,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 23:02:16,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 23:02:16,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 23:02:16,986 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 23:02:16,987 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 23:02:16,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 23:02:16,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 23:02:16,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 23:02:16,996 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 23:02:16,996 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 23:02:16,997 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 23:02:16,998 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 23:02:16,998 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 23:02:16,999 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 23:02:16,999 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 23:02:17,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 23:02:17,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 23:02:17,002 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 23:02:17,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 23:02:17,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 23:02:17,004 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 23:02:17,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 23:02:17,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 23:02:17,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 23:02:17,006 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 23:02:17,008 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 23:02:17,037 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 23:02:17,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 23:02:17,038 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 23:02:17,039 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 23:02:17,040 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 23:02:17,040 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 23:02:17,040 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 23:02:17,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 23:02:17,041 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 23:02:17,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 23:02:17,042 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 23:02:17,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 23:02:17,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 23:02:17,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 23:02:17,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 23:02:17,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 23:02:17,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 23:02:17,044 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 23:02:17,044 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 23:02:17,044 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 23:02:17,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 23:02:17,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 23:02:17,045 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 23:02:17,045 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 23:02:17,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 23:02:17,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 23:02:17,046 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 23:02:17,046 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 23:02:17,046 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 23:02:17,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 23:02:17,047 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 23:02:17,047 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 23:02:17,047 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 23:02:17,047 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 23:02:17,048 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 -> 251696ec6cec82b3ac56ff493f8f4412eaff7e5010650cc9da1e4c426de80d8c [2021-12-17 23:02:17,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 23:02:17,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 23:02:17,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 23:02:17,311 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 23:02:17,311 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 23:02:17,312 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2021-12-17 23:02:17,368 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dca4f445d/1f597397088b4f2d8ffb7280b2db1a96/FLAGf857f1a9e [2021-12-17 23:02:17,773 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 23:02:17,774 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2021-12-17 23:02:17,780 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dca4f445d/1f597397088b4f2d8ffb7280b2db1a96/FLAGf857f1a9e [2021-12-17 23:02:18,199 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dca4f445d/1f597397088b4f2d8ffb7280b2db1a96 [2021-12-17 23:02:18,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 23:02:18,203 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 23:02:18,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 23:02:18,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 23:02:18,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 23:02:18,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:02:18" (1/1) ... [2021-12-17 23:02:18,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ba82e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:02:18, skipping insertion in model container [2021-12-17 23:02:18,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:02:18" (1/1) ... [2021-12-17 23:02:18,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 23:02:18,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 23:02:18,420 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-max-array-hom.wvr.c[2586,2599] [2021-12-17 23:02:18,435 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 23:02:18,443 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 23:02:18,478 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-max-array-hom.wvr.c[2586,2599] [2021-12-17 23:02:18,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 23:02:18,498 INFO L208 MainTranslator]: Completed translation [2021-12-17 23:02:18,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:02:18 WrapperNode [2021-12-17 23:02:18,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 23:02:18,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 23:02:18,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 23:02:18,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 23:02:18,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:02:18" (1/1) ... [2021-12-17 23:02:18,521 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:02:18" (1/1) ... [2021-12-17 23:02:18,547 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 106 [2021-12-17 23:02:18,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 23:02:18,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 23:02:18,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 23:02:18,548 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 23:02:18,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:02:18" (1/1) ... [2021-12-17 23:02:18,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:02:18" (1/1) ... [2021-12-17 23:02:18,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:02:18" (1/1) ... [2021-12-17 23:02:18,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:02:18" (1/1) ... [2021-12-17 23:02:18,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:02:18" (1/1) ... [2021-12-17 23:02:18,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:02:18" (1/1) ... [2021-12-17 23:02:18,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:02:18" (1/1) ... [2021-12-17 23:02:18,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 23:02:18,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 23:02:18,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 23:02:18,576 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 23:02:18,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:02:18" (1/1) ... [2021-12-17 23:02:18,591 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 23:02:18,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:02:18,615 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-17 23:02:18,631 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-17 23:02:18,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 23:02:18,648 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-17 23:02:18,648 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-17 23:02:18,648 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-17 23:02:18,648 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-17 23:02:18,648 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-12-17 23:02:18,648 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-12-17 23:02:18,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 23:02:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 23:02:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 23:02:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-17 23:02:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-17 23:02:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 23:02:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 23:02:18,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 23:02:18,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 23:02:18,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 23:02:18,651 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-17 23:02:18,750 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 23:02:18,752 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 23:02:19,035 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 23:02:19,097 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 23:02:19,097 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-17 23:02:19,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:02:19 BoogieIcfgContainer [2021-12-17 23:02:19,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 23:02:19,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 23:02:19,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 23:02:19,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 23:02:19,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 11:02:18" (1/3) ... [2021-12-17 23:02:19,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3183fadd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:02:19, skipping insertion in model container [2021-12-17 23:02:19,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:02:18" (2/3) ... [2021-12-17 23:02:19,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3183fadd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:02:19, skipping insertion in model container [2021-12-17 23:02:19,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:02:19" (3/3) ... [2021-12-17 23:02:19,112 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2021-12-17 23:02:19,126 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-17 23:02:19,127 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 23:02:19,127 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 23:02:19,127 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-17 23:02:19,170 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,171 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,171 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,171 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,171 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,172 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,172 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,172 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,172 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,172 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,174 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,174 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,174 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,175 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,175 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,175 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,176 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,176 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,176 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,177 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,177 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,177 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,178 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,178 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,178 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,178 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,179 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,179 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,179 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,179 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,180 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,180 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,180 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,180 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,180 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,181 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,181 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,181 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,181 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,181 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,182 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,182 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,182 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,182 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,183 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,183 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,183 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,183 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,183 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,184 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,184 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,184 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,184 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,185 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,186 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,186 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,187 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,187 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,187 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,188 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,188 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,188 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,188 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,189 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,189 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,189 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,189 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,189 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,189 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,190 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,190 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,190 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,190 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,191 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,191 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,192 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,194 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,194 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,194 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,195 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,196 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,196 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,200 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,200 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,200 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,205 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,205 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,205 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,207 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,207 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,207 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,208 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,208 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,208 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,209 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,209 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,209 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,209 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,209 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,210 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:02:19,214 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-12-17 23:02:19,266 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 23:02:19,273 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-17 23:02:19,274 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-12-17 23:02:19,288 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 156 places, 159 transitions, 342 flow [2021-12-17 23:02:19,363 INFO L129 PetriNetUnfolder]: 13/156 cut-off events. [2021-12-17 23:02:19,366 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-17 23:02:19,369 INFO L84 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 156 events. 13/156 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 96 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2021-12-17 23:02:19,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 159 transitions, 342 flow [2021-12-17 23:02:19,376 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 145 transitions, 308 flow [2021-12-17 23:02:19,417 INFO L129 PetriNetUnfolder]: 13/144 cut-off events. [2021-12-17 23:02:19,423 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-17 23:02:19,424 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:02:19,424 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] [2021-12-17 23:02:19,425 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 23:02:19,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:02:19,430 INFO L85 PathProgramCache]: Analyzing trace with hash -363023648, now seen corresponding path program 1 times [2021-12-17 23:02:19,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:02:19,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605907049] [2021-12-17 23:02:19,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:02:19,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:02:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:02:19,642 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-17 23:02:19,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:02:19,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605907049] [2021-12-17 23:02:19,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605907049] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:02:19,644 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:02:19,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 23:02:19,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312958945] [2021-12-17 23:02:19,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:02:19,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 23:02:19,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:02:19,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 23:02:19,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 23:02:19,697 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 159 [2021-12-17 23:02:19,702 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 145 transitions, 308 flow. Second operand has 2 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 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-17 23:02:19,702 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:02:19,702 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 159 [2021-12-17 23:02:19,703 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:02:19,789 INFO L129 PetriNetUnfolder]: 42/270 cut-off events. [2021-12-17 23:02:19,790 INFO L130 PetriNetUnfolder]: For 50/51 co-relation queries the response was YES. [2021-12-17 23:02:19,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 270 events. 42/270 cut-off events. For 50/51 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 719 event pairs, 15 based on Foata normal form. 42/281 useless extension candidates. Maximal degree in co-relation 216. Up to 59 conditions per place. [2021-12-17 23:02:19,796 INFO L132 encePairwiseOnDemand]: 151/159 looper letters, 9 selfloop transitions, 0 changer transitions 4/137 dead transitions. [2021-12-17 23:02:19,797 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 310 flow [2021-12-17 23:02:19,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 23:02:19,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-17 23:02:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 299 transitions. [2021-12-17 23:02:19,816 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.940251572327044 [2021-12-17 23:02:19,817 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 299 transitions. [2021-12-17 23:02:19,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 299 transitions. [2021-12-17 23:02:19,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:02:19,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 299 transitions. [2021-12-17 23:02:19,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 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-17 23:02:19,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 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-17 23:02:19,835 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 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-17 23:02:19,836 INFO L186 Difference]: Start difference. First operand has 142 places, 145 transitions, 308 flow. Second operand 2 states and 299 transitions. [2021-12-17 23:02:19,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 310 flow [2021-12-17 23:02:19,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 137 transitions, 298 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-12-17 23:02:19,845 INFO L242 Difference]: Finished difference. Result has 137 places, 133 transitions, 272 flow [2021-12-17 23:02:19,846 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=272, PETRI_PLACES=137, PETRI_TRANSITIONS=133} [2021-12-17 23:02:19,850 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, -5 predicate places. [2021-12-17 23:02:19,851 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 133 transitions, 272 flow [2021-12-17 23:02:19,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 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-17 23:02:19,851 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:02:19,852 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] [2021-12-17 23:02:19,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 23:02:19,852 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 23:02:19,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:02:19,853 INFO L85 PathProgramCache]: Analyzing trace with hash 811959335, now seen corresponding path program 1 times [2021-12-17 23:02:19,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:02:19,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077278483] [2021-12-17 23:02:19,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:02:19,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:02:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:02:20,094 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-17 23:02:20,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:02:20,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077278483] [2021-12-17 23:02:20,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077278483] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:02:20,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:02:20,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 23:02:20,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266102161] [2021-12-17 23:02:20,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:02:20,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 23:02:20,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:02:20,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 23:02:20,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 23:02:20,099 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 159 [2021-12-17 23:02:20,100 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 133 transitions, 272 flow. Second operand has 7 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 0 states have call successors, (0), 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-17 23:02:20,100 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:02:20,100 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 159 [2021-12-17 23:02:20,100 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:02:20,285 INFO L129 PetriNetUnfolder]: 50/349 cut-off events. [2021-12-17 23:02:20,285 INFO L130 PetriNetUnfolder]: For 21/22 co-relation queries the response was YES. [2021-12-17 23:02:20,286 INFO L84 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 349 events. 50/349 cut-off events. For 21/22 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1157 event pairs, 4 based on Foata normal form. 2/323 useless extension candidates. Maximal degree in co-relation 478. Up to 51 conditions per place. [2021-12-17 23:02:20,288 INFO L132 encePairwiseOnDemand]: 151/159 looper letters, 59 selfloop transitions, 5 changer transitions 5/169 dead transitions. [2021-12-17 23:02:20,288 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 169 transitions, 491 flow [2021-12-17 23:02:20,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 23:02:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-17 23:02:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2021-12-17 23:02:20,292 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7735849056603774 [2021-12-17 23:02:20,292 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 861 transitions. [2021-12-17 23:02:20,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 861 transitions. [2021-12-17 23:02:20,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:02:20,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 861 transitions. [2021-12-17 23:02:20,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 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-17 23:02:20,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 159.0) internal successors, (1272), 8 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 23:02:20,303 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 159.0) internal successors, (1272), 8 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 23:02:20,303 INFO L186 Difference]: Start difference. First operand has 137 places, 133 transitions, 272 flow. Second operand 7 states and 861 transitions. [2021-12-17 23:02:20,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 169 transitions, 491 flow [2021-12-17 23:02:20,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 169 transitions, 491 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-17 23:02:20,309 INFO L242 Difference]: Finished difference. Result has 143 places, 136 transitions, 303 flow [2021-12-17 23:02:20,310 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=303, PETRI_PLACES=143, PETRI_TRANSITIONS=136} [2021-12-17 23:02:20,310 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 1 predicate places. [2021-12-17 23:02:20,311 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 136 transitions, 303 flow [2021-12-17 23:02:20,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 0 states have call successors, (0), 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-17 23:02:20,311 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:02:20,312 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] [2021-12-17 23:02:20,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 23:02:20,312 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 23:02:20,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:02:20,313 INFO L85 PathProgramCache]: Analyzing trace with hash 413321701, now seen corresponding path program 1 times [2021-12-17 23:02:20,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:02:20,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952135144] [2021-12-17 23:02:20,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:02:20,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:02:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:02:20,403 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-17 23:02:20,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:02:20,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952135144] [2021-12-17 23:02:20,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952135144] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:02:20,404 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:02:20,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 23:02:20,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59354539] [2021-12-17 23:02:20,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:02:20,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 23:02:20,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:02:20,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 23:02:20,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 23:02:20,407 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 159 [2021-12-17 23:02:20,408 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 136 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 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-17 23:02:20,408 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:02:20,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 159 [2021-12-17 23:02:20,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:02:20,480 INFO L129 PetriNetUnfolder]: 57/392 cut-off events. [2021-12-17 23:02:20,480 INFO L130 PetriNetUnfolder]: For 56/57 co-relation queries the response was YES. [2021-12-17 23:02:20,481 INFO L84 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 392 events. 57/392 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1413 event pairs, 6 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 570. Up to 59 conditions per place. [2021-12-17 23:02:20,483 INFO L132 encePairwiseOnDemand]: 154/159 looper letters, 32 selfloop transitions, 7 changer transitions 0/157 dead transitions. [2021-12-17 23:02:20,483 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 157 transitions, 448 flow [2021-12-17 23:02:20,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 23:02:20,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-17 23:02:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 575 transitions. [2021-12-17 23:02:20,485 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9040880503144654 [2021-12-17 23:02:20,485 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 575 transitions. [2021-12-17 23:02:20,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 575 transitions. [2021-12-17 23:02:20,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:02:20,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 575 transitions. [2021-12-17 23:02:20,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 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-17 23:02:20,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 159.0) internal successors, (795), 5 states have internal predecessors, (795), 0 states have call successors, (0), 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-17 23:02:20,489 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 159.0) internal successors, (795), 5 states have internal predecessors, (795), 0 states have call successors, (0), 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-17 23:02:20,490 INFO L186 Difference]: Start difference. First operand has 143 places, 136 transitions, 303 flow. Second operand 4 states and 575 transitions. [2021-12-17 23:02:20,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 157 transitions, 448 flow [2021-12-17 23:02:20,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 157 transitions, 442 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-12-17 23:02:20,494 INFO L242 Difference]: Finished difference. Result has 141 places, 140 transitions, 336 flow [2021-12-17 23:02:20,494 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=336, PETRI_PLACES=141, PETRI_TRANSITIONS=140} [2021-12-17 23:02:20,495 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, -1 predicate places. [2021-12-17 23:02:20,495 INFO L470 AbstractCegarLoop]: Abstraction has has 141 places, 140 transitions, 336 flow [2021-12-17 23:02:20,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 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-17 23:02:20,496 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:02:20,496 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] [2021-12-17 23:02:20,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 23:02:20,497 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 23:02:20,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:02:20,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1166406698, now seen corresponding path program 1 times [2021-12-17 23:02:20,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:02:20,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983952086] [2021-12-17 23:02:20,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:02:20,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:02:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:02:20,578 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-17 23:02:20,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:02:20,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983952086] [2021-12-17 23:02:20,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983952086] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:02:20,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:02:20,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 23:02:20,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427045879] [2021-12-17 23:02:20,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:02:20,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 23:02:20,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:02:20,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 23:02:20,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-17 23:02:20,582 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 159 [2021-12-17 23:02:20,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 140 transitions, 336 flow. Second operand has 7 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 0 states have call successors, (0), 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-17 23:02:20,584 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:02:20,584 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 159 [2021-12-17 23:02:20,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:02:20,852 INFO L129 PetriNetUnfolder]: 402/1388 cut-off events. [2021-12-17 23:02:20,852 INFO L130 PetriNetUnfolder]: For 598/598 co-relation queries the response was YES. [2021-12-17 23:02:20,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2663 conditions, 1388 events. 402/1388 cut-off events. For 598/598 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 8997 event pairs, 159 based on Foata normal form. 0/1194 useless extension candidates. Maximal degree in co-relation 2656. Up to 473 conditions per place. [2021-12-17 23:02:20,863 INFO L132 encePairwiseOnDemand]: 150/159 looper letters, 60 selfloop transitions, 8 changer transitions 0/170 dead transitions. [2021-12-17 23:02:20,864 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 170 transitions, 580 flow [2021-12-17 23:02:20,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 23:02:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-17 23:02:20,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1008 transitions. [2021-12-17 23:02:20,866 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7924528301886793 [2021-12-17 23:02:20,867 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1008 transitions. [2021-12-17 23:02:20,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1008 transitions. [2021-12-17 23:02:20,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:02:20,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1008 transitions. [2021-12-17 23:02:20,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.0) internal successors, (1008), 8 states have internal predecessors, (1008), 0 states have call successors, (0), 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-17 23:02:20,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 0 states have call successors, (0), 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-17 23:02:20,873 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 0 states have call successors, (0), 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-17 23:02:20,873 INFO L186 Difference]: Start difference. First operand has 141 places, 140 transitions, 336 flow. Second operand 8 states and 1008 transitions. [2021-12-17 23:02:20,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 170 transitions, 580 flow [2021-12-17 23:02:20,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 170 transitions, 580 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-17 23:02:20,878 INFO L242 Difference]: Finished difference. Result has 151 places, 143 transitions, 372 flow [2021-12-17 23:02:20,878 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=372, PETRI_PLACES=151, PETRI_TRANSITIONS=143} [2021-12-17 23:02:20,879 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 9 predicate places. [2021-12-17 23:02:20,879 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 143 transitions, 372 flow [2021-12-17 23:02:20,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 0 states have call successors, (0), 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-17 23:02:20,880 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:02:20,880 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] [2021-12-17 23:02:20,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 23:02:20,880 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 23:02:20,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:02:20,881 INFO L85 PathProgramCache]: Analyzing trace with hash 804051908, now seen corresponding path program 1 times [2021-12-17 23:02:20,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:02:20,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798441802] [2021-12-17 23:02:20,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:02:20,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:02:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:02:21,083 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-17 23:02:21,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:02:21,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798441802] [2021-12-17 23:02:21,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798441802] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:02:21,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:02:21,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 23:02:21,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980462635] [2021-12-17 23:02:21,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:02:21,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 23:02:21,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:02:21,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 23:02:21,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-17 23:02:21,087 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 159 [2021-12-17 23:02:21,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 143 transitions, 372 flow. Second operand has 10 states, 10 states have (on average 101.1) internal successors, (1011), 10 states have internal predecessors, (1011), 0 states have call successors, (0), 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-17 23:02:21,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:02:21,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 159 [2021-12-17 23:02:21,091 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:02:21,658 INFO L129 PetriNetUnfolder]: 1091/2485 cut-off events. [2021-12-17 23:02:21,659 INFO L130 PetriNetUnfolder]: For 670/694 co-relation queries the response was YES. [2021-12-17 23:02:21,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5035 conditions, 2485 events. 1091/2485 cut-off events. For 670/694 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 17699 event pairs, 801 based on Foata normal form. 24/2211 useless extension candidates. Maximal degree in co-relation 5024. Up to 1499 conditions per place. [2021-12-17 23:02:21,677 INFO L132 encePairwiseOnDemand]: 147/159 looper letters, 80 selfloop transitions, 11 changer transitions 0/176 dead transitions. [2021-12-17 23:02:21,678 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 176 transitions, 638 flow [2021-12-17 23:02:21,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 23:02:21,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-17 23:02:21,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1150 transitions. [2021-12-17 23:02:21,681 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.657518582046884 [2021-12-17 23:02:21,682 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1150 transitions. [2021-12-17 23:02:21,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1150 transitions. [2021-12-17 23:02:21,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:02:21,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1150 transitions. [2021-12-17 23:02:21,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 104.54545454545455) internal successors, (1150), 11 states have internal predecessors, (1150), 0 states have call successors, (0), 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-17 23:02:21,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 159.0) internal successors, (1908), 12 states have internal predecessors, (1908), 0 states have call successors, (0), 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-17 23:02:21,688 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 159.0) internal successors, (1908), 12 states have internal predecessors, (1908), 0 states have call successors, (0), 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-17 23:02:21,688 INFO L186 Difference]: Start difference. First operand has 151 places, 143 transitions, 372 flow. Second operand 11 states and 1150 transitions. [2021-12-17 23:02:21,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 176 transitions, 638 flow [2021-12-17 23:02:21,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 176 transitions, 628 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-17 23:02:21,694 INFO L242 Difference]: Finished difference. Result has 162 places, 147 transitions, 411 flow [2021-12-17 23:02:21,694 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=411, PETRI_PLACES=162, PETRI_TRANSITIONS=147} [2021-12-17 23:02:21,695 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 20 predicate places. [2021-12-17 23:02:21,695 INFO L470 AbstractCegarLoop]: Abstraction has has 162 places, 147 transitions, 411 flow [2021-12-17 23:02:21,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 101.1) internal successors, (1011), 10 states have internal predecessors, (1011), 0 states have call successors, (0), 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-17 23:02:21,696 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:02:21,696 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] [2021-12-17 23:02:21,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 23:02:21,696 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 23:02:21,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:02:21,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1872440416, now seen corresponding path program 1 times [2021-12-17 23:02:21,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:02:21,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985939237] [2021-12-17 23:02:21,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:02:21,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:02:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:02:21,871 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-17 23:02:21,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:02:21,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985939237] [2021-12-17 23:02:21,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985939237] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:02:21,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:02:21,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 23:02:21,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576675017] [2021-12-17 23:02:21,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:02:21,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 23:02:21,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:02:21,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 23:02:21,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-17 23:02:21,875 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 159 [2021-12-17 23:02:21,876 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 147 transitions, 411 flow. Second operand has 10 states, 10 states have (on average 102.0) internal successors, (1020), 10 states have internal predecessors, (1020), 0 states have call successors, (0), 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-17 23:02:21,876 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:02:21,876 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 159 [2021-12-17 23:02:21,876 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:02:22,386 INFO L129 PetriNetUnfolder]: 906/1938 cut-off events. [2021-12-17 23:02:22,387 INFO L130 PetriNetUnfolder]: For 864/882 co-relation queries the response was YES. [2021-12-17 23:02:22,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4319 conditions, 1938 events. 906/1938 cut-off events. For 864/882 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12726 event pairs, 534 based on Foata normal form. 18/1813 useless extension candidates. Maximal degree in co-relation 4303. Up to 1103 conditions per place. [2021-12-17 23:02:22,403 INFO L132 encePairwiseOnDemand]: 146/159 looper letters, 66 selfloop transitions, 7 changer transitions 21/179 dead transitions. [2021-12-17 23:02:22,403 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 179 transitions, 704 flow [2021-12-17 23:02:22,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 23:02:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-17 23:02:22,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1256 transitions. [2021-12-17 23:02:22,407 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6582809224318659 [2021-12-17 23:02:22,407 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1256 transitions. [2021-12-17 23:02:22,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1256 transitions. [2021-12-17 23:02:22,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:02:22,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1256 transitions. [2021-12-17 23:02:22,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 104.66666666666667) internal successors, (1256), 12 states have internal predecessors, (1256), 0 states have call successors, (0), 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-17 23:02:22,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 159.0) internal successors, (2067), 13 states have internal predecessors, (2067), 0 states have call successors, (0), 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-17 23:02:22,414 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 159.0) internal successors, (2067), 13 states have internal predecessors, (2067), 0 states have call successors, (0), 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-17 23:02:22,414 INFO L186 Difference]: Start difference. First operand has 162 places, 147 transitions, 411 flow. Second operand 12 states and 1256 transitions. [2021-12-17 23:02:22,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 179 transitions, 704 flow [2021-12-17 23:02:22,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 179 transitions, 691 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-12-17 23:02:22,421 INFO L242 Difference]: Finished difference. Result has 170 places, 141 transitions, 378 flow [2021-12-17 23:02:22,421 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=378, PETRI_PLACES=170, PETRI_TRANSITIONS=141} [2021-12-17 23:02:22,424 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 28 predicate places. [2021-12-17 23:02:22,424 INFO L470 AbstractCegarLoop]: Abstraction has has 170 places, 141 transitions, 378 flow [2021-12-17 23:02:22,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 102.0) internal successors, (1020), 10 states have internal predecessors, (1020), 0 states have call successors, (0), 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-17 23:02:22,425 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:02:22,425 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] [2021-12-17 23:02:22,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 23:02:22,425 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 23:02:22,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:02:22,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1649235809, now seen corresponding path program 1 times [2021-12-17 23:02:22,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:02:22,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332784396] [2021-12-17 23:02:22,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:02:22,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:02:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:02:22,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:02:22,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:02:22,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332784396] [2021-12-17 23:02:22,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332784396] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:02:22,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811239164] [2021-12-17 23:02:22,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:02:22,547 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:02:22,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:02:22,551 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-17 23:02:22,558 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-17 23:02:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:02:22,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 23:02:22,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:02:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:02:23,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:02:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:02:23,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811239164] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 23:02:23,519 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 23:02:23,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2021-12-17 23:02:23,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151898741] [2021-12-17 23:02:23,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 23:02:23,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-17 23:02:23,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:02:23,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-17 23:02:23,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2021-12-17 23:02:23,523 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 159 [2021-12-17 23:02:23,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 141 transitions, 378 flow. Second operand has 18 states, 18 states have (on average 114.94444444444444) internal successors, (2069), 18 states have internal predecessors, (2069), 0 states have call successors, (0), 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-17 23:02:23,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:02:23,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 159 [2021-12-17 23:02:23,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:02:24,183 INFO L129 PetriNetUnfolder]: 1559/2810 cut-off events. [2021-12-17 23:02:24,184 INFO L130 PetriNetUnfolder]: For 1351/1351 co-relation queries the response was YES. [2021-12-17 23:02:24,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6849 conditions, 2810 events. 1559/2810 cut-off events. For 1351/1351 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 18754 event pairs, 342 based on Foata normal form. 10/2782 useless extension candidates. Maximal degree in co-relation 6831. Up to 688 conditions per place. [2021-12-17 23:02:24,209 INFO L132 encePairwiseOnDemand]: 147/159 looper letters, 106 selfloop transitions, 19 changer transitions 0/220 dead transitions. [2021-12-17 23:02:24,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 220 transitions, 906 flow [2021-12-17 23:02:24,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 23:02:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-17 23:02:24,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1562 transitions. [2021-12-17 23:02:24,213 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7556845670053217 [2021-12-17 23:02:24,213 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1562 transitions. [2021-12-17 23:02:24,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1562 transitions. [2021-12-17 23:02:24,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:02:24,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1562 transitions. [2021-12-17 23:02:24,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 120.15384615384616) internal successors, (1562), 13 states have internal predecessors, (1562), 0 states have call successors, (0), 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-17 23:02:24,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 159.0) internal successors, (2226), 14 states have internal predecessors, (2226), 0 states have call successors, (0), 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-17 23:02:24,221 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 159.0) internal successors, (2226), 14 states have internal predecessors, (2226), 0 states have call successors, (0), 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-17 23:02:24,221 INFO L186 Difference]: Start difference. First operand has 170 places, 141 transitions, 378 flow. Second operand 13 states and 1562 transitions. [2021-12-17 23:02:24,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 220 transitions, 906 flow [2021-12-17 23:02:24,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 220 transitions, 843 flow, removed 24 selfloop flow, removed 14 redundant places. [2021-12-17 23:02:24,232 INFO L242 Difference]: Finished difference. Result has 161 places, 154 transitions, 446 flow [2021-12-17 23:02:24,233 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=446, PETRI_PLACES=161, PETRI_TRANSITIONS=154} [2021-12-17 23:02:24,233 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 19 predicate places. [2021-12-17 23:02:24,233 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 154 transitions, 446 flow [2021-12-17 23:02:24,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 114.94444444444444) internal successors, (2069), 18 states have internal predecessors, (2069), 0 states have call successors, (0), 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-17 23:02:24,235 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:02:24,235 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] [2021-12-17 23:02:24,264 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-17 23:02:24,458 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-17 23:02:24,459 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 23:02:24,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:02:24,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1817451035, now seen corresponding path program 2 times [2021-12-17 23:02:24,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:02:24,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753594929] [2021-12-17 23:02:24,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:02:24,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:02:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:02:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:02:24,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:02:24,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753594929] [2021-12-17 23:02:24,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753594929] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:02:24,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228935817] [2021-12-17 23:02:24,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 23:02:24,564 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:02:24,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:02:24,566 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-17 23:02:24,567 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-17 23:02:24,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-17 23:02:24,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 23:02:24,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 23:02:24,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:02:25,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 23:02:25,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 23:02:25,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228935817] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:02:25,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 23:02:25,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2021-12-17 23:02:25,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589250966] [2021-12-17 23:02:25,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:02:25,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 23:02:25,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:02:25,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 23:02:25,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-12-17 23:02:25,016 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 159 [2021-12-17 23:02:25,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 154 transitions, 446 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 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-17 23:02:25,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:02:25,018 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 159 [2021-12-17 23:02:25,018 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:02:25,415 INFO L129 PetriNetUnfolder]: 1093/2256 cut-off events. [2021-12-17 23:02:25,415 INFO L130 PetriNetUnfolder]: For 1339/1376 co-relation queries the response was YES. [2021-12-17 23:02:25,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5651 conditions, 2256 events. 1093/2256 cut-off events. For 1339/1376 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 15454 event pairs, 302 based on Foata normal form. 97/2168 useless extension candidates. Maximal degree in co-relation 5637. Up to 1006 conditions per place. [2021-12-17 23:02:25,436 INFO L132 encePairwiseOnDemand]: 150/159 looper letters, 59 selfloop transitions, 14 changer transitions 0/172 dead transitions. [2021-12-17 23:02:25,437 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 172 transitions, 678 flow [2021-12-17 23:02:25,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 23:02:25,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-17 23:02:25,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 905 transitions. [2021-12-17 23:02:25,439 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7114779874213837 [2021-12-17 23:02:25,440 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 905 transitions. [2021-12-17 23:02:25,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 905 transitions. [2021-12-17 23:02:25,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:02:25,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 905 transitions. [2021-12-17 23:02:25,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.125) internal successors, (905), 8 states have internal predecessors, (905), 0 states have call successors, (0), 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-17 23:02:25,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 0 states have call successors, (0), 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-17 23:02:25,444 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 0 states have call successors, (0), 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-17 23:02:25,444 INFO L186 Difference]: Start difference. First operand has 161 places, 154 transitions, 446 flow. Second operand 8 states and 905 transitions. [2021-12-17 23:02:25,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 172 transitions, 678 flow [2021-12-17 23:02:25,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 172 transitions, 669 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-12-17 23:02:25,451 INFO L242 Difference]: Finished difference. Result has 166 places, 157 transitions, 508 flow [2021-12-17 23:02:25,452 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=508, PETRI_PLACES=166, PETRI_TRANSITIONS=157} [2021-12-17 23:02:25,454 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 24 predicate places. [2021-12-17 23:02:25,454 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 157 transitions, 508 flow [2021-12-17 23:02:25,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 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-17 23:02:25,455 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:02:25,455 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] [2021-12-17 23:02:25,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-17 23:02:25,678 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-17 23:02:25,679 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 23:02:25,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:02:25,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1536114403, now seen corresponding path program 1 times [2021-12-17 23:02:25,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:02:25,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765080968] [2021-12-17 23:02:25,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:02:25,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:02:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:02:25,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:02:25,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:02:25,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765080968] [2021-12-17 23:02:25,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765080968] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:02:25,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625314771] [2021-12-17 23:02:25,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:02:25,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:02:25,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:02:25,766 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-17 23:02:25,796 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-17 23:02:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:02:25,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 23:02:25,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:02:26,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:02:26,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:02:26,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:02:26,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625314771] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-17 23:02:26,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-17 23:02:26,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2021-12-17 23:02:26,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478948310] [2021-12-17 23:02:26,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:02:26,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 23:02:26,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:02:26,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 23:02:26,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-12-17 23:02:26,392 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 159 [2021-12-17 23:02:26,393 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 157 transitions, 508 flow. Second operand has 7 states, 7 states have (on average 122.71428571428571) internal successors, (859), 7 states have internal predecessors, (859), 0 states have call successors, (0), 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-17 23:02:26,394 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:02:26,394 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 159 [2021-12-17 23:02:26,394 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:02:26,594 INFO L129 PetriNetUnfolder]: 467/1169 cut-off events. [2021-12-17 23:02:26,594 INFO L130 PetriNetUnfolder]: For 1467/1626 co-relation queries the response was YES. [2021-12-17 23:02:26,600 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3157 conditions, 1169 events. 467/1169 cut-off events. For 1467/1626 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6870 event pairs, 115 based on Foata normal form. 82/1160 useless extension candidates. Maximal degree in co-relation 3141. Up to 393 conditions per place. [2021-12-17 23:02:26,606 INFO L132 encePairwiseOnDemand]: 151/159 looper letters, 57 selfloop transitions, 7 changer transitions 0/175 dead transitions. [2021-12-17 23:02:26,606 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 175 transitions, 746 flow [2021-12-17 23:02:26,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 23:02:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-17 23:02:26,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 873 transitions. [2021-12-17 23:02:26,608 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.784366576819407 [2021-12-17 23:02:26,609 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 873 transitions. [2021-12-17 23:02:26,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 873 transitions. [2021-12-17 23:02:26,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:02:26,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 873 transitions. [2021-12-17 23:02:26,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 0 states have call successors, (0), 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-17 23:02:26,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 159.0) internal successors, (1272), 8 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 23:02:26,613 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 159.0) internal successors, (1272), 8 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 23:02:26,614 INFO L186 Difference]: Start difference. First operand has 166 places, 157 transitions, 508 flow. Second operand 7 states and 873 transitions. [2021-12-17 23:02:26,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 175 transitions, 746 flow [2021-12-17 23:02:26,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 175 transitions, 719 flow, removed 3 selfloop flow, removed 6 redundant places. [2021-12-17 23:02:26,624 INFO L242 Difference]: Finished difference. Result has 168 places, 158 transitions, 513 flow [2021-12-17 23:02:26,624 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=513, PETRI_PLACES=168, PETRI_TRANSITIONS=158} [2021-12-17 23:02:26,625 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 26 predicate places. [2021-12-17 23:02:26,625 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 158 transitions, 513 flow [2021-12-17 23:02:26,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.71428571428571) internal successors, (859), 7 states have internal predecessors, (859), 0 states have call successors, (0), 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-17 23:02:26,626 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:02:26,626 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] [2021-12-17 23:02:26,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-17 23:02:26,839 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-17 23:02:26,840 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 23:02:26,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:02:26,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1567445740, now seen corresponding path program 1 times [2021-12-17 23:02:26,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:02:26,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448996582] [2021-12-17 23:02:26,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:02:26,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:02:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:02:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:02:27,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:02:27,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448996582] [2021-12-17 23:02:27,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448996582] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:02:27,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723444810] [2021-12-17 23:02:27,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:02:27,950 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:02:27,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:02:27,952 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-17 23:02:27,954 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-17 23:02:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:02:28,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 55 conjunts are in the unsatisfiable core [2021-12-17 23:02:28,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:02:29,029 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-17 23:02:29,884 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-17 23:02:30,039 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-17 23:02:30,161 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-17 23:02:30,634 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-12-17 23:02:30,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 34 [2021-12-17 23:02:30,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:02:30,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:02:31,681 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_217 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_217) c_~A~0.base))) (or (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* c_~M~0 4))))) (and (or (<= .cse0 c_~max3~0) (< c_~max2~0 .cse0)) (or (< c_~max2~0 c_~max3~0) (< c_~max3~0 .cse0)))) (let ((.cse2 (select .cse1 c_~A~0.offset))) (and (or (<= .cse2 c_~max1~0) (= c_~max2~0 .cse2)) (or (< c_~max1~0 .cse2) (= c_~max2~0 c_~max1~0))))))) is different from false [2021-12-17 23:02:32,232 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_217 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_217) c_~A~0.base))) (or (let ((.cse0 (select .cse1 c_~A~0.offset))) (and (or (<= .cse0 c_~max1~0) (= c_~max2~0 .cse0)) (or (< c_~max1~0 .cse0) (= c_~max2~0 c_~max1~0)))) (let ((.cse2 (select .cse1 (+ c_~A~0.offset (* c_~M~0 4))))) (and (or (< c_~max3~0 .cse2) (< c_~max2~0 c_~max3~0)) (or (<= .cse2 c_~max3~0) (< c_~max2~0 .cse2))))))) is different from false [2021-12-17 23:02:32,747 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_215 (Array Int Int)) (v_ArrVal_217 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_215) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_217) c_~A~0.base))) (or (let ((.cse0 (select .cse1 c_~A~0.offset))) (and (or (= c_~max2~0 .cse0) (<= .cse0 c_~max1~0)) (or (< c_~max1~0 .cse0) (= c_~max2~0 c_~max1~0)))) (let ((.cse2 (select .cse1 (+ c_~A~0.offset (* c_~M~0 4))))) (and (or (< c_~max2~0 .cse2) (<= .cse2 c_~max3~0)) (or (< c_~max2~0 c_~max3~0) (< c_~max3~0 .cse2))))))) is different from false [2021-12-17 23:02:33,131 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_215 (Array Int Int)) (v_ArrVal_217 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_215) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_217) c_~A~0.base))) (or (let ((.cse0 (select .cse1 c_~A~0.offset))) (and (or (= c_~max2~0 .cse0) (<= .cse0 c_~max1~0)) (or (< c_~max1~0 .cse0) (= c_~max2~0 c_~max1~0)))) (let ((.cse2 (select .cse1 (+ c_~A~0.offset (* c_~M~0 4))))) (and (or (< c_~max2~0 .cse2) (<= .cse2 c_~max3~0)) (or (< c_~max2~0 c_~max3~0) (< c_~max3~0 .cse2))))))) (= 0 |c_ULTIMATE.start_assume_abort_if_not_~cond#1|)) is different from false [2021-12-17 23:02:33,240 WARN L838 $PredicateComparison]: unable to prove that (or (= 0 |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_215 (Array Int Int)) (v_ArrVal_217 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_215) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_217) c_~A~0.base))) (or (let ((.cse0 (select .cse1 c_~A~0.offset))) (and (or (= c_~max2~0 .cse0) (<= .cse0 c_~max1~0)) (or (< c_~max1~0 .cse0) (= c_~max2~0 c_~max1~0)))) (let ((.cse2 (select .cse1 (+ c_~A~0.offset (* c_~M~0 4))))) (and (or (< c_~max2~0 .cse2) (<= .cse2 c_~max3~0)) (or (< c_~max2~0 c_~max3~0) (< c_~max3~0 .cse2)))))))) is different from false [2021-12-17 23:02:39,933 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:02:39,933 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 193 treesize of output 133 [2021-12-17 23:02:39,958 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:02:39,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3259 treesize of output 3127 [2021-12-17 23:02:39,994 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:02:39,997 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 3115 treesize of output 2935 [2021-12-17 23:02:40,038 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:02:40,039 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 2923 treesize of output 2551 [2021-12-17 23:02:40,080 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:02:40,081 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 2539 treesize of output 2455 [2021-12-17 23:02:40,099 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-17 23:02:40,099 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-17 23:02:40,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2021-12-17 23:02:40,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698679792] [2021-12-17 23:02:40,099 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-17 23:02:40,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-17 23:02:40,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:02:40,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-17 23:02:40,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=3859, Unknown=42, NotChecked=680, Total=5256 [2021-12-17 23:02:40,116 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 159 [2021-12-17 23:02:40,118 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 158 transitions, 513 flow. Second operand has 31 states, 31 states have (on average 70.38709677419355) internal successors, (2182), 31 states have internal predecessors, (2182), 0 states have call successors, (0), 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-17 23:02:40,118 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:02:40,118 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 159 [2021-12-17 23:02:40,119 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:02:43,439 INFO L129 PetriNetUnfolder]: 5870/10080 cut-off events. [2021-12-17 23:02:43,440 INFO L130 PetriNetUnfolder]: For 10362/10602 co-relation queries the response was YES. [2021-12-17 23:02:43,481 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29050 conditions, 10080 events. 5870/10080 cut-off events. For 10362/10602 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 75142 event pairs, 950 based on Foata normal form. 91/9973 useless extension candidates. Maximal degree in co-relation 29033. Up to 3556 conditions per place. [2021-12-17 23:02:43,552 INFO L132 encePairwiseOnDemand]: 125/159 looper letters, 266 selfloop transitions, 97 changer transitions 5/426 dead transitions. [2021-12-17 23:02:43,553 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 426 transitions, 2415 flow [2021-12-17 23:02:43,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-12-17 23:02:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2021-12-17 23:02:43,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2832 transitions. [2021-12-17 23:02:43,568 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4813870474247833 [2021-12-17 23:02:43,569 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 2832 transitions. [2021-12-17 23:02:43,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 2832 transitions. [2021-12-17 23:02:43,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:02:43,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2832 transitions. [2021-12-17 23:02:43,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 76.54054054054055) internal successors, (2832), 37 states have internal predecessors, (2832), 0 states have call successors, (0), 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-17 23:02:43,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 159.0) internal successors, (6042), 38 states have internal predecessors, (6042), 0 states have call successors, (0), 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-17 23:02:43,597 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 159.0) internal successors, (6042), 38 states have internal predecessors, (6042), 0 states have call successors, (0), 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-17 23:02:43,597 INFO L186 Difference]: Start difference. First operand has 168 places, 158 transitions, 513 flow. Second operand 37 states and 2832 transitions. [2021-12-17 23:02:43,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 426 transitions, 2415 flow [2021-12-17 23:02:43,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 426 transitions, 2376 flow, removed 4 selfloop flow, removed 5 redundant places. [2021-12-17 23:02:43,621 INFO L242 Difference]: Finished difference. Result has 221 places, 247 transitions, 1459 flow [2021-12-17 23:02:43,622 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1459, PETRI_PLACES=221, PETRI_TRANSITIONS=247} [2021-12-17 23:02:43,624 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 79 predicate places. [2021-12-17 23:02:43,624 INFO L470 AbstractCegarLoop]: Abstraction has has 221 places, 247 transitions, 1459 flow [2021-12-17 23:02:43,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 70.38709677419355) internal successors, (2182), 31 states have internal predecessors, (2182), 0 states have call successors, (0), 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-17 23:02:43,625 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:02:43,625 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] [2021-12-17 23:02:43,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 23:02:43,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:02:43,842 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 23:02:43,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:02:43,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1183251030, now seen corresponding path program 2 times [2021-12-17 23:02:43,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:02:43,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729906560] [2021-12-17 23:02:43,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:02:43,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:02:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:02:44,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:02:44,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:02:44,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729906560] [2021-12-17 23:02:44,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729906560] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:02:44,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463732354] [2021-12-17 23:02:44,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 23:02:44,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:02:44,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:02:44,491 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:02:44,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 23:02:44,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 23:02:44,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 23:02:44,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-17 23:02:44,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:02:45,564 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:02:45,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 46 [2021-12-17 23:02:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:02:46,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:02:46,922 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:02:46,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 53 [2021-12-17 23:02:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:02:47,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463732354] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 23:02:47,573 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 23:02:47,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 19, 18] total 53 [2021-12-17 23:02:47,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303403134] [2021-12-17 23:02:47,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 23:02:47,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-12-17 23:02:47,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:02:47,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-12-17 23:02:47,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=592, Invalid=2164, Unknown=0, NotChecked=0, Total=2756 [2021-12-17 23:02:47,579 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 159 [2021-12-17 23:02:47,582 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 247 transitions, 1459 flow. Second operand has 53 states, 53 states have (on average 68.88679245283019) internal successors, (3651), 53 states have internal predecessors, (3651), 0 states have call successors, (0), 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-17 23:02:47,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:02:47,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 159 [2021-12-17 23:02:47,583 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:02:53,825 INFO L129 PetriNetUnfolder]: 11905/19584 cut-off events. [2021-12-17 23:02:53,826 INFO L130 PetriNetUnfolder]: For 38784/38784 co-relation queries the response was YES. [2021-12-17 23:02:53,946 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65187 conditions, 19584 events. 11905/19584 cut-off events. For 38784/38784 co-relation queries the response was YES. Maximal size of possible extension queue 1048. Compared 150550 event pairs, 1320 based on Foata normal form. 2/19404 useless extension candidates. Maximal degree in co-relation 65149. Up to 7836 conditions per place. [2021-12-17 23:02:54,168 INFO L132 encePairwiseOnDemand]: 119/159 looper letters, 514 selfloop transitions, 312 changer transitions 10/889 dead transitions. [2021-12-17 23:02:54,169 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 889 transitions, 6671 flow [2021-12-17 23:02:54,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-12-17 23:02:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2021-12-17 23:02:54,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 5199 transitions. [2021-12-17 23:02:54,178 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.460536805740101 [2021-12-17 23:02:54,179 INFO L72 ComplementDD]: Start complementDD. Operand 71 states and 5199 transitions. [2021-12-17 23:02:54,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 5199 transitions. [2021-12-17 23:02:54,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:02:54,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 71 states and 5199 transitions. [2021-12-17 23:02:54,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 72 states, 71 states have (on average 73.22535211267606) internal successors, (5199), 71 states have internal predecessors, (5199), 0 states have call successors, (0), 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-17 23:02:54,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 72 states, 72 states have (on average 159.0) internal successors, (11448), 72 states have internal predecessors, (11448), 0 states have call successors, (0), 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-17 23:02:54,217 INFO L81 ComplementDD]: Finished complementDD. Result has 72 states, 72 states have (on average 159.0) internal successors, (11448), 72 states have internal predecessors, (11448), 0 states have call successors, (0), 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-17 23:02:54,217 INFO L186 Difference]: Start difference. First operand has 221 places, 247 transitions, 1459 flow. Second operand 71 states and 5199 transitions. [2021-12-17 23:02:54,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 889 transitions, 6671 flow [2021-12-17 23:02:54,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 889 transitions, 6301 flow, removed 96 selfloop flow, removed 15 redundant places. [2021-12-17 23:02:54,649 INFO L242 Difference]: Finished difference. Result has 314 places, 494 transitions, 4324 flow [2021-12-17 23:02:54,649 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=4324, PETRI_PLACES=314, PETRI_TRANSITIONS=494} [2021-12-17 23:02:54,650 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 172 predicate places. [2021-12-17 23:02:54,650 INFO L470 AbstractCegarLoop]: Abstraction has has 314 places, 494 transitions, 4324 flow [2021-12-17 23:02:54,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 68.88679245283019) internal successors, (3651), 53 states have internal predecessors, (3651), 0 states have call successors, (0), 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-17 23:02:54,651 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:02:54,652 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] [2021-12-17 23:02:54,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 23:02:54,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-17 23:02:54,873 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 23:02:54,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:02:54,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1346425658, now seen corresponding path program 1 times [2021-12-17 23:02:54,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:02:54,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841164067] [2021-12-17 23:02:54,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:02:54,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:02:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:02:56,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:02:56,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:02:56,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841164067] [2021-12-17 23:02:56,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841164067] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:02:56,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517759549] [2021-12-17 23:02:56,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:02:56,105 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:02:56,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:02:56,112 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:02:56,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 23:02:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:02:56,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 54 conjunts are in the unsatisfiable core [2021-12-17 23:02:56,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:02:57,083 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-17 23:02:57,798 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-17 23:02:57,992 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-17 23:02:58,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 23:02:58,294 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 26 treesize of output 26 [2021-12-17 23:02:58,526 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-12-17 23:02:58,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 30 [2021-12-17 23:02:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:02:58,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:02:59,190 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_286 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_286) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0)) (forall ((v_ArrVal_286 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_286) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (or (= .cse0 c_~max1~0) (<= .cse0 c_~max3~0) (<= .cse0 c_~max2~0))))) is different from false [2021-12-17 23:02:59,853 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_285 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (or (<= .cse0 c_~max1~0) (and (or (forall ((v_ArrVal_286 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_286) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (= c_~max3~0 .cse0) (<= c_~max3~0 c_~max2~0)) (forall ((v_ArrVal_286 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_286) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (or (<= .cse1 c_~max2~0) (= .cse1 (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (<= .cse1 c_~max3~0))))))))) (forall ((v_ArrVal_285 (Array Int Int))) (or (< c_~max1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (and (forall ((v_ArrVal_286 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_286) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (or (= .cse3 c_~max1~0) (<= .cse3 c_~max2~0) (<= .cse3 c_~max3~0)))) (or (forall ((v_ArrVal_286 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_286) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0)))))) is different from false [2021-12-17 23:03:00,354 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_285 (Array Int Int))) (or (< c_~max1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset)) (and (forall ((v_ArrVal_286 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_286) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (or (= .cse0 c_~max1~0) (<= .cse0 c_~max2~0) (<= .cse0 c_~max3~0)))) (or (forall ((v_ArrVal_286 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_286) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0))))) (forall ((v_ArrVal_285 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset))) (or (<= .cse1 c_~max1~0) (and (or (forall ((v_ArrVal_286 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_286) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (= c_~max3~0 .cse1) (<= c_~max3~0 c_~max2~0)) (forall ((v_ArrVal_286 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_286) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (or (<= .cse2 c_~max2~0) (= .cse2 (select (select .cse3 c_~A~0.base) c_~A~0.offset)) (<= .cse2 c_~max3~0)))))))))) is different from false [2021-12-17 23:03:00,574 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_285 (Array Int Int)) (v_ArrVal_284 (Array Int Int))) (or (< c_~max1~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset)) (and (or (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0) (forall ((v_ArrVal_286 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_286) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4)))))) (forall ((v_ArrVal_286 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_286) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (or (= .cse0 c_~max1~0) (<= .cse0 c_~max3~0) (<= .cse0 c_~max2~0))))))) (forall ((v_ArrVal_285 (Array Int Int)) (v_ArrVal_284 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset))) (or (<= .cse1 c_~max1~0) (and (or (= c_~max3~0 .cse1) (<= c_~max3~0 c_~max2~0) (forall ((v_ArrVal_286 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_286) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4)))))) (forall ((v_ArrVal_286 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_286) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (or (<= .cse2 c_~max3~0) (= .cse2 (select (select .cse3 c_~A~0.base) c_~A~0.offset)) (<= .cse2 c_~max2~0)))))))))) is different from false [2021-12-17 23:03:00,995 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_285 (Array Int Int)) (v_ArrVal_284 (Array Int Int))) (or (< c_~max1~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset)) (and (or (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0) (forall ((v_ArrVal_286 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_286) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4)))))) (forall ((v_ArrVal_286 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_286) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (or (= .cse0 c_~max1~0) (<= .cse0 c_~max3~0) (<= .cse0 c_~max2~0))))))) (forall ((v_ArrVal_285 (Array Int Int)) (v_ArrVal_284 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset))) (or (<= .cse1 c_~max1~0) (and (or (= c_~max3~0 .cse1) (<= c_~max3~0 c_~max2~0) (forall ((v_ArrVal_286 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_286) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4)))))) (forall ((v_ArrVal_286 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_286) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (or (<= .cse2 c_~max3~0) (= .cse2 (select (select .cse3 c_~A~0.base) c_~A~0.offset)) (<= .cse2 c_~max2~0)))))))))) (= 0 |c_ULTIMATE.start_assume_abort_if_not_~cond#1|)) is different from false [2021-12-17 23:03:01,116 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_285 (Array Int Int)) (v_ArrVal_284 (Array Int Int))) (or (< c_~max1~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset)) (and (or (= c_~max3~0 c_~max1~0) (<= c_~max3~0 c_~max2~0) (forall ((v_ArrVal_286 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_286) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4)))))) (forall ((v_ArrVal_286 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_286) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (or (= .cse0 c_~max1~0) (<= .cse0 c_~max3~0) (<= .cse0 c_~max2~0))))))) (forall ((v_ArrVal_285 (Array Int Int)) (v_ArrVal_284 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset))) (or (<= .cse1 c_~max1~0) (and (or (= c_~max3~0 .cse1) (<= c_~max3~0 c_~max2~0) (forall ((v_ArrVal_286 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_286) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4)))))) (forall ((v_ArrVal_286 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_286) c_~A~0.base) (+ c_~A~0.offset (* c_~M~0 4))))) (or (<= .cse2 c_~max3~0) (= .cse2 (select (select .cse3 c_~A~0.base) c_~A~0.offset)) (<= .cse2 c_~max2~0)))))))))) (= 0 |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) is different from false [2021-12-17 23:03:10,036 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:03:10,036 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 371 treesize of output 240 [2021-12-17 23:03:10,077 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:03:10,078 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 2640 treesize of output 2500 [2021-12-17 23:03:10,137 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:03:10,138 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 2455 treesize of output 2368 [2021-12-17 23:03:10,180 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:03:10,181 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 2355 treesize of output 2318 [2021-12-17 23:03:10,210 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 2305 treesize of output 2257 [2021-12-17 23:03:10,239 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 2257 treesize of output 2113 [2021-12-17 23:03:10,268 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 2113 treesize of output 2065 [2021-12-17 23:03:10,309 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:03:10,310 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 2065 treesize of output 2010 [2021-12-17 23:03:10,352 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:03:10,352 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 1997 treesize of output 1874 [2021-12-17 23:03:10,383 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 1861 treesize of output 1717 Killed by 15