./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum2.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-array-sum2.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 9eb5d9094342cfaa74d8ea4903febd735be5757c093d69b0f8dbb2a26886fda6 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 22:58:30,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 22:58:30,234 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 22:58:30,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 22:58:30,296 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 22:58:30,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 22:58:30,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 22:58:30,303 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 22:58:30,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 22:58:30,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 22:58:30,312 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 22:58:30,313 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 22:58:30,314 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 22:58:30,316 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 22:58:30,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 22:58:30,320 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 22:58:30,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 22:58:30,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 22:58:30,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 22:58:30,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 22:58:30,332 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 22:58:30,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 22:58:30,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 22:58:30,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 22:58:30,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 22:58:30,342 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 22:58:30,342 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 22:58:30,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 22:58:30,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 22:58:30,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 22:58:30,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 22:58:30,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 22:58:30,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 22:58:30,348 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 22:58:30,349 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 22:58:30,349 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 22:58:30,350 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 22:58:30,350 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 22:58:30,350 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 22:58:30,351 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 22:58:30,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 22:58:30,352 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 22:58:30,374 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 22:58:30,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 22:58:30,381 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 22:58:30,381 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 22:58:30,382 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 22:58:30,382 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 22:58:30,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 22:58:30,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 22:58:30,383 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 22:58:30,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 22:58:30,385 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 22:58:30,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 22:58:30,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 22:58:30,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 22:58:30,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 22:58:30,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 22:58:30,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 22:58:30,386 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 22:58:30,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 22:58:30,386 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 22:58:30,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 22:58:30,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 22:58:30,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 22:58:30,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 22:58:30,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 22:58:30,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 22:58:30,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 22:58:30,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 22:58:30,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 22:58:30,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 22:58:30,389 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 22:58:30,389 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 22:58:30,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 22:58:30,389 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 22:58:30,389 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 -> 9eb5d9094342cfaa74d8ea4903febd735be5757c093d69b0f8dbb2a26886fda6 [2021-12-17 22:58:30,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 22:58:30,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 22:58:30,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 22:58:30,661 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 22:58:30,661 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 22:58:30,662 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2021-12-17 22:58:30,732 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1a51982d/9458498216b441de93c1e88e393cb51e/FLAG16141cb59 [2021-12-17 22:58:31,128 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 22:58:31,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2021-12-17 22:58:31,134 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1a51982d/9458498216b441de93c1e88e393cb51e/FLAG16141cb59 [2021-12-17 22:58:31,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1a51982d/9458498216b441de93c1e88e393cb51e [2021-12-17 22:58:31,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 22:58:31,547 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 22:58:31,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 22:58:31,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 22:58:31,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 22:58:31,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:58:31" (1/1) ... [2021-12-17 22:58:31,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27db7271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:31, skipping insertion in model container [2021-12-17 22:58:31,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:58:31" (1/1) ... [2021-12-17 22:58:31,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 22:58:31,582 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 22:58:31,734 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-array-sum2.wvr.c[2599,2612] [2021-12-17 22:58:31,741 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 22:58:31,747 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 22:58:31,766 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-array-sum2.wvr.c[2599,2612] [2021-12-17 22:58:31,770 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 22:58:31,781 INFO L208 MainTranslator]: Completed translation [2021-12-17 22:58:31,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:31 WrapperNode [2021-12-17 22:58:31,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 22:58:31,783 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 22:58:31,783 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 22:58:31,783 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 22:58:31,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:31" (1/1) ... [2021-12-17 22:58:31,797 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:31" (1/1) ... [2021-12-17 22:58:31,824 INFO L137 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 271 [2021-12-17 22:58:31,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 22:58:31,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 22:58:31,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 22:58:31,826 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 22:58:31,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:31" (1/1) ... [2021-12-17 22:58:31,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:31" (1/1) ... [2021-12-17 22:58:31,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:31" (1/1) ... [2021-12-17 22:58:31,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:31" (1/1) ... [2021-12-17 22:58:31,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:31" (1/1) ... [2021-12-17 22:58:31,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:31" (1/1) ... [2021-12-17 22:58:31,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:31" (1/1) ... [2021-12-17 22:58:31,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 22:58:31,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 22:58:31,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 22:58:31,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 22:58:31,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:31" (1/1) ... [2021-12-17 22:58:31,865 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 22:58:31,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:58:31,892 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 22:58:31,908 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 22:58:31,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 22:58:31,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 22:58:31,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 22:58:31,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 22:58:31,935 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-17 22:58:31,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-17 22:58:31,935 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-17 22:58:31,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-17 22:58:31,935 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-12-17 22:58:31,936 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-12-17 22:58:31,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 22:58:31,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-17 22:58:31,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-17 22:58:31,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 22:58:31,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 22:58:31,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 22:58:31,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 22:58:31,938 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 22:58:32,076 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 22:58:32,077 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 22:58:32,429 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 22:58:32,689 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 22:58:32,689 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-17 22:58:32,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:58:32 BoogieIcfgContainer [2021-12-17 22:58:32,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 22:58:32,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 22:58:32,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 22:58:32,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 22:58:32,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 10:58:31" (1/3) ... [2021-12-17 22:58:32,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4806b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:58:32, skipping insertion in model container [2021-12-17 22:58:32,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:58:31" (2/3) ... [2021-12-17 22:58:32,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4806b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:58:32, skipping insertion in model container [2021-12-17 22:58:32,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:58:32" (3/3) ... [2021-12-17 22:58:32,699 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2021-12-17 22:58:32,703 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-17 22:58:32,703 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 22:58:32,704 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 22:58:32,704 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-17 22:58:32,752 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,752 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,753 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,753 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,753 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,753 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,754 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,754 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,754 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,754 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,754 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,755 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,755 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,755 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,755 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,755 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,756 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,756 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,756 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,757 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,757 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,758 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,759 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,759 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,759 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,760 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,760 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,760 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,760 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,760 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,760 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,761 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,761 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,761 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,761 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,761 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,762 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,762 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,762 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,762 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,762 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,762 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,763 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,763 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,764 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,764 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,764 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,764 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,764 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,764 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,765 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,765 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,765 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,765 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,766 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,766 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,766 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,767 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,767 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,767 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,767 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,767 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,767 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,768 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,768 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,768 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,768 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,769 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,769 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,769 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,769 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,769 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,769 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,770 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,770 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,770 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,771 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,771 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,773 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,773 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,773 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,773 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,773 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,774 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,774 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,774 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,774 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,774 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,774 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,775 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,775 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,775 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,775 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,775 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,775 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,775 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,776 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,776 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,776 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,776 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,776 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,777 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,777 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,777 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,777 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,777 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,777 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,777 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,778 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,778 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,778 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,778 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,778 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,779 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,779 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,779 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,779 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,779 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,780 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,780 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,780 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,780 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,780 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,781 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,781 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,781 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,781 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,781 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,781 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,786 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,794 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,794 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,794 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,795 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,795 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,795 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,795 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,795 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,795 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,796 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,796 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,796 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,796 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,797 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,799 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,799 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,799 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,799 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,801 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,801 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,801 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,801 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,801 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,802 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,802 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,802 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,802 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,802 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,802 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:58:32,810 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-12-17 22:58:32,850 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 22:58:32,856 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 22:58:32,857 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-12-17 22:58:32,869 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 187 places, 193 transitions, 410 flow [2021-12-17 22:58:32,924 INFO L129 PetriNetUnfolder]: 16/190 cut-off events. [2021-12-17 22:58:32,924 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-17 22:58:32,929 INFO L84 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 190 events. 16/190 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 108 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 152. Up to 2 conditions per place. [2021-12-17 22:58:32,929 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 193 transitions, 410 flow [2021-12-17 22:58:32,933 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 179 transitions, 376 flow [2021-12-17 22:58:32,962 INFO L129 PetriNetUnfolder]: 16/178 cut-off events. [2021-12-17 22:58:32,962 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-17 22:58:32,962 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:58:32,963 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:58:32,964 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 22:58:32,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:58:32,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1329929958, now seen corresponding path program 1 times [2021-12-17 22:58:32,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:58:32,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794697352] [2021-12-17 22:58:32,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:58:32,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:58:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:58:33,256 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 22:58:33,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:58:33,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794697352] [2021-12-17 22:58:33,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794697352] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:58:33,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:58:33,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 22:58:33,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377050779] [2021-12-17 22:58:33,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:58:33,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 22:58:33,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:58:33,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 22:58:33,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 22:58:33,307 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 193 [2021-12-17 22:58:33,313 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 179 transitions, 376 flow. Second operand has 2 states, 2 states have (on average 175.5) internal successors, (351), 2 states have internal predecessors, (351), 0 states have call successors, (0), 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 22:58:33,314 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:58:33,314 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 193 [2021-12-17 22:58:33,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:58:33,469 INFO L129 PetriNetUnfolder]: 42/301 cut-off events. [2021-12-17 22:58:33,469 INFO L130 PetriNetUnfolder]: For 50/51 co-relation queries the response was YES. [2021-12-17 22:58:33,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 301 events. 42/301 cut-off events. For 50/51 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 715 event pairs, 15 based on Foata normal form. 45/313 useless extension candidates. Maximal degree in co-relation 216. Up to 59 conditions per place. [2021-12-17 22:58:33,476 INFO L132 encePairwiseOnDemand]: 182/193 looper letters, 9 selfloop transitions, 0 changer transitions 6/168 dead transitions. [2021-12-17 22:58:33,477 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 168 transitions, 372 flow [2021-12-17 22:58:33,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 22:58:33,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-17 22:58:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 364 transitions. [2021-12-17 22:58:33,496 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9430051813471503 [2021-12-17 22:58:33,496 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 364 transitions. [2021-12-17 22:58:33,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 364 transitions. [2021-12-17 22:58:33,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:58:33,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 364 transitions. [2021-12-17 22:58:33,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 182.0) internal successors, (364), 2 states have internal predecessors, (364), 0 states have call successors, (0), 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 22:58:33,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 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 22:58:33,522 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 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 22:58:33,524 INFO L186 Difference]: Start difference. First operand has 173 places, 179 transitions, 376 flow. Second operand 2 states and 364 transitions. [2021-12-17 22:58:33,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 168 transitions, 372 flow [2021-12-17 22:58:33,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 168 transitions, 360 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-12-17 22:58:33,533 INFO L242 Difference]: Finished difference. Result has 168 places, 162 transitions, 330 flow [2021-12-17 22:58:33,535 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=330, PETRI_PLACES=168, PETRI_TRANSITIONS=162} [2021-12-17 22:58:33,542 INFO L334 CegarLoopForPetriNet]: 173 programPoint places, -5 predicate places. [2021-12-17 22:58:33,542 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 162 transitions, 330 flow [2021-12-17 22:58:33,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 175.5) internal successors, (351), 2 states have internal predecessors, (351), 0 states have call successors, (0), 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 22:58:33,543 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:58:33,543 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:58:33,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 22:58:33,544 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 22:58:33,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:58:33,544 INFO L85 PathProgramCache]: Analyzing trace with hash -181857671, now seen corresponding path program 1 times [2021-12-17 22:58:33,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:58:33,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998768062] [2021-12-17 22:58:33,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:58:33,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:58:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:58:33,893 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 22:58:33,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:58:33,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998768062] [2021-12-17 22:58:33,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998768062] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:58:33,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:58:33,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 22:58:33,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367594148] [2021-12-17 22:58:33,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:58:33,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 22:58:33,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:58:33,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 22:58:33,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 22:58:33,898 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 193 [2021-12-17 22:58:33,899 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 162 transitions, 330 flow. Second operand has 8 states, 8 states have (on average 117.25) internal successors, (938), 8 states have internal predecessors, (938), 0 states have call successors, (0), 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 22:58:33,899 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:58:33,900 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 193 [2021-12-17 22:58:33,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:58:34,306 INFO L129 PetriNetUnfolder]: 298/770 cut-off events. [2021-12-17 22:58:34,307 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-12-17 22:58:34,309 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1278 conditions, 770 events. 298/770 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3133 event pairs, 167 based on Foata normal form. 2/599 useless extension candidates. Maximal degree in co-relation 1275. Up to 438 conditions per place. [2021-12-17 22:58:34,313 INFO L132 encePairwiseOnDemand]: 178/193 looper letters, 62 selfloop transitions, 10 changer transitions 31/201 dead transitions. [2021-12-17 22:58:34,313 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 201 transitions, 614 flow [2021-12-17 22:58:34,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 22:58:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-17 22:58:34,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1548 transitions. [2021-12-17 22:58:34,318 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6169788760462336 [2021-12-17 22:58:34,318 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1548 transitions. [2021-12-17 22:58:34,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1548 transitions. [2021-12-17 22:58:34,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:58:34,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1548 transitions. [2021-12-17 22:58:34,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 119.07692307692308) internal successors, (1548), 13 states have internal predecessors, (1548), 0 states have call successors, (0), 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 22:58:34,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 193.0) internal successors, (2702), 14 states have internal predecessors, (2702), 0 states have call successors, (0), 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 22:58:34,329 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 193.0) internal successors, (2702), 14 states have internal predecessors, (2702), 0 states have call successors, (0), 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 22:58:34,329 INFO L186 Difference]: Start difference. First operand has 168 places, 162 transitions, 330 flow. Second operand 13 states and 1548 transitions. [2021-12-17 22:58:34,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 201 transitions, 614 flow [2021-12-17 22:58:34,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 201 transitions, 614 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-17 22:58:34,334 INFO L242 Difference]: Finished difference. Result has 181 places, 164 transitions, 380 flow [2021-12-17 22:58:34,334 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=380, PETRI_PLACES=181, PETRI_TRANSITIONS=164} [2021-12-17 22:58:34,335 INFO L334 CegarLoopForPetriNet]: 173 programPoint places, 8 predicate places. [2021-12-17 22:58:34,335 INFO L470 AbstractCegarLoop]: Abstraction has has 181 places, 164 transitions, 380 flow [2021-12-17 22:58:34,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 117.25) internal successors, (938), 8 states have internal predecessors, (938), 0 states have call successors, (0), 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 22:58:34,336 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:58:34,336 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:58:34,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 22:58:34,337 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 22:58:34,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:58:34,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1272068875, now seen corresponding path program 1 times [2021-12-17 22:58:34,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:58:34,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634747269] [2021-12-17 22:58:34,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:58:34,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:58:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:58:34,470 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 22:58:34,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:58:34,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634747269] [2021-12-17 22:58:34,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634747269] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:58:34,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923372287] [2021-12-17 22:58:34,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:58:34,472 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:58:34,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:58:34,474 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 22:58:34,475 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 22:58:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:58:34,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 22:58:34,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:58:34,964 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 22:58:34,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:58:35,340 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 22:58:35,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923372287] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-17 22:58:35,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-17 22:58:35,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2021-12-17 22:58:35,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522743998] [2021-12-17 22:58:35,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:58:35,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:58:35,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:58:35,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:58:35,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-12-17 22:58:35,345 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 193 [2021-12-17 22:58:35,346 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 164 transitions, 380 flow. Second operand has 7 states, 7 states have (on average 143.14285714285714) internal successors, (1002), 7 states have internal predecessors, (1002), 0 states have call successors, (0), 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 22:58:35,346 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:58:35,347 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 193 [2021-12-17 22:58:35,347 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:58:35,521 INFO L129 PetriNetUnfolder]: 183/658 cut-off events. [2021-12-17 22:58:35,521 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-12-17 22:58:35,523 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 658 events. 183/658 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3113 event pairs, 80 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 1002. Up to 149 conditions per place. [2021-12-17 22:58:35,526 INFO L132 encePairwiseOnDemand]: 185/193 looper letters, 46 selfloop transitions, 7 changer transitions 0/172 dead transitions. [2021-12-17 22:58:35,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 172 transitions, 504 flow [2021-12-17 22:58:35,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 22:58:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-17 22:58:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1018 transitions. [2021-12-17 22:58:35,529 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7535159141376758 [2021-12-17 22:58:35,529 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1018 transitions. [2021-12-17 22:58:35,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1018 transitions. [2021-12-17 22:58:35,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:58:35,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1018 transitions. [2021-12-17 22:58:35,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 145.42857142857142) internal successors, (1018), 7 states have internal predecessors, (1018), 0 states have call successors, (0), 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 22:58:35,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 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 22:58:35,536 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 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 22:58:35,536 INFO L186 Difference]: Start difference. First operand has 181 places, 164 transitions, 380 flow. Second operand 7 states and 1018 transitions. [2021-12-17 22:58:35,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 172 transitions, 504 flow [2021-12-17 22:58:35,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 172 transitions, 474 flow, removed 7 selfloop flow, removed 10 redundant places. [2021-12-17 22:58:35,541 INFO L242 Difference]: Finished difference. Result has 173 places, 166 transitions, 383 flow [2021-12-17 22:58:35,541 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=383, PETRI_PLACES=173, PETRI_TRANSITIONS=166} [2021-12-17 22:58:35,542 INFO L334 CegarLoopForPetriNet]: 173 programPoint places, 0 predicate places. [2021-12-17 22:58:35,542 INFO L470 AbstractCegarLoop]: Abstraction has has 173 places, 166 transitions, 383 flow [2021-12-17 22:58:35,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 143.14285714285714) internal successors, (1002), 7 states have internal predecessors, (1002), 0 states have call successors, (0), 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 22:58:35,543 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:58:35,543 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:58:35,571 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 22:58:35,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:58:35,768 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 22:58:35,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:58:35,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1824728494, now seen corresponding path program 1 times [2021-12-17 22:58:35,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:58:35,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262130092] [2021-12-17 22:58:35,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:58:35,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:58:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:58:35,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 22:58:35,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:58:35,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262130092] [2021-12-17 22:58:35,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262130092] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:58:35,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734205111] [2021-12-17 22:58:35,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:58:35,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:58:35,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:58:35,892 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 22:58:35,919 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 22:58:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:58:36,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 22:58:36,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:58:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 22:58:36,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:58:36,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 22:58:36,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734205111] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-17 22:58:36,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-17 22:58:36,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2021-12-17 22:58:36,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931605193] [2021-12-17 22:58:36,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:58:36,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 22:58:36,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:58:36,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 22:58:36,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2021-12-17 22:58:36,731 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 193 [2021-12-17 22:58:36,732 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 166 transitions, 383 flow. Second operand has 9 states, 9 states have (on average 135.66666666666666) internal successors, (1221), 9 states have internal predecessors, (1221), 0 states have call successors, (0), 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 22:58:36,733 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:58:36,733 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 193 [2021-12-17 22:58:36,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:58:37,169 INFO L129 PetriNetUnfolder]: 875/1692 cut-off events. [2021-12-17 22:58:37,169 INFO L130 PetriNetUnfolder]: For 559/818 co-relation queries the response was YES. [2021-12-17 22:58:37,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3449 conditions, 1692 events. 875/1692 cut-off events. For 559/818 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9221 event pairs, 253 based on Foata normal form. 259/1779 useless extension candidates. Maximal degree in co-relation 3441. Up to 445 conditions per place. [2021-12-17 22:58:37,183 INFO L132 encePairwiseOnDemand]: 182/193 looper letters, 97 selfloop transitions, 17 changer transitions 0/226 dead transitions. [2021-12-17 22:58:37,183 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 226 transitions, 782 flow [2021-12-17 22:58:37,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 22:58:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-17 22:58:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1548 transitions. [2021-12-17 22:58:37,187 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7291568535091851 [2021-12-17 22:58:37,187 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1548 transitions. [2021-12-17 22:58:37,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1548 transitions. [2021-12-17 22:58:37,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:58:37,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1548 transitions. [2021-12-17 22:58:37,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 140.72727272727272) internal successors, (1548), 11 states have internal predecessors, (1548), 0 states have call successors, (0), 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 22:58:37,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 193.0) internal successors, (2316), 12 states have internal predecessors, (2316), 0 states have call successors, (0), 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 22:58:37,195 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 193.0) internal successors, (2316), 12 states have internal predecessors, (2316), 0 states have call successors, (0), 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 22:58:37,195 INFO L186 Difference]: Start difference. First operand has 173 places, 166 transitions, 383 flow. Second operand 11 states and 1548 transitions. [2021-12-17 22:58:37,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 226 transitions, 782 flow [2021-12-17 22:58:37,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 226 transitions, 769 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-17 22:58:37,200 INFO L242 Difference]: Finished difference. Result has 183 places, 177 transitions, 463 flow [2021-12-17 22:58:37,201 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=463, PETRI_PLACES=183, PETRI_TRANSITIONS=177} [2021-12-17 22:58:37,201 INFO L334 CegarLoopForPetriNet]: 173 programPoint places, 10 predicate places. [2021-12-17 22:58:37,201 INFO L470 AbstractCegarLoop]: Abstraction has has 183 places, 177 transitions, 463 flow [2021-12-17 22:58:37,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 135.66666666666666) internal successors, (1221), 9 states have internal predecessors, (1221), 0 states have call successors, (0), 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 22:58:37,202 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:58:37,202 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:58:37,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 22:58:37,422 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,SelfDestructingSolverStorable3 [2021-12-17 22:58:37,423 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 22:58:37,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:58:37,423 INFO L85 PathProgramCache]: Analyzing trace with hash 165104894, now seen corresponding path program 2 times [2021-12-17 22:58:37,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:58:37,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215028542] [2021-12-17 22:58:37,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:58:37,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:58:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:58:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 22:58:37,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:58:37,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215028542] [2021-12-17 22:58:37,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215028542] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:58:37,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416630792] [2021-12-17 22:58:37,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 22:58:37,586 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:58:37,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:58:37,588 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 22:58:37,589 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 22:58:37,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-17 22:58:37,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 22:58:37,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 22:58:37,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:58:38,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 22:58:38,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 22:58:38,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416630792] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:58:38,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 22:58:38,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2021-12-17 22:58:38,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686864100] [2021-12-17 22:58:38,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:58:38,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:58:38,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:58:38,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:58:38,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-12-17 22:58:38,097 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 193 [2021-12-17 22:58:38,098 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 177 transitions, 463 flow. Second operand has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 0 states have call successors, (0), 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 22:58:38,098 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:58:38,098 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 193 [2021-12-17 22:58:38,098 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:58:38,456 INFO L129 PetriNetUnfolder]: 618/1354 cut-off events. [2021-12-17 22:58:38,457 INFO L130 PetriNetUnfolder]: For 865/1079 co-relation queries the response was YES. [2021-12-17 22:58:38,461 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3112 conditions, 1354 events. 618/1354 cut-off events. For 865/1079 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7314 event pairs, 178 based on Foata normal form. 241/1558 useless extension candidates. Maximal degree in co-relation 3100. Up to 535 conditions per place. [2021-12-17 22:58:38,468 INFO L132 encePairwiseOnDemand]: 184/193 looper letters, 57 selfloop transitions, 13 changer transitions 0/190 dead transitions. [2021-12-17 22:58:38,468 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 190 transitions, 656 flow [2021-12-17 22:58:38,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 22:58:38,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-17 22:58:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1074 transitions. [2021-12-17 22:58:38,471 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6955958549222798 [2021-12-17 22:58:38,471 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1074 transitions. [2021-12-17 22:58:38,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1074 transitions. [2021-12-17 22:58:38,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:58:38,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1074 transitions. [2021-12-17 22:58:38,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.25) internal successors, (1074), 8 states have internal predecessors, (1074), 0 states have call successors, (0), 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 22:58:38,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 193.0) internal successors, (1737), 9 states have internal predecessors, (1737), 0 states have call successors, (0), 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 22:58:38,477 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 193.0) internal successors, (1737), 9 states have internal predecessors, (1737), 0 states have call successors, (0), 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 22:58:38,477 INFO L186 Difference]: Start difference. First operand has 183 places, 177 transitions, 463 flow. Second operand 8 states and 1074 transitions. [2021-12-17 22:58:38,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 190 transitions, 656 flow [2021-12-17 22:58:38,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 190 transitions, 649 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-17 22:58:38,488 INFO L242 Difference]: Finished difference. Result has 188 places, 180 transitions, 524 flow [2021-12-17 22:58:38,488 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=524, PETRI_PLACES=188, PETRI_TRANSITIONS=180} [2021-12-17 22:58:38,490 INFO L334 CegarLoopForPetriNet]: 173 programPoint places, 15 predicate places. [2021-12-17 22:58:38,490 INFO L470 AbstractCegarLoop]: Abstraction has has 188 places, 180 transitions, 524 flow [2021-12-17 22:58:38,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 0 states have call successors, (0), 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 22:58:38,491 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:58:38,491 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:58:38,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 22:58:38,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:58:38,715 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 22:58:38,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:58:38,716 INFO L85 PathProgramCache]: Analyzing trace with hash -897387943, now seen corresponding path program 1 times [2021-12-17 22:58:38,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:58:38,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754469021] [2021-12-17 22:58:38,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:58:38,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:58:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:58:40,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:58:40,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:58:40,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754469021] [2021-12-17 22:58:40,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754469021] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:58:40,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417789069] [2021-12-17 22:58:40,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:58:40,461 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:58:40,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:58:40,468 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 22:58:40,470 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 22:58:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:58:40,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 107 conjunts are in the unsatisfiable core [2021-12-17 22:58:40,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:58:40,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 22:58:40,729 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 22:58:40,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-17 22:58:40,799 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-17 22:58:40,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 22 [2021-12-17 22:58:41,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 22:58:41,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 22:58:41,441 INFO L354 Elim1Store]: treesize reduction 42, result has 19.2 percent of original size [2021-12-17 22:58:41,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 37 [2021-12-17 22:58:41,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-17 22:58:42,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 22:58:42,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 22:58:42,954 INFO L354 Elim1Store]: treesize reduction 40, result has 29.8 percent of original size [2021-12-17 22:58:42,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 32 [2021-12-17 22:58:43,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 22:58:43,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 22:58:44,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 22:58:44,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 22:58:44,716 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 22:58:44,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 35 [2021-12-17 22:58:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:58:45,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:58:45,957 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= c_~N~0 ~M~0) (and (forall ((v_ArrVal_203 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203))) (let ((.cse2 (select .cse4 c_~B~0.base)) (.cse0 (select .cse4 c_~A~0.base))) (<= (let ((.cse1 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse2 (+ .cse1 c_~B~0.offset)))) (let ((.cse3 (* ~M~0 4))) (+ c_~res2~0 (select .cse2 (+ .cse3 c_~B~0.offset)) (select .cse0 (+ c_~A~0.offset .cse3)))))))) (forall ((v_ArrVal_203 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203))) (let ((.cse7 (select .cse9 c_~A~0.base)) (.cse5 (select .cse9 c_~B~0.base))) (< (let ((.cse6 (* ~M~0 4))) (+ c_~res2~0 (select .cse5 (+ .cse6 c_~B~0.offset)) (select .cse7 (+ c_~A~0.offset .cse6)))) (let ((.cse8 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (+ c_~res1~0 (select .cse7 (+ c_~A~0.offset .cse8)) (select .cse5 (+ .cse8 c_~B~0.offset)) 1))))))) (<= (+ ~M~0 2) c_~N~0))) is different from false [2021-12-17 22:58:46,199 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203))) (let ((.cse0 (select .cse4 c_~A~0.base)) (.cse2 (select .cse4 c_~B~0.base))) (< (let ((.cse1 (* ~M~0 4))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse2 (+ .cse1 c_~B~0.offset)))) (let ((.cse3 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (+ (select .cse0 (+ c_~A~0.offset .cse3)) c_~res1~0 (select .cse2 (+ .cse3 c_~B~0.offset)) 1)))))) (forall ((v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203))) (let ((.cse5 (select .cse9 c_~A~0.base)) (.cse7 (select .cse9 c_~B~0.base))) (<= (let ((.cse6 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (+ (select .cse5 (+ c_~A~0.offset .cse6)) c_~res1~0 (select .cse7 (+ .cse6 c_~B~0.offset)))) (let ((.cse8 (* ~M~0 4))) (+ c_~res2~0 (select .cse5 (+ c_~A~0.offset .cse8)) (select .cse7 (+ .cse8 c_~B~0.offset))))))))) (<= c_~N~0 ~M~0) (<= (+ ~M~0 2) c_~N~0))) is different from false [2021-12-17 22:58:46,397 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= c_~N~0 ~M~0) (and (forall ((v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203))) (let ((.cse1 (select .cse3 c_~A~0.base)) (.cse0 (select .cse3 c_~B~0.base))) (<= (+ c_~res1~0 (select .cse0 c_~B~0.offset) (select .cse1 c_~A~0.offset)) (let ((.cse2 (* ~M~0 4))) (+ c_~res2~0 (select .cse1 (+ c_~A~0.offset .cse2)) (select .cse0 (+ .cse2 c_~B~0.offset)))))))) (forall ((v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203))) (let ((.cse6 (select .cse7 c_~B~0.base)) (.cse4 (select .cse7 c_~A~0.base))) (< (let ((.cse5 (* ~M~0 4))) (+ c_~res2~0 (select .cse4 (+ c_~A~0.offset .cse5)) (select .cse6 (+ .cse5 c_~B~0.offset)))) (+ c_~res1~0 (select .cse6 c_~B~0.offset) (select .cse4 c_~A~0.offset) 1)))))) (<= (+ ~M~0 2) c_~N~0))) is different from false [2021-12-17 22:58:46,484 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= c_~N~0 ~M~0) (and (forall ((v_ArrVal_201 (Array Int Int)) (v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203))) (let ((.cse2 (select .cse3 c_~A~0.base)) (.cse0 (select .cse3 c_~B~0.base))) (< (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ .cse1 c_~B~0.offset)) c_~res2~0 (select .cse2 (+ c_~A~0.offset .cse1)))) (+ (select .cse2 c_~A~0.offset) c_~res1~0 (select .cse0 c_~B~0.offset) 1))))) (forall ((v_ArrVal_201 (Array Int Int)) (v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203))) (let ((.cse5 (select .cse7 c_~B~0.base)) (.cse4 (select .cse7 c_~A~0.base))) (<= (+ (select .cse4 c_~A~0.offset) c_~res1~0 (select .cse5 c_~B~0.offset)) (let ((.cse6 (* ~M~0 4))) (+ (select .cse5 (+ .cse6 c_~B~0.offset)) c_~res2~0 (select .cse4 (+ c_~A~0.offset .cse6))))))))) (<= (+ ~M~0 2) c_~N~0))) is different from false [2021-12-17 22:58:46,831 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= c_~N~0 ~M~0) (<= (+ ~M~0 2) c_~N~0) (and (forall ((v_ArrVal_201 (Array Int Int)) (v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203))) (let ((.cse0 (select .cse3 c_~A~0.base)) (.cse1 (select .cse3 |c_ULTIMATE.start_main_#t~ret19#1.base|))) (<= (+ (select .cse0 c_~A~0.offset) c_~res1~0 (select .cse1 |c_ULTIMATE.start_main_#t~ret19#1.offset|)) (let ((.cse2 (* ~M~0 4))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset .cse2)) (select .cse1 (+ .cse2 |c_ULTIMATE.start_main_#t~ret19#1.offset|)))))))) (forall ((v_ArrVal_201 (Array Int Int)) (v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203))) (let ((.cse4 (select .cse7 c_~A~0.base)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_#t~ret19#1.base|))) (< (let ((.cse5 (* ~M~0 4))) (+ c_~res2~0 (select .cse4 (+ c_~A~0.offset .cse5)) (select .cse6 (+ .cse5 |c_ULTIMATE.start_main_#t~ret19#1.offset|)))) (+ (select .cse4 c_~A~0.offset) c_~res1~0 (select .cse6 |c_ULTIMATE.start_main_#t~ret19#1.offset|) 1)))))))) is different from false [2021-12-17 22:58:46,925 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= c_~N~0 ~M~0) (and (forall ((v_ArrVal_201 (Array Int Int)) (v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse0 (select .cse3 c_~A~0.base))) (<= (+ (select .cse0 c_~A~0.offset) c_~res1~0 (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (let ((.cse2 (* ~M~0 4))) (+ (select .cse1 (+ .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0 (select .cse0 (+ c_~A~0.offset .cse2)))))))) (forall ((v_ArrVal_201 (Array Int Int)) (v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203))) (let ((.cse6 (select .cse7 c_~A~0.base)) (.cse4 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (< (let ((.cse5 (* ~M~0 4))) (+ (select .cse4 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0 (select .cse6 (+ c_~A~0.offset .cse5)))) (+ (select .cse6 c_~A~0.offset) c_~res1~0 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 1)))))) (<= (+ ~M~0 2) c_~N~0))) is different from false [2021-12-17 22:58:46,992 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= c_~N~0 ~M~0) (<= (+ ~M~0 2) c_~N~0) (and (forall ((v_ArrVal_201 (Array Int Int)) (v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203))) (let ((.cse2 (select .cse3 c_~A~0.base)) (.cse0 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (< (let ((.cse1 (* ~M~0 4))) (+ c_~res2~0 (select .cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse1)) (select .cse2 (+ c_~A~0.offset .cse1)))) (+ (select .cse2 c_~A~0.offset) c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1))))) (forall ((v_ArrVal_201 (Array Int Int)) (v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse4 (select .cse7 c_~A~0.base))) (<= (+ (select .cse4 c_~A~0.offset) c_~res1~0 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (let ((.cse6 (* ~M~0 4))) (+ c_~res2~0 (select .cse5 (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse6)) (select .cse4 (+ c_~A~0.offset .cse6))))))))))) is different from false [2021-12-17 22:58:47,240 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= c_~N~0 ~M~0) (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_199 Int) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (let ((.cse3 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_199)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203))) (let ((.cse1 (select .cse3 c_~A~0.base)) (.cse0 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (+ c_~res1~0 (select .cse0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse1 c_~A~0.offset)) (let ((.cse2 (* ~M~0 4))) (+ c_~res2~0 (select .cse1 (+ c_~A~0.offset .cse2)) (select .cse0 (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse2)))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_199 Int) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (let ((.cse7 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_199)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse4 (select .cse7 c_~A~0.base))) (< (let ((.cse5 (* ~M~0 4))) (+ c_~res2~0 (select .cse4 (+ c_~A~0.offset .cse5)) (select .cse6 (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse5)))) (+ c_~res1~0 (select .cse6 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse4 c_~A~0.offset) 1)))))) (<= (+ ~M~0 2) c_~N~0))) is different from false [2021-12-17 22:58:47,365 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_199 Int) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (let ((.cse3 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_199)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203))) (let ((.cse0 (select .cse3 c_~A~0.base)) (.cse2 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (< (let ((.cse1 (* ~M~0 4))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse2 (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse1)))) (+ (select .cse0 c_~A~0.offset) c_~res1~0 (select .cse2 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_199 Int) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (let ((.cse7 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_199)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203))) (let ((.cse4 (select .cse7 c_~A~0.base)) (.cse5 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (+ (select .cse4 c_~A~0.offset) c_~res1~0 (select .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (let ((.cse6 (* ~M~0 4))) (+ c_~res2~0 (select .cse4 (+ c_~A~0.offset .cse6)) (select .cse5 (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse6))))))))) (<= c_~N~0 ~M~0) (<= (+ ~M~0 2) c_~N~0))) is different from false [2021-12-17 22:58:47,451 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_199 Int) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (let ((.cse3 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_199)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base|)) (.cse1 (select .cse3 c_~A~0.base))) (<= (+ c_~res1~0 (select .cse0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse1 c_~A~0.offset)) (let ((.cse2 (* ~M~0 4))) (+ c_~res2~0 (select .cse0 (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse2)) (select .cse1 (+ c_~A~0.offset .cse2)))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_199 Int) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (let ((.cse7 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_199)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base|)) (.cse6 (select .cse7 c_~A~0.base))) (< (let ((.cse5 (* ~M~0 4))) (+ c_~res2~0 (select .cse4 (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse5)) (select .cse6 (+ c_~A~0.offset .cse5)))) (+ c_~res1~0 (select .cse4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse6 c_~A~0.offset) 1)))))) (<= c_~N~0 ~M~0) (<= (+ ~M~0 2) c_~N~0))) is different from false [2021-12-17 22:59:32,609 INFO L354 Elim1Store]: treesize reduction 46, result has 60.0 percent of original size [2021-12-17 22:59:32,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 396 treesize of output 209 [2021-12-17 22:59:32,869 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 22:59:32,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38017 treesize of output 35079 [2021-12-17 22:59:33,321 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 22:59:33,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 39608 treesize of output 39358 [2021-12-17 22:59:33,802 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 22:59:33,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39021 treesize of output 38070 [2021-12-17 22:59:34,119 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 22:59:34,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37997 treesize of output 37558 [2021-12-17 22:59:34,417 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 22:59:34,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37485 treesize of output 37302 [2021-12-17 22:59:34,723 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 22:59:34,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37229 treesize of output 35254 [2021-12-17 22:59:35,111 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 22:59:35,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35181 treesize of output 31158 [2021-12-17 22:59:35,454 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 22:59:35,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31085 treesize of output 22966 [2021-12-17 22:59:35,611 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-17 22:59:35,611 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-17 22:59:35,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2021-12-17 22:59:35,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558128273] [2021-12-17 22:59:35,612 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-17 22:59:35,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-17 22:59:35,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:59:35,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-17 22:59:35,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=802, Invalid=5523, Unknown=35, NotChecked=1650, Total=8010 [2021-12-17 22:59:35,618 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 193 [2021-12-17 22:59:35,620 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 180 transitions, 524 flow. Second operand has 39 states, 39 states have (on average 72.51282051282051) internal successors, (2828), 39 states have internal predecessors, (2828), 0 states have call successors, (0), 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 22:59:35,620 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:59:35,620 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 193 [2021-12-17 22:59:35,620 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:59:51,612 INFO L129 PetriNetUnfolder]: 2834/5613 cut-off events. [2021-12-17 22:59:51,612 INFO L130 PetriNetUnfolder]: For 5090/5153 co-relation queries the response was YES. [2021-12-17 22:59:51,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13884 conditions, 5613 events. 2834/5613 cut-off events. For 5090/5153 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 40492 event pairs, 379 based on Foata normal form. 12/5509 useless extension candidates. Maximal degree in co-relation 13870. Up to 1823 conditions per place. [2021-12-17 22:59:51,668 INFO L132 encePairwiseOnDemand]: 142/193 looper letters, 290 selfloop transitions, 129 changer transitions 6/493 dead transitions. [2021-12-17 22:59:51,669 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 493 transitions, 2530 flow [2021-12-17 22:59:51,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-12-17 22:59:51,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2021-12-17 22:59:51,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 4155 transitions. [2021-12-17 22:59:51,681 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.39867587795048937 [2021-12-17 22:59:51,682 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 4155 transitions. [2021-12-17 22:59:51,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 4155 transitions. [2021-12-17 22:59:51,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:59:51,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 4155 transitions. [2021-12-17 22:59:51,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 76.94444444444444) internal successors, (4155), 54 states have internal predecessors, (4155), 0 states have call successors, (0), 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 22:59:51,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 193.0) internal successors, (10615), 55 states have internal predecessors, (10615), 0 states have call successors, (0), 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 22:59:51,715 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 193.0) internal successors, (10615), 55 states have internal predecessors, (10615), 0 states have call successors, (0), 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 22:59:51,715 INFO L186 Difference]: Start difference. First operand has 188 places, 180 transitions, 524 flow. Second operand 54 states and 4155 transitions. [2021-12-17 22:59:51,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 493 transitions, 2530 flow [2021-12-17 22:59:51,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 493 transitions, 2463 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-12-17 22:59:51,756 INFO L242 Difference]: Finished difference. Result has 268 places, 291 transitions, 1442 flow [2021-12-17 22:59:51,756 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=1442, PETRI_PLACES=268, PETRI_TRANSITIONS=291} [2021-12-17 22:59:51,758 INFO L334 CegarLoopForPetriNet]: 173 programPoint places, 95 predicate places. [2021-12-17 22:59:51,759 INFO L470 AbstractCegarLoop]: Abstraction has has 268 places, 291 transitions, 1442 flow [2021-12-17 22:59:51,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 72.51282051282051) internal successors, (2828), 39 states have internal predecessors, (2828), 0 states have call successors, (0), 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 22:59:51,760 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:59:51,761 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:59:51,786 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 22:59:51,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:59:51,976 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 22:59:51,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:59:51,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1923273485, now seen corresponding path program 2 times [2021-12-17 22:59:51,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:59:51,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622358510] [2021-12-17 22:59:51,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:59:51,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:59:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:00:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:00:00,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:00:00,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622358510] [2021-12-17 23:00:00,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622358510] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:00:00,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777707200] [2021-12-17 23:00:00,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 23:00:00,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:00:00,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:00:00,760 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:00:00,760 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:00:00,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 23:00:00,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 23:00:00,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 70 conjunts are in the unsatisfiable core [2021-12-17 23:00:00,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:00:05,832 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:00:05,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 93 [2021-12-17 23:00:07,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:00:07,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:00:09,840 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:00:09,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 119 [2021-12-17 23:00:10,451 INFO L354 Elim1Store]: treesize reduction 89, result has 18.3 percent of original size [2021-12-17 23:00:10,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 29 [2021-12-17 23:00:15,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:00:15,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777707200] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 23:00:15,728 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 23:00:15,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 27, 21] total 77 [2021-12-17 23:00:15,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616068112] [2021-12-17 23:00:15,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 23:00:15,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2021-12-17 23:00:15,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:00:15,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2021-12-17 23:00:15,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=5378, Unknown=0, NotChecked=0, Total=5852 [2021-12-17 23:00:15,734 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 193 [2021-12-17 23:00:15,738 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 291 transitions, 1442 flow. Second operand has 77 states, 77 states have (on average 63.62337662337662) internal successors, (4899), 77 states have internal predecessors, (4899), 0 states have call successors, (0), 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:00:15,738 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:00:15,738 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 193 [2021-12-17 23:00:15,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:01:39,463 INFO L129 PetriNetUnfolder]: 20278/33648 cut-off events. [2021-12-17 23:01:39,463 INFO L130 PetriNetUnfolder]: For 65412/65576 co-relation queries the response was YES. [2021-12-17 23:01:39,789 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107095 conditions, 33648 events. 20278/33648 cut-off events. For 65412/65576 co-relation queries the response was YES. Maximal size of possible extension queue 1701. Compared 281843 event pairs, 2109 based on Foata normal form. 14/33533 useless extension candidates. Maximal degree in co-relation 107050. Up to 8705 conditions per place. [2021-12-17 23:01:39,973 INFO L132 encePairwiseOnDemand]: 136/193 looper letters, 1103 selfloop transitions, 807 changer transitions 36/1999 dead transitions. [2021-12-17 23:01:39,973 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 1999 transitions, 14245 flow [2021-12-17 23:01:39,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2021-12-17 23:01:39,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2021-12-17 23:01:39,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 11489 transitions. [2021-12-17 23:01:40,003 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.3586054060802797 [2021-12-17 23:01:40,003 INFO L72 ComplementDD]: Start complementDD. Operand 166 states and 11489 transitions. [2021-12-17 23:01:40,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 166 states and 11489 transitions. [2021-12-17 23:01:40,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:01:40,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 166 states and 11489 transitions. [2021-12-17 23:01:40,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 167 states, 166 states have (on average 69.21084337349397) internal successors, (11489), 166 states have internal predecessors, (11489), 0 states have call successors, (0), 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:01:40,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 167 states, 167 states have (on average 193.0) internal successors, (32231), 167 states have internal predecessors, (32231), 0 states have call successors, (0), 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:01:40,110 INFO L81 ComplementDD]: Finished complementDD. Result has 167 states, 167 states have (on average 193.0) internal successors, (32231), 167 states have internal predecessors, (32231), 0 states have call successors, (0), 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:01:40,111 INFO L186 Difference]: Start difference. First operand has 268 places, 291 transitions, 1442 flow. Second operand 166 states and 11489 transitions. [2021-12-17 23:01:40,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 1999 transitions, 14245 flow [2021-12-17 23:01:41,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 1999 transitions, 14043 flow, removed 19 selfloop flow, removed 8 redundant places. [2021-12-17 23:01:41,171 INFO L242 Difference]: Finished difference. Result has 506 places, 1032 transitions, 9670 flow [2021-12-17 23:01:41,172 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=1405, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=166, PETRI_FLOW=9670, PETRI_PLACES=506, PETRI_TRANSITIONS=1032} [2021-12-17 23:01:41,173 INFO L334 CegarLoopForPetriNet]: 173 programPoint places, 333 predicate places. [2021-12-17 23:01:41,173 INFO L470 AbstractCegarLoop]: Abstraction has has 506 places, 1032 transitions, 9670 flow [2021-12-17 23:01:41,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 63.62337662337662) internal successors, (4899), 77 states have internal predecessors, (4899), 0 states have call successors, (0), 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:01:41,174 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:01:41,175 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:01:41,199 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:01:41,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:01:41,399 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:01:41,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:01:41,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1088812197, now seen corresponding path program 3 times [2021-12-17 23:01:41,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:01:41,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524863983] [2021-12-17 23:01:41,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:01:41,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:01:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:01:45,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:01:45,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:01:45,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524863983] [2021-12-17 23:01:45,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524863983] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:01:45,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793505371] [2021-12-17 23:01:45,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 23:01:45,885 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:01:45,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:01:45,886 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:01:45,887 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:01:45,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-17 23:01:45,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 23:01:45,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 99 conjunts are in the unsatisfiable core [2021-12-17 23:01:46,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:01:46,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:01:47,309 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 23:01:47,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 11 treesize of output 11 [2021-12-17 23:01:51,282 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:01:53,745 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:01:54,556 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:01:55,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 23:01:55,676 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 23:01:55,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2021-12-17 23:01:56,488 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:01:56,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 93 [2021-12-17 23:01:57,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:01:57,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:01:59,724 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((v_ArrVal_289 (Array Int Int))) (<= c_~res1~0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289)) (.cse1 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)) (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)))))) (forall ((v_ArrVal_289 (Array Int Int))) (< (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289)) (.cse3 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset .cse3)) (select (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset)))) (+ c_~res1~0 1)))) (<= c_~N~0 ~M~0) (<= (+ ~M~0 2) c_~N~0))) is different from false [2021-12-17 23:02:00,482 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((v_ArrVal_289 (Array Int Int))) (<= (let ((.cse0 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (+ c_~res1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0)) (select (select |c_#memory_int| c_~B~0.base) (+ .cse0 c_~B~0.offset)))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289)) (.cse2 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset .cse2)) (select (select .cse1 c_~B~0.base) (+ .cse2 c_~B~0.offset)))))) (forall ((v_ArrVal_289 (Array Int Int))) (< (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289)) (.cse4 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse3 c_~A~0.base) (+ c_~A~0.offset .cse4)) (select (select .cse3 c_~B~0.base) (+ .cse4 c_~B~0.offset)))) (let ((.cse5 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (+ c_~res1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse5)) (select (select |c_#memory_int| c_~B~0.base) (+ .cse5 c_~B~0.offset)) 1))))) (<= c_~N~0 ~M~0) (<= (+ ~M~0 2) c_~N~0))) is different from false [2021-12-17 23:02:00,972 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= c_~N~0 ~M~0) (and (forall ((v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288))) (< (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289)) (.cse1 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))) (let ((.cse3 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (+ c_~res1~0 (select (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset)) (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset .cse3)) 1))))) (forall ((v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288))) (<= (let ((.cse5 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (+ c_~res1~0 (select (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset)) (select (select .cse4 c_~A~0.base) (+ c_~A~0.offset .cse5)))) (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289)) (.cse7 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse6 c_~B~0.base) (+ .cse7 c_~B~0.offset)) (select (select .cse6 c_~A~0.base) (+ c_~A~0.offset .cse7)))))))) (<= (+ ~M~0 2) c_~N~0))) is different from false [2021-12-17 23:02:01,084 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= c_~N~0 ~M~0) (and (forall ((v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288))) (<= (+ c_~res1~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~B~0.base) c_~B~0.offset)) (let ((.cse1 (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289)) (.cse2 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse1 c_~B~0.base) (+ .cse2 c_~B~0.offset)) (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset .cse2))))))) (forall ((v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288))) (< (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289)) (.cse4 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse3 c_~B~0.base) (+ .cse4 c_~B~0.offset)) (select (select .cse3 c_~A~0.base) (+ c_~A~0.offset .cse4)))) (+ c_~res1~0 (select (select .cse5 c_~A~0.base) c_~A~0.offset) (select (select .cse5 c_~B~0.base) c_~B~0.offset) 1))))) (<= (+ ~M~0 2) c_~N~0))) is different from false [2021-12-17 23:02:01,703 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= c_~N~0 ~M~0) (and (forall ((v_ArrVal_287 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288))) (<= (+ c_~res1~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~B~0.base) c_~B~0.offset)) (let ((.cse1 (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289)) (.cse2 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse1 c_~B~0.base) (+ .cse2 c_~B~0.offset)) (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset .cse2))))))) (forall ((v_ArrVal_287 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288))) (< (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289)) (.cse4 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse3 c_~B~0.base) (+ .cse4 c_~B~0.offset)) (select (select .cse3 c_~A~0.base) (+ c_~A~0.offset .cse4)))) (+ c_~res1~0 (select (select .cse5 c_~A~0.base) c_~A~0.offset) (select (select .cse5 c_~B~0.base) c_~B~0.offset) 1))))) (<= (+ ~M~0 2) c_~N~0))) is different from false [2021-12-17 23:02:02,893 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((v_ArrVal_287 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288))) (< (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289)) (.cse1 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse0 |c_ULTIMATE.start_main_#t~ret19#1.base|) (+ .cse1 |c_ULTIMATE.start_main_#t~ret19#1.offset|)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))) (+ c_~res1~0 (select (select .cse2 c_~A~0.base) c_~A~0.offset) (select (select .cse2 |c_ULTIMATE.start_main_#t~ret19#1.base|) |c_ULTIMATE.start_main_#t~ret19#1.offset|) 1)))) (forall ((v_ArrVal_287 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288))) (<= (+ c_~res1~0 (select (select .cse3 c_~A~0.base) c_~A~0.offset) (select (select .cse3 |c_ULTIMATE.start_main_#t~ret19#1.base|) |c_ULTIMATE.start_main_#t~ret19#1.offset|)) (let ((.cse4 (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289)) (.cse5 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse4 |c_ULTIMATE.start_main_#t~ret19#1.base|) (+ .cse5 |c_ULTIMATE.start_main_#t~ret19#1.offset|)) (select (select .cse4 c_~A~0.base) (+ c_~A~0.offset .cse5)))))))) (<= c_~N~0 ~M~0) (<= (+ ~M~0 2) c_~N~0))) is different from false [2021-12-17 23:02:03,107 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((v_ArrVal_287 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288))) (< (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289)) (.cse1 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))) (+ c_~res1~0 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (select (select .cse2 c_~A~0.base) c_~A~0.offset) 1)))) (forall ((v_ArrVal_287 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288))) (<= (+ c_~res1~0 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (select (select .cse3 c_~A~0.base) c_~A~0.offset)) (let ((.cse4 (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289)) (.cse5 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select (select .cse4 c_~A~0.base) (+ c_~A~0.offset .cse5)))))))) (<= c_~N~0 ~M~0) (<= (+ ~M~0 2) c_~N~0))) is different from false [2021-12-17 23:02:03,225 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((v_ArrVal_287 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288))) (< (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289)) (.cse1 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse1)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))) (+ (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0 (select (select .cse2 c_~A~0.base) c_~A~0.offset) 1)))) (forall ((v_ArrVal_287 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288))) (<= (+ (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0 (select (select .cse3 c_~A~0.base) c_~A~0.offset)) (let ((.cse4 (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289)) (.cse5 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse5)) (select (select .cse4 c_~A~0.base) (+ c_~A~0.offset .cse5)))))))) (<= c_~N~0 ~M~0) (<= (+ ~M~0 2) c_~N~0))) is different from false [2021-12-17 23:02:04,653 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:02:04,654 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 224 treesize of output 141 [2021-12-17 23:02:05,227 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:02:05,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1810426 treesize of output 1613956 [2021-12-17 23:02:11,556 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:02:11,558 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 1613805 treesize of output 1417214 [2021-12-17 23:02:14,889 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:02:14,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1417197 treesize of output 1253430 [2021-12-17 23:02:18,238 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:02:18,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1253357 treesize of output 1171510 [2021-12-17 23:02:21,422 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:02:21,425 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 1171437 treesize of output 1073150 [2021-12-17 23:02:24,870 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:02:24,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1073133 treesize of output 991286 [2021-12-17 23:02:28,296 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:02:28,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 991213 treesize of output 950326 [2021-12-17 23:02:31,412 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-17 23:02:31,412 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-17 23:02:31,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2021-12-17 23:02:31,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114007895] [2021-12-17 23:02:31,413 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-17 23:02:31,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-17 23:02:31,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:02:31,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-17 23:02:31,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=4440, Unknown=8, NotChecked=1160, Total=6162 [2021-12-17 23:02:31,417 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 193 [2021-12-17 23:02:31,419 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 1032 transitions, 9670 flow. Second operand has 38 states, 38 states have (on average 67.63157894736842) internal successors, (2570), 38 states have internal predecessors, (2570), 0 states have call successors, (0), 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:31,419 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:02:31,419 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 193 [2021-12-17 23:02:31,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:02:53,756 INFO L129 PetriNetUnfolder]: 21984/36931 cut-off events. [2021-12-17 23:02:53,756 INFO L130 PetriNetUnfolder]: For 661776/661876 co-relation queries the response was YES. [2021-12-17 23:02:54,986 INFO L84 FinitePrefix]: Finished finitePrefix Result has 203438 conditions, 36931 events. 21984/36931 cut-off events. For 661776/661876 co-relation queries the response was YES. Maximal size of possible extension queue 1904. Compared 320859 event pairs, 5147 based on Foata normal form. 14/36618 useless extension candidates. Maximal degree in co-relation 203313. Up to 22206 conditions per place. [2021-12-17 23:02:55,262 INFO L132 encePairwiseOnDemand]: 148/193 looper letters, 838 selfloop transitions, 498 changer transitions 9/1406 dead transitions. [2021-12-17 23:02:55,262 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 1406 transitions, 16151 flow [2021-12-17 23:02:55,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-12-17 23:02:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2021-12-17 23:02:55,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 3358 transitions. [2021-12-17 23:02:55,268 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.37019071767170103 [2021-12-17 23:02:55,268 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 3358 transitions. [2021-12-17 23:02:55,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 3358 transitions. [2021-12-17 23:02:55,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:02:55,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 3358 transitions. [2021-12-17 23:02:55,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 71.44680851063829) internal successors, (3358), 47 states have internal predecessors, (3358), 0 states have call successors, (0), 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:55,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 193.0) internal successors, (9264), 48 states have internal predecessors, (9264), 0 states have call successors, (0), 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:55,287 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 193.0) internal successors, (9264), 48 states have internal predecessors, (9264), 0 states have call successors, (0), 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:55,287 INFO L186 Difference]: Start difference. First operand has 506 places, 1032 transitions, 9670 flow. Second operand 47 states and 3358 transitions. [2021-12-17 23:02:55,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 1406 transitions, 16151 flow [2021-12-17 23:03:01,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 1406 transitions, 14982 flow, removed 390 selfloop flow, removed 60 redundant places. [2021-12-17 23:03:01,971 INFO L242 Difference]: Finished difference. Result has 496 places, 1232 transitions, 12408 flow [2021-12-17 23:03:01,972 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=8757, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1032, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=309, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=12408, PETRI_PLACES=496, PETRI_TRANSITIONS=1232} [2021-12-17 23:03:01,972 INFO L334 CegarLoopForPetriNet]: 173 programPoint places, 323 predicate places. [2021-12-17 23:03:01,972 INFO L470 AbstractCegarLoop]: Abstraction has has 496 places, 1232 transitions, 12408 flow [2021-12-17 23:03:01,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 67.63157894736842) internal successors, (2570), 38 states have internal predecessors, (2570), 0 states have call successors, (0), 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:03:01,973 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:03:01,974 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:03:01,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 23:03:02,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:03:02,179 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:03:02,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:03:02,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1780950569, now seen corresponding path program 4 times [2021-12-17 23:03:02,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:03:02,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759257289] [2021-12-17 23:03:02,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:03:02,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:03:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:03:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:03:08,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:03:08,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759257289] [2021-12-17 23:03:08,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759257289] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:03:08,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169161154] [2021-12-17 23:03:08,112 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 23:03:08,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:03:08,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:03:08,113 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:03:08,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 23:03:08,234 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 23:03:08,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 23:03:08,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 95 conjunts are in the unsatisfiable core [2021-12-17 23:03:08,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:03:14,290 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 11 treesize of output 7 [2021-12-17 23:03:16,424 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:03:17,268 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:03:18,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 23:03:18,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 23:03:18,257 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 23:03:18,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2021-12-17 23:03:18,963 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:03:18,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 93 [2021-12-17 23:03:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:03:20,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:03:21,851 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= c_~N~0 ~M~0) (and (forall ((v_ArrVal_334 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_334)) (.cse1 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)) (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)))) (+ c_~res1~0 1))) (forall ((v_ArrVal_334 (Array Int Int))) (<= c_~res1~0 (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_334)) (.cse3 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset .cse3)) (select (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset))))))) (<= (+ ~M~0 2) c_~N~0))) is different from false [2021-12-17 23:03:22,650 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((v_ArrVal_334 (Array Int Int))) (<= (let ((.cse0 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (+ c_~res1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0)) (select (select |c_#memory_int| c_~B~0.base) (+ .cse0 c_~B~0.offset)))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_334)) (.cse2 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset .cse2)) (select (select .cse1 c_~B~0.base) (+ .cse2 c_~B~0.offset)))))) (forall ((v_ArrVal_334 (Array Int Int))) (< (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_334)) (.cse4 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse3 c_~A~0.base) (+ c_~A~0.offset .cse4)) (select (select .cse3 c_~B~0.base) (+ .cse4 c_~B~0.offset)))) (let ((.cse5 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (+ c_~res1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse5)) (select (select |c_#memory_int| c_~B~0.base) (+ .cse5 c_~B~0.offset)) 1))))) (<= c_~N~0 ~M~0) (<= (+ ~M~0 2) c_~N~0))) is different from false [2021-12-17 23:03:22,946 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_333))) (<= (let ((.cse1 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (+ c_~res1~0 (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))) (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_334)) (.cse3 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset)) (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset .cse3))))))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_333))) (< (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_334)) (.cse5 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset)) (select (select .cse4 c_~A~0.base) (+ c_~A~0.offset .cse5)))) (let ((.cse7 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (+ c_~res1~0 (select (select .cse6 c_~B~0.base) (+ .cse7 c_~B~0.offset)) (select (select .cse6 c_~A~0.base) (+ c_~A~0.offset .cse7)) 1)))))) (<= c_~N~0 ~M~0) (<= (+ ~M~0 2) c_~N~0))) is different from false [2021-12-17 23:03:23,399 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= c_~N~0 ~M~0) (<= (+ ~M~0 2) c_~N~0) (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_333))) (< (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_334)) (.cse1 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))) (+ (select (select .cse2 c_~B~0.base) c_~B~0.offset) c_~res1~0 (select (select .cse2 c_~A~0.base) c_~A~0.offset) 1)))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_333))) (<= (+ (select (select .cse3 c_~B~0.base) c_~B~0.offset) c_~res1~0 (select (select .cse3 c_~A~0.base) c_~A~0.offset)) (let ((.cse4 (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_334)) (.cse5 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset)) (select (select .cse4 c_~A~0.base) (+ c_~A~0.offset .cse5)))))))))) is different from false [2021-12-17 23:03:23,615 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= c_~N~0 ~M~0) (<= (+ ~M~0 2) c_~N~0) (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_333))) (<= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0 (select (select .cse0 c_~B~0.base) c_~B~0.offset)) (let ((.cse1 (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_334)) (.cse2 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse1 c_~B~0.base) (+ .cse2 c_~B~0.offset)) (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset .cse2))))))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_333))) (< (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_334)) (.cse4 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse3 c_~B~0.base) (+ .cse4 c_~B~0.offset)) (select (select .cse3 c_~A~0.base) (+ c_~A~0.offset .cse4)))) (+ (select (select .cse5 c_~A~0.base) c_~A~0.offset) c_~res1~0 (select (select .cse5 c_~B~0.base) c_~B~0.offset) 1))))))) is different from false [2021-12-17 23:03:24,527 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_333))) (< (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_334)) (.cse1 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)) (select (select .cse0 |c_ULTIMATE.start_main_#t~ret19#1.base|) (+ .cse1 |c_ULTIMATE.start_main_#t~ret19#1.offset|)))) (+ (select (select .cse2 c_~A~0.base) c_~A~0.offset) c_~res1~0 (select (select .cse2 |c_ULTIMATE.start_main_#t~ret19#1.base|) |c_ULTIMATE.start_main_#t~ret19#1.offset|) 1)))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_333))) (<= (+ (select (select .cse3 c_~A~0.base) c_~A~0.offset) c_~res1~0 (select (select .cse3 |c_ULTIMATE.start_main_#t~ret19#1.base|) |c_ULTIMATE.start_main_#t~ret19#1.offset|)) (let ((.cse4 (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_334)) (.cse5 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse4 c_~A~0.base) (+ c_~A~0.offset .cse5)) (select (select .cse4 |c_ULTIMATE.start_main_#t~ret19#1.base|) (+ .cse5 |c_ULTIMATE.start_main_#t~ret19#1.offset|)))))))) (<= c_~N~0 ~M~0) (<= (+ ~M~0 2) c_~N~0))) is different from false [2021-12-17 23:03:24,722 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_333))) (< (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_334)) (.cse1 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (+ (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (select (select .cse2 c_~A~0.base) c_~A~0.offset) c_~res1~0 1)))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_333))) (<= (+ (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (select (select .cse3 c_~A~0.base) c_~A~0.offset) c_~res1~0) (let ((.cse4 (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_334)) (.cse5 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse4 c_~A~0.base) (+ c_~A~0.offset .cse5)) (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))))) (<= c_~N~0 ~M~0) (<= (+ ~M~0 2) c_~N~0))) is different from false [2021-12-17 23:03:24,871 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= c_~N~0 ~M~0) (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_333))) (<= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (let ((.cse1 (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_334)) (.cse2 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset .cse2)) (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse2))))))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_333))) (< (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_334)) (.cse4 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse3 c_~A~0.base) (+ c_~A~0.offset .cse4)) (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse4)))) (+ (select (select .cse5 c_~A~0.base) c_~A~0.offset) c_~res1~0 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1))))) (<= (+ ~M~0 2) c_~N~0))) is different from false [2021-12-17 23:03:25,353 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:03:25,354 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 224 treesize of output 141 [2021-12-17 23:03:25,801 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:03:25,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1810426 treesize of output 1613956 [2021-12-17 23:03:32,066 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:03:32,068 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 1613805 treesize of output 1515518 [2021-12-17 23:03:35,481 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:03:35,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1515501 treesize of output 1474614 [2021-12-17 23:03:38,829 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:03:38,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1474541 treesize of output 1392694 [2021-12-17 23:03:42,006 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:03:42,008 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 1392621 treesize of output 1196030 [2021-12-17 23:03:45,473 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:03:45,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1196013 treesize of output 1114166