/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/weaver/chl-chromosome-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-53ca081-m [2022-09-16 11:42:50,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-16 11:42:50,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-16 11:42:50,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-16 11:42:50,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-16 11:42:50,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-16 11:42:50,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-16 11:42:50,901 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-16 11:42:50,902 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-16 11:42:50,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-16 11:42:50,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-16 11:42:50,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-16 11:42:50,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-16 11:42:50,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-16 11:42:50,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-16 11:42:50,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-16 11:42:50,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-16 11:42:50,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-16 11:42:50,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-16 11:42:50,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-16 11:42:50,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-16 11:42:50,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-16 11:42:50,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-16 11:42:50,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-16 11:42:50,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-16 11:42:50,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-16 11:42:50,935 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-16 11:42:50,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-16 11:42:50,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-16 11:42:50,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-16 11:42:50,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-16 11:42:50,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-16 11:42:50,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-16 11:42:50,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-16 11:42:50,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-16 11:42:50,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-16 11:42:50,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-16 11:42:50,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-16 11:42:50,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-16 11:42:50,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-16 11:42:50,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-16 11:42:50,945 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-09-16 11:42:50,979 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-16 11:42:50,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-16 11:42:50,981 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-16 11:42:50,981 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-16 11:42:50,981 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-16 11:42:50,982 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-16 11:42:50,982 INFO L138 SettingsManager]: * Use SBE=true [2022-09-16 11:42:50,982 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-16 11:42:50,982 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-16 11:42:50,982 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-16 11:42:50,983 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-16 11:42:50,983 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-16 11:42:50,983 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-16 11:42:50,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-16 11:42:50,983 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-16 11:42:50,984 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-16 11:42:50,984 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-16 11:42:50,984 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-16 11:42:50,984 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-16 11:42:50,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-16 11:42:50,984 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-16 11:42:50,984 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-16 11:42:50,985 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-16 11:42:50,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 11:42:50,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-16 11:42:50,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-16 11:42:50,985 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-16 11:42:50,985 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-16 11:42:50,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-16 11:42:50,986 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-16 11:42:50,986 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-16 11:42:50,986 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: Check unreachability of error function in SV-COMP mode -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2022-09-16 11:42:51,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-16 11:42:51,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-16 11:42:51,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-16 11:42:51,240 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-16 11:42:51,240 INFO L275 PluginConnector]: CDTParser initialized [2022-09-16 11:42:51,241 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-chromosome-trans.wvr.c [2022-09-16 11:42:51,298 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c1577f4e/5c4e9e0cb7e44227b7525c25fb9705a2/FLAG0d94de130 [2022-09-16 11:42:51,757 INFO L306 CDTParser]: Found 1 translation units. [2022-09-16 11:42:51,758 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-trans.wvr.c [2022-09-16 11:42:51,770 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c1577f4e/5c4e9e0cb7e44227b7525c25fb9705a2/FLAG0d94de130 [2022-09-16 11:42:52,150 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c1577f4e/5c4e9e0cb7e44227b7525c25fb9705a2 [2022-09-16 11:42:52,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-16 11:42:52,155 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-16 11:42:52,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-16 11:42:52,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-16 11:42:52,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-16 11:42:52,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 11:42:52" (1/1) ... [2022-09-16 11:42:52,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6343820b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:42:52, skipping insertion in model container [2022-09-16 11:42:52,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 11:42:52" (1/1) ... [2022-09-16 11:42:52,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-16 11:42:52,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-16 11:42:52,479 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-trans.wvr.c[3034,3047] [2022-09-16 11:42:52,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 11:42:52,492 INFO L203 MainTranslator]: Completed pre-run [2022-09-16 11:42:52,512 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-trans.wvr.c[3034,3047] [2022-09-16 11:42:52,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 11:42:52,528 INFO L208 MainTranslator]: Completed translation [2022-09-16 11:42:52,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:42:52 WrapperNode [2022-09-16 11:42:52,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-16 11:42:52,530 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-16 11:42:52,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-16 11:42:52,530 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-16 11:42:52,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:42:52" (1/1) ... [2022-09-16 11:42:52,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:42:52" (1/1) ... [2022-09-16 11:42:52,581 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 16, calls inlined = 24, statements flattened = 337 [2022-09-16 11:42:52,582 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-16 11:42:52,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-16 11:42:52,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-16 11:42:52,583 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-16 11:42:52,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:42:52" (1/1) ... [2022-09-16 11:42:52,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:42:52" (1/1) ... [2022-09-16 11:42:52,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:42:52" (1/1) ... [2022-09-16 11:42:52,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:42:52" (1/1) ... [2022-09-16 11:42:52,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:42:52" (1/1) ... [2022-09-16 11:42:52,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:42:52" (1/1) ... [2022-09-16 11:42:52,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:42:52" (1/1) ... [2022-09-16 11:42:52,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-16 11:42:52,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-16 11:42:52,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-16 11:42:52,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-16 11:42:52,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:42:52" (1/1) ... [2022-09-16 11:42:52,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 11:42:52,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:42:52,647 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-16 11:42:52,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-16 11:42:52,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-16 11:42:52,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-16 11:42:52,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-16 11:42:52,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-16 11:42:52,678 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-09-16 11:42:52,678 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-09-16 11:42:52,678 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-09-16 11:42:52,678 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-09-16 11:42:52,678 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-09-16 11:42:52,678 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-09-16 11:42:52,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-16 11:42:52,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-09-16 11:42:52,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-16 11:42:52,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-16 11:42:52,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-16 11:42:52,680 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-16 11:42:52,856 INFO L234 CfgBuilder]: Building ICFG [2022-09-16 11:42:52,857 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-16 11:42:53,446 INFO L275 CfgBuilder]: Performing block encoding [2022-09-16 11:42:53,471 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-16 11:42:53,471 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-09-16 11:42:53,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 11:42:53 BoogieIcfgContainer [2022-09-16 11:42:53,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-16 11:42:53,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-16 11:42:53,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-16 11:42:53,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-16 11:42:53,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 11:42:52" (1/3) ... [2022-09-16 11:42:53,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7ee64b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 11:42:53, skipping insertion in model container [2022-09-16 11:42:53,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 11:42:52" (2/3) ... [2022-09-16 11:42:53,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7ee64b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 11:42:53, skipping insertion in model container [2022-09-16 11:42:53,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 11:42:53" (3/3) ... [2022-09-16 11:42:53,483 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-trans.wvr.c [2022-09-16 11:42:53,497 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-16 11:42:53,497 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-09-16 11:42:53,497 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-16 11:42:53,621 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-09-16 11:42:53,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 433 places, 460 transitions, 944 flow [2022-09-16 11:42:53,873 INFO L130 PetriNetUnfolder]: 37/457 cut-off events. [2022-09-16 11:42:53,874 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-09-16 11:42:53,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 457 events. 37/457 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1014 event pairs, 0 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 346. Up to 2 conditions per place. [2022-09-16 11:42:53,887 INFO L82 GeneralOperation]: Start removeDead. Operand has 433 places, 460 transitions, 944 flow [2022-09-16 11:42:53,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 410 places, 436 transitions, 887 flow [2022-09-16 11:42:53,923 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-16 11:42:53,930 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@417d38c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-16 11:42:53,930 INFO L358 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2022-09-16 11:42:53,936 INFO L130 PetriNetUnfolder]: 3/62 cut-off events. [2022-09-16 11:42:53,937 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-16 11:42:53,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:42:53,937 INFO L208 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] [2022-09-16 11:42:53,938 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-09-16 11:42:53,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:42:53,943 INFO L85 PathProgramCache]: Analyzing trace with hash -224359022, now seen corresponding path program 1 times [2022-09-16 11:42:53,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:42:53,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008955627] [2022-09-16 11:42:53,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:42:53,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:42:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:42:54,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:42:54,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:42:54,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008955627] [2022-09-16 11:42:54,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008955627] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:42:54,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:42:54,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 11:42:54,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192089075] [2022-09-16 11:42:54,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:42:54,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 11:42:54,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:42:54,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 11:42:54,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 11:42:54,265 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 460 [2022-09-16 11:42:54,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 436 transitions, 887 flow. Second operand has 4 states, 4 states have (on average 396.5) internal successors, (1586), 4 states have internal predecessors, (1586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:54,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:42:54,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 460 [2022-09-16 11:42:54,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:42:54,589 INFO L130 PetriNetUnfolder]: 29/739 cut-off events. [2022-09-16 11:42:54,589 INFO L131 PetriNetUnfolder]: For 18/22 co-relation queries the response was YES. [2022-09-16 11:42:54,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 739 events. 29/739 cut-off events. For 18/22 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3007 event pairs, 0 based on Foata normal form. 56/687 useless extension candidates. Maximal degree in co-relation 633. Up to 44 conditions per place. [2022-09-16 11:42:54,605 INFO L137 encePairwiseOnDemand]: 419/460 looper letters, 58 selfloop transitions, 14 changer transitions 6/446 dead transitions. [2022-09-16 11:42:54,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 446 transitions, 1066 flow [2022-09-16 11:42:54,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 11:42:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-09-16 11:42:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2089 transitions. [2022-09-16 11:42:54,627 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9082608695652173 [2022-09-16 11:42:54,628 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2089 transitions. [2022-09-16 11:42:54,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2089 transitions. [2022-09-16 11:42:54,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:42:54,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2089 transitions. [2022-09-16 11:42:54,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 417.8) internal successors, (2089), 5 states have internal predecessors, (2089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:54,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 460.0) internal successors, (2760), 6 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:54,657 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 460.0) internal successors, (2760), 6 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:54,660 INFO L175 Difference]: Start difference. First operand has 410 places, 436 transitions, 887 flow. Second operand 5 states and 2089 transitions. [2022-09-16 11:42:54,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 446 transitions, 1066 flow [2022-09-16 11:42:54,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 446 transitions, 1048 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-09-16 11:42:54,680 INFO L231 Difference]: Finished difference. Result has 412 places, 420 transitions, 928 flow [2022-09-16 11:42:54,683 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=928, PETRI_PLACES=412, PETRI_TRANSITIONS=420} [2022-09-16 11:42:54,688 INFO L287 CegarLoopForPetriNet]: 410 programPoint places, 2 predicate places. [2022-09-16 11:42:54,688 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 420 transitions, 928 flow [2022-09-16 11:42:54,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 396.5) internal successors, (1586), 4 states have internal predecessors, (1586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:54,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:42:54,689 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:42:54,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-16 11:42:54,690 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-09-16 11:42:54,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:42:54,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1441741562, now seen corresponding path program 1 times [2022-09-16 11:42:54,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:42:54,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056669391] [2022-09-16 11:42:54,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:42:54,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:42:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:42:54,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:42:54,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:42:54,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056669391] [2022-09-16 11:42:54,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056669391] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:42:54,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491803797] [2022-09-16 11:42:54,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:42:54,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:42:54,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:42:54,823 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:42:54,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-09-16 11:42:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:42:54,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 11:42:54,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:42:55,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:42:55,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:42:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:42:55,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491803797] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:42:55,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:42:55,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-09-16 11:42:55,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019607937] [2022-09-16 11:42:55,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:42:55,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-16 11:42:55,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:42:55,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-16 11:42:55,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-09-16 11:42:55,140 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 460 [2022-09-16 11:42:55,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 420 transitions, 928 flow. Second operand has 12 states, 12 states have (on average 397.6666666666667) internal successors, (4772), 12 states have internal predecessors, (4772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:55,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:42:55,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 460 [2022-09-16 11:42:55,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:42:55,869 INFO L130 PetriNetUnfolder]: 71/1711 cut-off events. [2022-09-16 11:42:55,869 INFO L131 PetriNetUnfolder]: For 53/63 co-relation queries the response was YES. [2022-09-16 11:42:55,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1989 conditions, 1711 events. 71/1711 cut-off events. For 53/63 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 10691 event pairs, 0 based on Foata normal form. 9/1480 useless extension candidates. Maximal degree in co-relation 1236. Up to 35 conditions per place. [2022-09-16 11:42:55,909 INFO L137 encePairwiseOnDemand]: 437/460 looper letters, 109 selfloop transitions, 62 changer transitions 0/539 dead transitions. [2022-09-16 11:42:55,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 539 transitions, 1610 flow [2022-09-16 11:42:55,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-16 11:42:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-09-16 11:42:55,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 7290 transitions. [2022-09-16 11:42:55,924 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8804347826086957 [2022-09-16 11:42:55,924 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 7290 transitions. [2022-09-16 11:42:55,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 7290 transitions. [2022-09-16 11:42:55,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:42:55,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 7290 transitions. [2022-09-16 11:42:55,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 405.0) internal successors, (7290), 18 states have internal predecessors, (7290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:55,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 460.0) internal successors, (8740), 19 states have internal predecessors, (8740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:55,962 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 460.0) internal successors, (8740), 19 states have internal predecessors, (8740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:55,962 INFO L175 Difference]: Start difference. First operand has 412 places, 420 transitions, 928 flow. Second operand 18 states and 7290 transitions. [2022-09-16 11:42:55,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 539 transitions, 1610 flow [2022-09-16 11:42:55,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 539 transitions, 1602 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-16 11:42:56,023 INFO L231 Difference]: Finished difference. Result has 426 places, 462 transitions, 1290 flow [2022-09-16 11:42:56,024 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1290, PETRI_PLACES=426, PETRI_TRANSITIONS=462} [2022-09-16 11:42:56,025 INFO L287 CegarLoopForPetriNet]: 410 programPoint places, 16 predicate places. [2022-09-16 11:42:56,025 INFO L495 AbstractCegarLoop]: Abstraction has has 426 places, 462 transitions, 1290 flow [2022-09-16 11:42:56,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 397.6666666666667) internal successors, (4772), 12 states have internal predecessors, (4772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:56,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:42:56,029 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:42:56,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-09-16 11:42:56,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:42:56,258 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-09-16 11:42:56,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:42:56,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1744316519, now seen corresponding path program 1 times [2022-09-16 11:42:56,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:42:56,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007178982] [2022-09-16 11:42:56,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:42:56,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:42:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:42:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:42:56,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:42:56,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007178982] [2022-09-16 11:42:56,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007178982] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:42:56,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336040746] [2022-09-16 11:42:56,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:42:56,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:42:56,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:42:56,342 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:42:56,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-09-16 11:42:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:42:56,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 11:42:56,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:42:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:42:56,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 11:42:56,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336040746] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:42:56,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 11:42:56,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-09-16 11:42:56,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132358811] [2022-09-16 11:42:56,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:42:56,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-16 11:42:56,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:42:56,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-16 11:42:56,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-09-16 11:42:56,486 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 460 [2022-09-16 11:42:56,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 462 transitions, 1290 flow. Second operand has 6 states, 6 states have (on average 397.3333333333333) internal successors, (2384), 6 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:56,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:42:56,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 460 [2022-09-16 11:42:56,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:42:56,936 INFO L130 PetriNetUnfolder]: 71/1699 cut-off events. [2022-09-16 11:42:56,936 INFO L131 PetriNetUnfolder]: For 205/215 co-relation queries the response was YES. [2022-09-16 11:42:56,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2045 conditions, 1699 events. 71/1699 cut-off events. For 205/215 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 10574 event pairs, 0 based on Foata normal form. 12/1471 useless extension candidates. Maximal degree in co-relation 1589. Up to 68 conditions per place. [2022-09-16 11:42:56,982 INFO L137 encePairwiseOnDemand]: 443/460 looper letters, 59 selfloop transitions, 43 changer transitions 0/470 dead transitions. [2022-09-16 11:42:56,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 470 transitions, 1465 flow [2022-09-16 11:42:56,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 11:42:56,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-16 11:42:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2837 transitions. [2022-09-16 11:42:56,989 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.881055900621118 [2022-09-16 11:42:56,989 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2837 transitions. [2022-09-16 11:42:56,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2837 transitions. [2022-09-16 11:42:56,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:42:56,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2837 transitions. [2022-09-16 11:42:56,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 405.2857142857143) internal successors, (2837), 7 states have internal predecessors, (2837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:57,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 460.0) internal successors, (3680), 8 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:57,005 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 460.0) internal successors, (3680), 8 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:57,005 INFO L175 Difference]: Start difference. First operand has 426 places, 462 transitions, 1290 flow. Second operand 7 states and 2837 transitions. [2022-09-16 11:42:57,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 470 transitions, 1465 flow [2022-09-16 11:42:57,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 470 transitions, 1349 flow, removed 41 selfloop flow, removed 5 redundant places. [2022-09-16 11:42:57,053 INFO L231 Difference]: Finished difference. Result has 420 places, 450 transitions, 1179 flow [2022-09-16 11:42:57,054 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1179, PETRI_PLACES=420, PETRI_TRANSITIONS=450} [2022-09-16 11:42:57,056 INFO L287 CegarLoopForPetriNet]: 410 programPoint places, 10 predicate places. [2022-09-16 11:42:57,057 INFO L495 AbstractCegarLoop]: Abstraction has has 420 places, 450 transitions, 1179 flow [2022-09-16 11:42:57,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 397.3333333333333) internal successors, (2384), 6 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:57,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:42:57,058 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:42:57,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-09-16 11:42:57,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-09-16 11:42:57,268 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-09-16 11:42:57,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:42:57,268 INFO L85 PathProgramCache]: Analyzing trace with hash -644450414, now seen corresponding path program 2 times [2022-09-16 11:42:57,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:42:57,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474302598] [2022-09-16 11:42:57,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:42:57,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:42:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:42:57,405 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:42:57,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:42:57,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474302598] [2022-09-16 11:42:57,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474302598] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:42:57,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138756590] [2022-09-16 11:42:57,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:42:57,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:42:57,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:42:57,408 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:42:57,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-09-16 11:42:57,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-16 11:42:57,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:42:57,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-16 11:42:57,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:42:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-09-16 11:42:57,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:42:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-09-16 11:42:57,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138756590] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:42:57,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:42:57,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 17 [2022-09-16 11:42:57,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062213791] [2022-09-16 11:42:57,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:42:57,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-16 11:42:57,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:42:57,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-16 11:42:57,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-09-16 11:42:57,726 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 460 [2022-09-16 11:42:57,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 450 transitions, 1179 flow. Second operand has 18 states, 18 states have (on average 384.0) internal successors, (6912), 18 states have internal predecessors, (6912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:57,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:42:57,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 460 [2022-09-16 11:42:57,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:42:58,558 INFO L130 PetriNetUnfolder]: 85/1999 cut-off events. [2022-09-16 11:42:58,558 INFO L131 PetriNetUnfolder]: For 189/201 co-relation queries the response was YES. [2022-09-16 11:42:58,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2369 conditions, 1999 events. 85/1999 cut-off events. For 189/201 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 13140 event pairs, 0 based on Foata normal form. 3/1714 useless extension candidates. Maximal degree in co-relation 1601. Up to 22 conditions per place. [2022-09-16 11:42:58,603 INFO L137 encePairwiseOnDemand]: 436/460 looper letters, 130 selfloop transitions, 67 changer transitions 0/550 dead transitions. [2022-09-16 11:42:58,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 550 transitions, 1820 flow [2022-09-16 11:42:58,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 11:42:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-09-16 11:42:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 7800 transitions. [2022-09-16 11:42:58,620 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8478260869565217 [2022-09-16 11:42:58,620 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 7800 transitions. [2022-09-16 11:42:58,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 7800 transitions. [2022-09-16 11:42:58,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:42:58,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 7800 transitions. [2022-09-16 11:42:58,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 390.0) internal successors, (7800), 20 states have internal predecessors, (7800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:58,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 460.0) internal successors, (9660), 21 states have internal predecessors, (9660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:58,706 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 460.0) internal successors, (9660), 21 states have internal predecessors, (9660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:58,706 INFO L175 Difference]: Start difference. First operand has 420 places, 450 transitions, 1179 flow. Second operand 20 states and 7800 transitions. [2022-09-16 11:42:58,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 550 transitions, 1820 flow [2022-09-16 11:42:58,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 550 transitions, 1737 flow, removed 0 selfloop flow, removed 9 redundant places. [2022-09-16 11:42:58,719 INFO L231 Difference]: Finished difference. Result has 428 places, 455 transitions, 1253 flow [2022-09-16 11:42:58,720 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1253, PETRI_PLACES=428, PETRI_TRANSITIONS=455} [2022-09-16 11:42:58,721 INFO L287 CegarLoopForPetriNet]: 410 programPoint places, 18 predicate places. [2022-09-16 11:42:58,722 INFO L495 AbstractCegarLoop]: Abstraction has has 428 places, 455 transitions, 1253 flow [2022-09-16 11:42:58,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 384.0) internal successors, (6912), 18 states have internal predecessors, (6912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:58,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:42:58,725 INFO L208 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] [2022-09-16 11:42:58,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-09-16 11:42:58,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:42:58,940 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-09-16 11:42:58,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:42:58,940 INFO L85 PathProgramCache]: Analyzing trace with hash -48192461, now seen corresponding path program 1 times [2022-09-16 11:42:58,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:42:58,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268536566] [2022-09-16 11:42:58,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:42:58,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:42:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:42:59,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 11:42:59,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:42:59,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268536566] [2022-09-16 11:42:59,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268536566] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:42:59,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:42:59,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-09-16 11:42:59,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690698861] [2022-09-16 11:42:59,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:42:59,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-09-16 11:42:59,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:42:59,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-09-16 11:42:59,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-09-16 11:42:59,024 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 460 [2022-09-16 11:42:59,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 455 transitions, 1253 flow. Second operand has 5 states, 5 states have (on average 400.0) internal successors, (2000), 5 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:59,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:42:59,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 460 [2022-09-16 11:42:59,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:42:59,441 INFO L130 PetriNetUnfolder]: 71/1702 cut-off events. [2022-09-16 11:42:59,441 INFO L131 PetriNetUnfolder]: For 245/255 co-relation queries the response was YES. [2022-09-16 11:42:59,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2046 conditions, 1702 events. 71/1702 cut-off events. For 245/255 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 10323 event pairs, 0 based on Foata normal form. 3/1480 useless extension candidates. Maximal degree in co-relation 307. Up to 116 conditions per place. [2022-09-16 11:42:59,464 INFO L137 encePairwiseOnDemand]: 445/460 looper letters, 62 selfloop transitions, 20 changer transitions 0/459 dead transitions. [2022-09-16 11:42:59,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 459 transitions, 1421 flow [2022-09-16 11:42:59,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-16 11:42:59,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-09-16 11:42:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2031 transitions. [2022-09-16 11:42:59,470 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8830434782608696 [2022-09-16 11:42:59,470 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2031 transitions. [2022-09-16 11:42:59,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2031 transitions. [2022-09-16 11:42:59,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:42:59,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2031 transitions. [2022-09-16 11:42:59,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 406.2) internal successors, (2031), 5 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:59,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 460.0) internal successors, (2760), 6 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:59,479 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 460.0) internal successors, (2760), 6 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:59,479 INFO L175 Difference]: Start difference. First operand has 428 places, 455 transitions, 1253 flow. Second operand 5 states and 2031 transitions. [2022-09-16 11:42:59,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 459 transitions, 1421 flow [2022-09-16 11:42:59,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 459 transitions, 1277 flow, removed 7 selfloop flow, removed 15 redundant places. [2022-09-16 11:42:59,489 INFO L231 Difference]: Finished difference. Result has 418 places, 453 transitions, 1147 flow [2022-09-16 11:42:59,490 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1147, PETRI_PLACES=418, PETRI_TRANSITIONS=453} [2022-09-16 11:42:59,492 INFO L287 CegarLoopForPetriNet]: 410 programPoint places, 8 predicate places. [2022-09-16 11:42:59,493 INFO L495 AbstractCegarLoop]: Abstraction has has 418 places, 453 transitions, 1147 flow [2022-09-16 11:42:59,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 400.0) internal successors, (2000), 5 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:59,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:42:59,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:42:59,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-16 11:42:59,494 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-09-16 11:42:59,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:42:59,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1398708487, now seen corresponding path program 1 times [2022-09-16 11:42:59,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:42:59,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754722064] [2022-09-16 11:42:59,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:42:59,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:42:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:42:59,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-16 11:42:59,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:42:59,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754722064] [2022-09-16 11:42:59,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754722064] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:42:59,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483833742] [2022-09-16 11:42:59,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:42:59,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:42:59,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:42:59,628 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:42:59,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-09-16 11:42:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:42:59,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 6 conjunts are in the unsatisfiable core [2022-09-16 11:42:59,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:42:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-16 11:42:59,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:42:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-16 11:42:59,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483833742] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:42:59,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:42:59,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-09-16 11:42:59,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668668330] [2022-09-16 11:42:59,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:42:59,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-09-16 11:42:59,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:42:59,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-09-16 11:42:59,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-09-16 11:42:59,933 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 460 [2022-09-16 11:42:59,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 453 transitions, 1147 flow. Second operand has 15 states, 15 states have (on average 384.6666666666667) internal successors, (5770), 15 states have internal predecessors, (5770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:42:59,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:42:59,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 460 [2022-09-16 11:42:59,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:43:00,393 INFO L130 PetriNetUnfolder]: 43/1108 cut-off events. [2022-09-16 11:43:00,393 INFO L131 PetriNetUnfolder]: For 73/79 co-relation queries the response was YES. [2022-09-16 11:43:00,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 1108 events. 43/1108 cut-off events. For 73/79 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5160 event pairs, 0 based on Foata normal form. 6/979 useless extension candidates. Maximal degree in co-relation 960. Up to 60 conditions per place. [2022-09-16 11:43:00,410 INFO L137 encePairwiseOnDemand]: 436/460 looper letters, 77 selfloop transitions, 46 changer transitions 0/476 dead transitions. [2022-09-16 11:43:00,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 476 transitions, 1449 flow [2022-09-16 11:43:00,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-16 11:43:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-16 11:43:00,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4281 transitions. [2022-09-16 11:43:00,419 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8460474308300395 [2022-09-16 11:43:00,419 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 4281 transitions. [2022-09-16 11:43:00,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 4281 transitions. [2022-09-16 11:43:00,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:43:00,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 4281 transitions. [2022-09-16 11:43:00,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 389.1818181818182) internal successors, (4281), 11 states have internal predecessors, (4281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:43:00,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 460.0) internal successors, (5520), 12 states have internal predecessors, (5520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:43:00,436 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 460.0) internal successors, (5520), 12 states have internal predecessors, (5520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:43:00,436 INFO L175 Difference]: Start difference. First operand has 418 places, 453 transitions, 1147 flow. Second operand 11 states and 4281 transitions. [2022-09-16 11:43:00,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 476 transitions, 1449 flow [2022-09-16 11:43:00,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 476 transitions, 1417 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-09-16 11:43:00,445 INFO L231 Difference]: Finished difference. Result has 427 places, 452 transitions, 1260 flow [2022-09-16 11:43:00,446 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=1087, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1260, PETRI_PLACES=427, PETRI_TRANSITIONS=452} [2022-09-16 11:43:00,449 INFO L287 CegarLoopForPetriNet]: 410 programPoint places, 17 predicate places. [2022-09-16 11:43:00,449 INFO L495 AbstractCegarLoop]: Abstraction has has 427 places, 452 transitions, 1260 flow [2022-09-16 11:43:00,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 384.6666666666667) internal successors, (5770), 15 states have internal predecessors, (5770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:43:00,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:43:00,451 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:43:00,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-09-16 11:43:00,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:43:00,668 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-09-16 11:43:00,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:43:00,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1989538553, now seen corresponding path program 2 times [2022-09-16 11:43:00,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:43:00,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990125544] [2022-09-16 11:43:00,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:43:00,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:43:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:43:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-09-16 11:43:00,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:43:00,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990125544] [2022-09-16 11:43:00,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990125544] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:43:00,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467941377] [2022-09-16 11:43:00,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 11:43:00,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:43:00,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:43:00,800 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:43:00,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-09-16 11:43:00,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 11:43:00,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:43:00,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 10 conjunts are in the unsatisfiable core [2022-09-16 11:43:00,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:43:01,105 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-09-16 11:43:01,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:43:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-09-16 11:43:01,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467941377] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:43:01,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:43:01,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-09-16 11:43:01,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969054860] [2022-09-16 11:43:01,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:43:01,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-09-16 11:43:01,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:43:01,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-09-16 11:43:01,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2022-09-16 11:43:01,254 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 460 [2022-09-16 11:43:01,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 452 transitions, 1260 flow. Second operand has 22 states, 22 states have (on average 386.72727272727275) internal successors, (8508), 22 states have internal predecessors, (8508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:43:01,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:43:01,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 460 [2022-09-16 11:43:01,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:43:01,780 INFO L130 PetriNetUnfolder]: 15/514 cut-off events. [2022-09-16 11:43:01,780 INFO L131 PetriNetUnfolder]: For 154/156 co-relation queries the response was YES. [2022-09-16 11:43:01,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 514 events. 15/514 cut-off events. For 154/156 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 903 event pairs, 0 based on Foata normal form. 6/475 useless extension candidates. Maximal degree in co-relation 296. Up to 28 conditions per place. [2022-09-16 11:43:01,786 INFO L137 encePairwiseOnDemand]: 436/460 looper letters, 86 selfloop transitions, 51 changer transitions 0/490 dead transitions. [2022-09-16 11:43:01,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 490 transitions, 1650 flow [2022-09-16 11:43:01,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-09-16 11:43:01,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-09-16 11:43:01,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 6603 transitions. [2022-09-16 11:43:01,797 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8443734015345269 [2022-09-16 11:43:01,798 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 6603 transitions. [2022-09-16 11:43:01,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 6603 transitions. [2022-09-16 11:43:01,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:43:01,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 6603 transitions. [2022-09-16 11:43:01,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 388.4117647058824) internal successors, (6603), 17 states have internal predecessors, (6603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:43:01,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 460.0) internal successors, (8280), 18 states have internal predecessors, (8280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:43:01,823 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 460.0) internal successors, (8280), 18 states have internal predecessors, (8280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:43:01,823 INFO L175 Difference]: Start difference. First operand has 427 places, 452 transitions, 1260 flow. Second operand 17 states and 6603 transitions. [2022-09-16 11:43:01,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 490 transitions, 1650 flow [2022-09-16 11:43:01,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 490 transitions, 1568 flow, removed 9 selfloop flow, removed 9 redundant places. [2022-09-16 11:43:01,833 INFO L231 Difference]: Finished difference. Result has 436 places, 448 transitions, 1294 flow [2022-09-16 11:43:01,833 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=1165, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1294, PETRI_PLACES=436, PETRI_TRANSITIONS=448} [2022-09-16 11:43:01,834 INFO L287 CegarLoopForPetriNet]: 410 programPoint places, 26 predicate places. [2022-09-16 11:43:01,834 INFO L495 AbstractCegarLoop]: Abstraction has has 436 places, 448 transitions, 1294 flow [2022-09-16 11:43:01,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 386.72727272727275) internal successors, (8508), 22 states have internal predecessors, (8508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:43:01,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:43:01,837 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:43:01,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-09-16 11:43:02,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:43:02,052 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-09-16 11:43:02,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:43:02,052 INFO L85 PathProgramCache]: Analyzing trace with hash -2013929209, now seen corresponding path program 3 times [2022-09-16 11:43:02,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:43:02,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894283184] [2022-09-16 11:43:02,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:43:02,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:43:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:43:03,480 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 2 proven. 207 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-09-16 11:43:03,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:43:03,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894283184] [2022-09-16 11:43:03,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894283184] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:43:03,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551415674] [2022-09-16 11:43:03,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-16 11:43:03,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:43:03,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:43:03,484 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) [2022-09-16 11:43:03,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-09-16 11:43:03,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-09-16 11:43:03,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 11:43:03,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 64 conjunts are in the unsatisfiable core [2022-09-16 11:43:03,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:43:04,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 11:43:04,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-16 11:43:04,467 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-09-16 11:43:04,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2022-09-16 11:43:04,789 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-09-16 11:43:04,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-09-16 11:43:05,091 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-09-16 11:43:05,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-09-16 11:43:05,347 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-09-16 11:43:05,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-09-16 11:43:05,866 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:43:05,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 11:43:06,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 11:43:06,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 11:43:06,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 11:43:06,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 11:43:06,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 11:43:06,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:43:06,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 11:43:06,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-16 11:43:06,526 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-09-16 11:43:06,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:43:06,696 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_317 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_317) c_~o_2~0.base) c_~o_2~0.offset) 9223372039002259456)) is different from false [2022-09-16 11:43:06,769 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_316 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_316) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_317) c_~o_2~0.base) c_~o_2~0.offset) 9223372039002259456)) is different from false [2022-09-16 11:43:06,957 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_316 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc31#1.base| v_ArrVal_316) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_317) c_~o_2~0.base) c_~o_2~0.offset) 9223372039002259456)) is different from false [2022-09-16 11:43:21,447 INFO L356 Elim1Store]: treesize reduction 280, result has 34.1 percent of original size [2022-09-16 11:43:21,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 158 [2022-09-16 11:43:21,500 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:43:21,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 184 treesize of output 260 [2022-09-16 11:43:21,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2022-09-16 11:43:21,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-09-16 11:43:22,224 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:43:22,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 33 [2022-09-16 11:43:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 161 trivial. 29 not checked. [2022-09-16 11:43:22,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551415674] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:43:22,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:43:22,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 30, 33] total 93 [2022-09-16 11:43:22,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629914599] [2022-09-16 11:43:22,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:43:22,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2022-09-16 11:43:22,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:43:22,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2022-09-16 11:43:22,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=7551, Unknown=111, NotChecked=540, Total=8742 [2022-09-16 11:43:22,511 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 460 [2022-09-16 11:43:22,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 448 transitions, 1294 flow. Second operand has 94 states, 94 states have (on average 308.1595744680851) internal successors, (28967), 94 states have internal predecessors, (28967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:43:22,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:43:22,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 460 [2022-09-16 11:43:22,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:43:36,344 INFO L130 PetriNetUnfolder]: 5809/25257 cut-off events. [2022-09-16 11:43:36,344 INFO L131 PetriNetUnfolder]: For 228/660 co-relation queries the response was YES. [2022-09-16 11:43:36,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33598 conditions, 25257 events. 5809/25257 cut-off events. For 228/660 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 320001 event pairs, 1019 based on Foata normal form. 6/20288 useless extension candidates. Maximal degree in co-relation 32894. Up to 1864 conditions per place. [2022-09-16 11:43:36,680 INFO L137 encePairwiseOnDemand]: 413/460 looper letters, 337 selfloop transitions, 107 changer transitions 0/725 dead transitions. [2022-09-16 11:43:36,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 725 transitions, 2845 flow [2022-09-16 11:43:36,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-09-16 11:43:36,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2022-09-16 11:43:36,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 24141 transitions. [2022-09-16 11:43:36,864 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6728260869565217 [2022-09-16 11:43:36,865 INFO L72 ComplementDD]: Start complementDD. Operand 78 states and 24141 transitions. [2022-09-16 11:43:36,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 24141 transitions. [2022-09-16 11:43:36,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:43:36,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 78 states and 24141 transitions. [2022-09-16 11:43:36,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 79 states, 78 states have (on average 309.5) internal successors, (24141), 78 states have internal predecessors, (24141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:43:36,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 79 states, 79 states have (on average 460.0) internal successors, (36340), 79 states have internal predecessors, (36340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:43:37,045 INFO L81 ComplementDD]: Finished complementDD. Result has 79 states, 79 states have (on average 460.0) internal successors, (36340), 79 states have internal predecessors, (36340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:43:37,046 INFO L175 Difference]: Start difference. First operand has 436 places, 448 transitions, 1294 flow. Second operand 78 states and 24141 transitions. [2022-09-16 11:43:37,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 513 places, 725 transitions, 2845 flow [2022-09-16 11:43:37,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 725 transitions, 2737 flow, removed 0 selfloop flow, removed 16 redundant places. [2022-09-16 11:43:37,075 INFO L231 Difference]: Finished difference. Result has 517 places, 507 transitions, 1694 flow [2022-09-16 11:43:37,076 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=1192, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=1694, PETRI_PLACES=517, PETRI_TRANSITIONS=507} [2022-09-16 11:43:37,078 INFO L287 CegarLoopForPetriNet]: 410 programPoint places, 107 predicate places. [2022-09-16 11:43:37,078 INFO L495 AbstractCegarLoop]: Abstraction has has 517 places, 507 transitions, 1694 flow [2022-09-16 11:43:37,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 308.1595744680851) internal successors, (28967), 94 states have internal predecessors, (28967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:43:37,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:43:37,085 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:43:37,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-09-16 11:43:37,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:43:37,286 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-09-16 11:43:37,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:43:37,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1992705105, now seen corresponding path program 1 times [2022-09-16 11:43:37,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:43:37,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672739429] [2022-09-16 11:43:37,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:43:37,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:43:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:43:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2022-09-16 11:43:37,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:43:37,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672739429] [2022-09-16 11:43:37,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672739429] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 11:43:37,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 11:43:37,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 11:43:37,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005243024] [2022-09-16 11:43:37,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 11:43:37,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 11:43:37,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:43:37,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 11:43:37,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-09-16 11:43:37,513 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 460 [2022-09-16 11:43:37,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 507 transitions, 1694 flow. Second operand has 4 states, 4 states have (on average 409.75) internal successors, (1639), 4 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:43:37,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:43:37,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 460 [2022-09-16 11:43:37,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:43:38,540 INFO L130 PetriNetUnfolder]: 242/2654 cut-off events. [2022-09-16 11:43:38,540 INFO L131 PetriNetUnfolder]: For 491/493 co-relation queries the response was YES. [2022-09-16 11:43:38,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3895 conditions, 2654 events. 242/2654 cut-off events. For 491/493 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 20343 event pairs, 60 based on Foata normal form. 16/2285 useless extension candidates. Maximal degree in co-relation 3711. Up to 211 conditions per place. [2022-09-16 11:43:38,601 INFO L137 encePairwiseOnDemand]: 453/460 looper letters, 47 selfloop transitions, 8 changer transitions 0/519 dead transitions. [2022-09-16 11:43:38,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 519 transitions, 1824 flow [2022-09-16 11:43:38,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 11:43:38,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-09-16 11:43:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1677 transitions. [2022-09-16 11:43:38,604 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9114130434782609 [2022-09-16 11:43:38,604 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1677 transitions. [2022-09-16 11:43:38,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1677 transitions. [2022-09-16 11:43:38,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:43:38,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1677 transitions. [2022-09-16 11:43:38,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 419.25) internal successors, (1677), 4 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:43:38,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 460.0) internal successors, (2300), 5 states have internal predecessors, (2300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:43:38,610 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 460.0) internal successors, (2300), 5 states have internal predecessors, (2300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:43:38,610 INFO L175 Difference]: Start difference. First operand has 517 places, 507 transitions, 1694 flow. Second operand 4 states and 1677 transitions. [2022-09-16 11:43:38,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 519 transitions, 1824 flow [2022-09-16 11:43:38,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 519 transitions, 1771 flow, removed 6 selfloop flow, removed 17 redundant places. [2022-09-16 11:43:38,624 INFO L231 Difference]: Finished difference. Result has 505 places, 506 transitions, 1671 flow [2022-09-16 11:43:38,625 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=1611, PETRI_DIFFERENCE_MINUEND_PLACES=499, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1671, PETRI_PLACES=505, PETRI_TRANSITIONS=506} [2022-09-16 11:43:38,625 INFO L287 CegarLoopForPetriNet]: 410 programPoint places, 95 predicate places. [2022-09-16 11:43:38,625 INFO L495 AbstractCegarLoop]: Abstraction has has 505 places, 506 transitions, 1671 flow [2022-09-16 11:43:38,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 409.75) internal successors, (1639), 4 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:43:38,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:43:38,626 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:43:38,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-16 11:43:38,627 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-09-16 11:43:38,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:43:38,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1784586426, now seen corresponding path program 1 times [2022-09-16 11:43:38,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:43:38,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114743851] [2022-09-16 11:43:38,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:43:38,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:43:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:43:39,676 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 27 proven. 97 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-09-16 11:43:39,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:43:39,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114743851] [2022-09-16 11:43:39,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114743851] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:43:39,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829206187] [2022-09-16 11:43:39,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:43:39,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:43:39,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:43:39,678 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) [2022-09-16 11:43:39,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-09-16 11:43:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:43:39,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 59 conjunts are in the unsatisfiable core [2022-09-16 11:43:39,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:43:40,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 11:43:40,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-16 11:43:40,449 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:43:40,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 11:43:40,613 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:43:40,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 11:43:40,763 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:43:40,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 11:43:40,925 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:43:40,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 11:43:41,245 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 11:43:41,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-16 11:43:41,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 11:43:41,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 11:43:41,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 11:43:41,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 11:43:41,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 11:43:41,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:43:41,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 11:43:41,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:43:41,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 11:43:41,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-16 11:43:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 48 proven. 76 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-09-16 11:43:41,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:43:42,112 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_471 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_471) c_~o_2~0.base) c_~o_2~0.offset) 9223372039002259456)) is different from false [2022-09-16 11:43:42,140 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_470 (Array Int Int)) (v_ArrVal_471 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_470) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_471) c_~o_2~0.base) c_~o_2~0.offset) 9223372039002259456)) is different from false [2022-09-16 11:43:42,203 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_470 (Array Int Int)) (v_ArrVal_471 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_470) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_471) c_~o_2~0.base) c_~o_2~0.offset) 9223372039002259456)) is different from false [2022-09-16 11:43:42,313 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_470 (Array Int Int)) (v_ArrVal_471 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc31#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_470) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_471) c_~o_2~0.base) c_~o_2~0.offset) 9223372039002259456)) is different from false [2022-09-16 11:43:46,689 INFO L356 Elim1Store]: treesize reduction 364, result has 14.4 percent of original size [2022-09-16 11:43:46,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 77 [2022-09-16 11:43:46,714 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:43:46,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 490 treesize of output 476 [2022-09-16 11:43:46,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 462 treesize of output 430 [2022-09-16 11:43:46,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 207 [2022-09-16 11:43:46,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 422 treesize of output 406 [2022-09-16 11:43:47,443 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:43:47,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2022-09-16 11:43:47,846 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 4 proven. 53 refuted. 38 times theorem prover too weak. 161 trivial. 29 not checked. [2022-09-16 11:43:47,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829206187] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:43:47,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:43:47,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 32] total 83 [2022-09-16 11:43:47,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987445237] [2022-09-16 11:43:47,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:43:47,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-09-16 11:43:47,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:43:47,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-09-16 11:43:47,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=5726, Unknown=156, NotChecked=636, Total=6972 [2022-09-16 11:43:47,888 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 460 [2022-09-16 11:43:47,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 506 transitions, 1671 flow. Second operand has 84 states, 84 states have (on average 318.8452380952381) internal successors, (26783), 84 states have internal predecessors, (26783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:43:47,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:43:47,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 460 [2022-09-16 11:43:47,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:44:02,457 INFO L130 PetriNetUnfolder]: 9299/45461 cut-off events. [2022-09-16 11:44:02,458 INFO L131 PetriNetUnfolder]: For 6581/6584 co-relation queries the response was YES. [2022-09-16 11:44:03,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62622 conditions, 45461 events. 9299/45461 cut-off events. For 6581/6584 co-relation queries the response was YES. Maximal size of possible extension queue 1175. Compared 659291 event pairs, 844 based on Foata normal form. 25/37773 useless extension candidates. Maximal degree in co-relation 62385. Up to 3310 conditions per place. [2022-09-16 11:44:03,679 INFO L137 encePairwiseOnDemand]: 412/460 looper letters, 356 selfloop transitions, 119 changer transitions 0/769 dead transitions. [2022-09-16 11:44:03,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 769 transitions, 3521 flow [2022-09-16 11:44:03,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-09-16 11:44:03,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-09-16 11:44:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 16162 transitions. [2022-09-16 11:44:03,695 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.702695652173913 [2022-09-16 11:44:03,695 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 16162 transitions. [2022-09-16 11:44:03,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 16162 transitions. [2022-09-16 11:44:03,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-16 11:44:03,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 16162 transitions. [2022-09-16 11:44:03,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 323.24) internal successors, (16162), 50 states have internal predecessors, (16162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:44:03,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 460.0) internal successors, (23460), 51 states have internal predecessors, (23460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:44:03,753 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 460.0) internal successors, (23460), 51 states have internal predecessors, (23460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:44:03,753 INFO L175 Difference]: Start difference. First operand has 505 places, 506 transitions, 1671 flow. Second operand 50 states and 16162 transitions. [2022-09-16 11:44:03,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 769 transitions, 3521 flow [2022-09-16 11:44:03,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 769 transitions, 3521 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-09-16 11:44:03,806 INFO L231 Difference]: Finished difference. Result has 570 places, 542 transitions, 2280 flow [2022-09-16 11:44:03,808 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=1671, PETRI_DIFFERENCE_MINUEND_PLACES=505, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=2280, PETRI_PLACES=570, PETRI_TRANSITIONS=542} [2022-09-16 11:44:03,809 INFO L287 CegarLoopForPetriNet]: 410 programPoint places, 160 predicate places. [2022-09-16 11:44:03,809 INFO L495 AbstractCegarLoop]: Abstraction has has 570 places, 542 transitions, 2280 flow [2022-09-16 11:44:03,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 318.8452380952381) internal successors, (26783), 84 states have internal predecessors, (26783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:44:03,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-16 11:44:03,814 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 11:44:03,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-09-16 11:44:04,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:44:04,033 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-09-16 11:44:04,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 11:44:04,034 INFO L85 PathProgramCache]: Analyzing trace with hash 129991343, now seen corresponding path program 1 times [2022-09-16 11:44:04,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 11:44:04,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346233506] [2022-09-16 11:44:04,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:44:04,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 11:44:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:44:04,683 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 11 proven. 79 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-09-16 11:44:04,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 11:44:04,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346233506] [2022-09-16 11:44:04,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346233506] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 11:44:04,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259773605] [2022-09-16 11:44:04,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 11:44:04,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 11:44:04,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 11:44:04,685 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 11:44:04,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-09-16 11:44:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 11:44:04,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 46 conjunts are in the unsatisfiable core [2022-09-16 11:44:04,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 11:44:05,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-16 11:44:05,470 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:44:05,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 11:44:05,579 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:44:05,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 11:44:05,691 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:44:05,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 11:44:05,880 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-09-16 11:44:05,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-09-16 11:44:06,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:44:06,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 11:44:06,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 11:44:06,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 11:44:06,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-16 11:44:06,187 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 48 proven. 47 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-09-16 11:44:06,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 11:44:06,326 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_575 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~o_4~0.base) c_~o_4~0.offset) 9223372039002259456)) is different from false [2022-09-16 11:44:06,336 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) c_~o_4~0.base) c_~o_4~0.offset) 9223372039002259456)) is different from false [2022-09-16 11:44:06,360 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_main_#t~ret18#1.base|) |c_ULTIMATE.start_main_#t~ret18#1.offset|) 9223372039002259456)) is different from false [2022-09-16 11:44:06,365 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 9223372039002259456)) is different from false [2022-09-16 11:44:06,369 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) is different from false [2022-09-16 11:44:06,393 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_573 Int) (v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (< (select (select (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|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)) is different from false [2022-09-16 11:44:06,407 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post32#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88|)) (forall ((v_ArrVal_573 Int) (v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (< (select (select (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|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)))) is different from false [2022-09-16 11:44:06,429 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_573 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (or (< (select (select (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|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) is different from false [2022-09-16 11:44:06,447 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_573 Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_571) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) is different from false [2022-09-16 11:44:06,483 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| Int)) (or (forall ((v_ArrVal_573 Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_571) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 1)))) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post32#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89|)))) is different from false [2022-09-16 11:44:06,515 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_573 Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_575 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| Int) (v_ArrVal_574 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_571) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 1)))) is different from false [2022-09-16 11:44:06,536 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_573 Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_575 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| Int) (v_ArrVal_574 (Array Int Int)) (v_ArrVal_568 Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_568) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_571) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 1)))) is different from false [2022-09-16 11:44:06,582 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post32#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90|)) (forall ((v_ArrVal_573 Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_575 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| Int) (v_ArrVal_574 (Array Int Int)) (v_ArrVal_568 Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_568) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_571) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 1)))))) is different from false [2022-09-16 11:44:06,630 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_573 Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_575 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| Int) (v_ArrVal_574 (Array Int Int)) (v_ArrVal_568 Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_568) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_571) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 1)))) is different from false [2022-09-16 11:44:06,662 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_566 Int) (v_ArrVal_573 Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_575 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| Int) (v_ArrVal_574 (Array Int Int)) (v_ArrVal_568 Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| 1)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_566) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_568) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_571) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 1)))) is different from false [2022-09-16 11:44:06,719 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post32#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91|)) (forall ((v_ArrVal_566 Int) (v_ArrVal_573 Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_575 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| Int) (v_ArrVal_574 (Array Int Int)) (v_ArrVal_568 Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_566) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_568) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_571) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 1)))))) is different from false [2022-09-16 11:44:06,791 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_566 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| Int) (v_ArrVal_573 Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_575 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| Int) (v_ArrVal_574 (Array Int Int)) (v_ArrVal_568 Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_566) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_568) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_571) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 1)))) is different from false [2022-09-16 11:44:06,896 INFO L356 Elim1Store]: treesize reduction 364, result has 14.4 percent of original size [2022-09-16 11:44:06,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 74 [2022-09-16 11:44:06,905 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 11:44:06,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 120 [2022-09-16 11:44:06,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2022-09-16 11:44:06,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2022-09-16 11:44:07,526 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 95 not checked. [2022-09-16 11:44:07,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259773605] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 11:44:07,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 11:44:07,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 29] total 74 [2022-09-16 11:44:07,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89387742] [2022-09-16 11:44:07,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 11:44:07,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-09-16 11:44:07,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 11:44:07,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-09-16 11:44:07,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=3069, Unknown=17, NotChecked=2176, Total=5550 [2022-09-16 11:44:07,538 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 460 [2022-09-16 11:44:07,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 542 transitions, 2280 flow. Second operand has 75 states, 75 states have (on average 322.72) internal successors, (24204), 75 states have internal predecessors, (24204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 11:44:07,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-16 11:44:07,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 460 [2022-09-16 11:44:07,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-16 11:44:10,180 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= |c_ULTIMATE.start_create_fresh_int_array_#t~nondet33#1| 2147483647) (forall ((v_ArrVal_566 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| Int) (v_ArrVal_573 Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_575 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| Int) (v_ArrVal_574 (Array Int Int)) (v_ArrVal_568 Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_566) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_568) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_571) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 1)))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:44:10,687 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (forall ((v_ArrVal_566 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| Int) (v_ArrVal_573 Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_575 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| Int) (v_ArrVal_574 (Array Int Int)) (v_ArrVal_568 Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_566) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_568) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_571) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 1)))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:44:12,691 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 0 |c_ULTIMATE.start_create_fresh_int_array_#t~post32#1|) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select .cse1 0) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483647) (= |c_ULTIMATE.start_create_fresh_int_array_#t~post32#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post32#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91|)) (forall ((v_ArrVal_566 Int) (v_ArrVal_573 Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_575 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| Int) (v_ArrVal_574 (Array Int Int)) (v_ArrVal_568 Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_566) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_568) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_571) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_91| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 1)))))))) is different from false [2022-09-16 11:44:13,329 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (<= (select .cse2 0) 2147483647)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= |c_ULTIMATE.start_create_fresh_int_array_#t~nondet33#1| 2147483647) (or (= (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) .cse0) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((v_ArrVal_573 Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_575 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| Int) (v_ArrVal_574 (Array Int Int)) (v_ArrVal_568 Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_568) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_571) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 1)))) (<= (+ (div (* (- 1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 1) |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483647) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))))) is different from false [2022-09-16 11:44:13,786 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((v_ArrVal_573 Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_575 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| Int) (v_ArrVal_574 (Array Int Int)) (v_ArrVal_568 Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_568) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_571) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 1)))) (<= (+ (div (* (- 1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 1) |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select .cse1 0) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483647) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:44:15,790 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post32#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90|)) (forall ((v_ArrVal_573 Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_575 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| Int) (v_ArrVal_574 (Array Int Int)) (v_ArrVal_568 Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_568) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_571) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_90| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 1)))))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ (div (* (- 1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 1) |c_ULTIMATE.start_create_fresh_int_array_#t~post32#1|) (<= (select .cse1 0) 2147483647) (<= 1 |c_ULTIMATE.start_create_fresh_int_array_#t~post32#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483647) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:44:16,211 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= (+ (div (* (- 1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 2) |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select .cse1 0) 2147483647) (forall ((v_ArrVal_573 Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_575 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| Int) (v_ArrVal_574 (Array Int Int)) (v_ArrVal_568 Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_568) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_571) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 1)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483647) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:44:16,658 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (<= (select .cse2 0) 2147483647)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= |c_ULTIMATE.start_create_fresh_int_array_#t~nondet33#1| 2147483647) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= (+ (div (* (- 1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 2) |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (or (= (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) .cse0) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 (forall ((v_ArrVal_573 Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_575 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| Int) (v_ArrVal_574 (Array Int Int)) (v_ArrVal_568 Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_568) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_571) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 1)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483647) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))))) is different from false [2022-09-16 11:44:17,119 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= (+ (div (* (- 1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 2) |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (select .cse1 0) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483647) (forall ((v_ArrVal_573 Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_575 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| Int) (v_ArrVal_574 (Array Int Int))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_571) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 1)))) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:44:19,123 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ (div (* (- 1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 2) |c_ULTIMATE.start_create_fresh_int_array_#t~post32#1|) (<= (select .cse1 0) 2147483647) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_#t~post32#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483647) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| Int)) (or (forall ((v_ArrVal_573 Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_571) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89| 1)))) (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post32#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_89|)))) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:44:21,526 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (<= (select .cse2 0) 2147483647)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= |c_ULTIMATE.start_create_fresh_int_array_#t~nondet33#1| 2147483647) (<= (+ (div (* (- 1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 2) |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (or (= (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) .cse0) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((v_ArrVal_573 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (or (< (select (select (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|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 3 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) .cse0 (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483647) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))))) is different from false [2022-09-16 11:44:21,893 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= (+ (div (* (- 1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 2) |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((v_ArrVal_573 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int) (v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (or (< (select (select (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|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)))) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 3 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= (select .cse1 0) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483647) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-09-16 11:44:23,897 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ (div (* (- 1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 2) |c_ULTIMATE.start_create_fresh_int_array_#t~post32#1|) (<= (select .cse1 0) 2147483647) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post32#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88|)) (forall ((v_ArrVal_573 Int) (v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (< (select (select (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|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_88| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_573)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= 3 |c_ULTIMATE.start_create_fresh_int_array_#t~post32#1|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483647) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false