./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:47:54,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:47:54,759 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:47:54,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:47:54,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:47:54,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:47:54,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:47:54,811 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:47:54,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:47:54,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:47:54,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:47:54,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:47:54,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:47:54,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:47:54,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:47:54,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:47:54,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:47:54,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:47:54,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:47:54,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:47:54,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:47:54,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:47:54,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:47:54,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:47:54,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:47:54,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:47:54,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:47:54,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:47:54,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:47:54,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:47:54,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:47:54,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:47:54,883 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:47:54,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:47:54,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:47:54,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:47:54,888 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:47:54,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:47:54,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:47:54,891 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:47:54,892 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:47:54,893 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-16 12:47:54,947 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:47:54,947 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:47:54,948 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:47:54,948 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:47:54,949 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:47:54,949 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:47:54,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:47:54,951 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:47:54,951 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:47:54,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:47:54,952 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:47:54,952 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:47:54,952 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:47:54,953 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:47:54,953 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:47:54,953 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:47:54,953 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:47:54,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:47:54,954 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-16 12:47:54,954 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:47:54,955 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:47:54,955 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:47:54,955 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:47:54,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:47:54,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:47:54,956 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:47:54,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:47:54,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:47:54,957 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:47:54,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:47:54,958 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:47:54,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:47:54,959 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:47:54,959 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:47:54,959 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:47:54,959 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f [2022-11-16 12:47:55,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:47:55,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:47:55,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:47:55,349 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:47:55,350 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:47:55,351 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2022-11-16 12:47:55,423 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/data/ef14e207e/246b1aa1deda46fbb354f76603582590/FLAGb2a947207 [2022-11-16 12:47:56,012 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:47:56,012 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2022-11-16 12:47:56,037 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/data/ef14e207e/246b1aa1deda46fbb354f76603582590/FLAGb2a947207 [2022-11-16 12:47:56,276 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/data/ef14e207e/246b1aa1deda46fbb354f76603582590 [2022-11-16 12:47:56,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:47:56,280 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:47:56,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:47:56,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:47:56,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:47:56,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:47:56" (1/1) ... [2022-11-16 12:47:56,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@92f6631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:56, skipping insertion in model container [2022-11-16 12:47:56,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:47:56" (1/1) ... [2022-11-16 12:47:56,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:47:56,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:47:56,948 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2022-11-16 12:47:56,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:47:56,997 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:47:57,039 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2022-11-16 12:47:57,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:47:57,123 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:47:57,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:57 WrapperNode [2022-11-16 12:47:57,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:47:57,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:47:57,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:47:57,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:47:57,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:57" (1/1) ... [2022-11-16 12:47:57,157 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:57" (1/1) ... [2022-11-16 12:47:57,190 INFO L138 Inliner]: procedures = 271, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 266 [2022-11-16 12:47:57,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:47:57,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:47:57,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:47:57,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:47:57,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:57" (1/1) ... [2022-11-16 12:47:57,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:57" (1/1) ... [2022-11-16 12:47:57,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:57" (1/1) ... [2022-11-16 12:47:57,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:57" (1/1) ... [2022-11-16 12:47:57,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:57" (1/1) ... [2022-11-16 12:47:57,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:57" (1/1) ... [2022-11-16 12:47:57,230 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:57" (1/1) ... [2022-11-16 12:47:57,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:57" (1/1) ... [2022-11-16 12:47:57,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:47:57,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:47:57,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:47:57,238 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:47:57,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:57" (1/1) ... [2022-11-16 12:47:57,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:47:57,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:47:57,278 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:47:57,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:47:57,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:47:57,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:47:57,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:47:57,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:47:57,351 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-16 12:47:57,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:47:57,353 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-16 12:47:57,353 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-16 12:47:57,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:47:57,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:47:57,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:47:57,356 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:47:57,635 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:47:57,640 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:47:58,220 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:47:58,231 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:47:58,231 INFO L300 CfgBuilder]: Removed 35 assume(true) statements. [2022-11-16 12:47:58,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:47:58 BoogieIcfgContainer [2022-11-16 12:47:58,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:47:58,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:47:58,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:47:58,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:47:58,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:47:56" (1/3) ... [2022-11-16 12:47:58,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495ce8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:47:58, skipping insertion in model container [2022-11-16 12:47:58,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:57" (2/3) ... [2022-11-16 12:47:58,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495ce8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:47:58, skipping insertion in model container [2022-11-16 12:47:58,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:47:58" (3/3) ... [2022-11-16 12:47:58,248 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2022-11-16 12:47:58,258 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 12:47:58,271 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:47:58,271 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2022-11-16 12:47:58,271 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:47:58,436 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-16 12:47:58,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 251 places, 293 transitions, 594 flow [2022-11-16 12:47:58,697 INFO L130 PetriNetUnfolder]: 73/447 cut-off events. [2022-11-16 12:47:58,698 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-16 12:47:58,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 447 events. 73/447 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2144 event pairs, 0 based on Foata normal form. 0/339 useless extension candidates. Maximal degree in co-relation 245. Up to 8 conditions per place. [2022-11-16 12:47:58,714 INFO L82 GeneralOperation]: Start removeDead. Operand has 251 places, 293 transitions, 594 flow [2022-11-16 12:47:58,752 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 290 transitions, 588 flow [2022-11-16 12:47:58,765 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:47:58,773 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@aff0779, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:47:58,774 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-11-16 12:47:58,781 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-16 12:47:58,781 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:47:58,781 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:47:58,782 INFO L209 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] [2022-11-16 12:47:58,783 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 12:47:58,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:58,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1687812199, now seen corresponding path program 1 times [2022-11-16 12:47:58,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:58,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832940386] [2022-11-16 12:47:58,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:58,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:59,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:59,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:59,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832940386] [2022-11-16 12:47:59,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832940386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:59,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:59,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:47:59,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779742444] [2022-11-16 12:47:59,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:59,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:47:59,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:59,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:47:59,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:47:59,325 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 293 [2022-11-16 12:47:59,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 290 transitions, 588 flow. Second operand has 4 states, 4 states have (on average 239.5) internal successors, (958), 4 states have internal predecessors, (958), 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-11-16 12:47:59,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:47:59,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 293 [2022-11-16 12:47:59,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:47:59,572 INFO L130 PetriNetUnfolder]: 9/383 cut-off events. [2022-11-16 12:47:59,572 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-16 12:47:59,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 383 events. 9/383 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1731 event pairs, 0 based on Foata normal form. 62/396 useless extension candidates. Maximal degree in co-relation 207. Up to 15 conditions per place. [2022-11-16 12:47:59,597 INFO L137 encePairwiseOnDemand]: 248/293 looper letters, 17 selfloop transitions, 4 changer transitions 0/256 dead transitions. [2022-11-16 12:47:59,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 256 transitions, 562 flow [2022-11-16 12:47:59,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:47:59,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 12:47:59,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1253 transitions. [2022-11-16 12:47:59,620 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8552901023890785 [2022-11-16 12:47:59,621 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1253 transitions. [2022-11-16 12:47:59,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1253 transitions. [2022-11-16 12:47:59,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:47:59,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1253 transitions. [2022-11-16 12:47:59,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 250.6) internal successors, (1253), 5 states have internal predecessors, (1253), 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-11-16 12:47:59,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 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-11-16 12:47:59,652 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 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-11-16 12:47:59,654 INFO L175 Difference]: Start difference. First operand has 249 places, 290 transitions, 588 flow. Second operand 5 states and 1253 transitions. [2022-11-16 12:47:59,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 256 transitions, 562 flow [2022-11-16 12:47:59,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 256 transitions, 562 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:47:59,668 INFO L231 Difference]: Finished difference. Result has 253 places, 252 transitions, 538 flow [2022-11-16 12:47:59,671 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=538, PETRI_PLACES=253, PETRI_TRANSITIONS=252} [2022-11-16 12:47:59,675 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 4 predicate places. [2022-11-16 12:47:59,676 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 252 transitions, 538 flow [2022-11-16 12:47:59,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 239.5) internal successors, (958), 4 states have internal predecessors, (958), 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-11-16 12:47:59,677 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:47:59,678 INFO L209 CegarLoopForPetriNet]: trace histogram [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] [2022-11-16 12:47:59,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:47:59,678 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 12:47:59,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:59,679 INFO L85 PathProgramCache]: Analyzing trace with hash -239776336, now seen corresponding path program 1 times [2022-11-16 12:47:59,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:59,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511807875] [2022-11-16 12:47:59,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:59,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:47:59,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:59,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511807875] [2022-11-16 12:47:59,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511807875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:59,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:59,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:47:59,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733261041] [2022-11-16 12:47:59,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:59,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:47:59,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:47:59,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:47:59,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:47:59,902 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 293 [2022-11-16 12:47:59,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 252 transitions, 538 flow. Second operand has 4 states, 4 states have (on average 241.25) internal successors, (965), 4 states have internal predecessors, (965), 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-11-16 12:47:59,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:47:59,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 293 [2022-11-16 12:47:59,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:00,037 INFO L130 PetriNetUnfolder]: 9/382 cut-off events. [2022-11-16 12:48:00,037 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-16 12:48:00,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 382 events. 9/382 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1733 event pairs, 0 based on Foata normal form. 1/337 useless extension candidates. Maximal degree in co-relation 372. Up to 7 conditions per place. [2022-11-16 12:48:00,043 INFO L137 encePairwiseOnDemand]: 287/293 looper letters, 9 selfloop transitions, 8 changer transitions 0/252 dead transitions. [2022-11-16 12:48:00,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 252 transitions, 570 flow [2022-11-16 12:48:00,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:48:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 12:48:00,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1205 transitions. [2022-11-16 12:48:00,048 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8225255972696246 [2022-11-16 12:48:00,048 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1205 transitions. [2022-11-16 12:48:00,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1205 transitions. [2022-11-16 12:48:00,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:00,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1205 transitions. [2022-11-16 12:48:00,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 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-11-16 12:48:00,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 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-11-16 12:48:00,060 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 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-11-16 12:48:00,061 INFO L175 Difference]: Start difference. First operand has 253 places, 252 transitions, 538 flow. Second operand 5 states and 1205 transitions. [2022-11-16 12:48:00,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 252 transitions, 570 flow [2022-11-16 12:48:00,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 252 transitions, 568 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:48:00,079 INFO L231 Difference]: Finished difference. Result has 256 places, 252 transitions, 556 flow [2022-11-16 12:48:00,079 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=556, PETRI_PLACES=256, PETRI_TRANSITIONS=252} [2022-11-16 12:48:00,080 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 7 predicate places. [2022-11-16 12:48:00,081 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 252 transitions, 556 flow [2022-11-16 12:48:00,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 241.25) internal successors, (965), 4 states have internal predecessors, (965), 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-11-16 12:48:00,083 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:00,083 INFO L209 CegarLoopForPetriNet]: trace histogram [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] [2022-11-16 12:48:00,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:48:00,085 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 12:48:00,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:00,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1156868917, now seen corresponding path program 1 times [2022-11-16 12:48:00,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:00,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228591857] [2022-11-16 12:48:00,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:00,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:00,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:48:00,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:00,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228591857] [2022-11-16 12:48:00,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228591857] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:00,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670140502] [2022-11-16 12:48:00,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:00,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:00,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:00,302 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:00,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:48:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:00,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:48:00,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:00,594 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:48:00,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:48:00,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670140502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:00,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:48:00,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-16 12:48:00,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958885424] [2022-11-16 12:48:00,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:00,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:48:00,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:00,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:48:00,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:48:00,607 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 293 [2022-11-16 12:48:00,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 252 transitions, 556 flow. Second operand has 5 states, 5 states have (on average 240.8) internal successors, (1204), 5 states have internal predecessors, (1204), 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-11-16 12:48:00,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:00,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 293 [2022-11-16 12:48:00,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:00,748 INFO L130 PetriNetUnfolder]: 9/381 cut-off events. [2022-11-16 12:48:00,748 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-16 12:48:00,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 381 events. 9/381 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1717 event pairs, 0 based on Foata normal form. 1/336 useless extension candidates. Maximal degree in co-relation 370. Up to 10 conditions per place. [2022-11-16 12:48:00,754 INFO L137 encePairwiseOnDemand]: 289/293 looper letters, 11 selfloop transitions, 5 changer transitions 0/251 dead transitions. [2022-11-16 12:48:00,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 251 transitions, 584 flow [2022-11-16 12:48:00,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:48:00,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-16 12:48:00,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 965 transitions. [2022-11-16 12:48:00,758 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8233788395904437 [2022-11-16 12:48:00,758 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 965 transitions. [2022-11-16 12:48:00,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 965 transitions. [2022-11-16 12:48:00,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:00,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 965 transitions. [2022-11-16 12:48:00,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 241.25) internal successors, (965), 4 states have internal predecessors, (965), 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-11-16 12:48:00,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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-11-16 12:48:00,768 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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-11-16 12:48:00,768 INFO L175 Difference]: Start difference. First operand has 256 places, 252 transitions, 556 flow. Second operand 4 states and 965 transitions. [2022-11-16 12:48:00,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 251 transitions, 584 flow [2022-11-16 12:48:00,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 251 transitions, 572 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 12:48:00,778 INFO L231 Difference]: Finished difference. Result has 255 places, 251 transitions, 550 flow [2022-11-16 12:48:00,779 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=550, PETRI_PLACES=255, PETRI_TRANSITIONS=251} [2022-11-16 12:48:00,782 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 6 predicate places. [2022-11-16 12:48:00,782 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 251 transitions, 550 flow [2022-11-16 12:48:00,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 240.8) internal successors, (1204), 5 states have internal predecessors, (1204), 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-11-16 12:48:00,784 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:00,784 INFO L209 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] [2022-11-16 12:48:00,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-16 12:48:00,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:00,993 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 12:48:00,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:00,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1074044146, now seen corresponding path program 1 times [2022-11-16 12:48:00,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:00,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457946494] [2022-11-16 12:48:00,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:00,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:01,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:48:01,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:01,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457946494] [2022-11-16 12:48:01,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457946494] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:01,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120000484] [2022-11-16 12:48:01,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:01,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:01,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:01,196 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:01,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:48:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:01,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:48:01,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:01,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:48:01,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:48:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:48:01,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120000484] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:48:01,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:48:01,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-16 12:48:01,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231066793] [2022-11-16 12:48:01,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:48:01,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:48:01,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:01,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:48:01,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:48:01,486 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 293 [2022-11-16 12:48:01,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 251 transitions, 550 flow. Second operand has 10 states, 10 states have (on average 240.7) internal successors, (2407), 10 states have internal predecessors, (2407), 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-11-16 12:48:01,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:01,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 293 [2022-11-16 12:48:01,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:01,721 INFO L130 PetriNetUnfolder]: 9/389 cut-off events. [2022-11-16 12:48:01,721 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-16 12:48:01,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 389 events. 9/389 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1715 event pairs, 0 based on Foata normal form. 2/345 useless extension candidates. Maximal degree in co-relation 360. Up to 7 conditions per place. [2022-11-16 12:48:01,727 INFO L137 encePairwiseOnDemand]: 287/293 looper letters, 18 selfloop transitions, 9 changer transitions 0/262 dead transitions. [2022-11-16 12:48:01,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 262 transitions, 642 flow [2022-11-16 12:48:01,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:48:01,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 12:48:01,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2171 transitions. [2022-11-16 12:48:01,734 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8232840348881304 [2022-11-16 12:48:01,735 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2171 transitions. [2022-11-16 12:48:01,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2171 transitions. [2022-11-16 12:48:01,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:01,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2171 transitions. [2022-11-16 12:48:01,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 241.22222222222223) internal successors, (2171), 9 states have internal predecessors, (2171), 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-11-16 12:48:01,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 293.0) internal successors, (2930), 10 states have internal predecessors, (2930), 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-11-16 12:48:01,755 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 293.0) internal successors, (2930), 10 states have internal predecessors, (2930), 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-11-16 12:48:01,755 INFO L175 Difference]: Start difference. First operand has 255 places, 251 transitions, 550 flow. Second operand 9 states and 2171 transitions. [2022-11-16 12:48:01,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 262 transitions, 642 flow [2022-11-16 12:48:01,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 262 transitions, 628 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 12:48:01,763 INFO L231 Difference]: Finished difference. Result has 264 places, 255 transitions, 596 flow [2022-11-16 12:48:01,764 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=596, PETRI_PLACES=264, PETRI_TRANSITIONS=255} [2022-11-16 12:48:01,766 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 15 predicate places. [2022-11-16 12:48:01,767 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 255 transitions, 596 flow [2022-11-16 12:48:01,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 240.7) internal successors, (2407), 10 states have internal predecessors, (2407), 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-11-16 12:48:01,769 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:01,769 INFO L209 CegarLoopForPetriNet]: trace histogram [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] [2022-11-16 12:48:01,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:01,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:01,977 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 12:48:01,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:01,978 INFO L85 PathProgramCache]: Analyzing trace with hash -475199278, now seen corresponding path program 2 times [2022-11-16 12:48:01,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:01,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112949711] [2022-11-16 12:48:01,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:01,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:02,136 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 12:48:02,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:02,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112949711] [2022-11-16 12:48:02,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112949711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:02,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:02,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:48:02,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821053131] [2022-11-16 12:48:02,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:02,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:48:02,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:02,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:48:02,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:48:02,143 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 293 [2022-11-16 12:48:02,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 255 transitions, 596 flow. Second operand has 4 states, 4 states have (on average 239.75) internal successors, (959), 4 states have internal predecessors, (959), 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-11-16 12:48:02,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:02,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 293 [2022-11-16 12:48:02,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:02,270 INFO L130 PetriNetUnfolder]: 6/264 cut-off events. [2022-11-16 12:48:02,270 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-11-16 12:48:02,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 264 events. 6/264 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 814 event pairs, 0 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 247. Up to 7 conditions per place. [2022-11-16 12:48:02,277 INFO L137 encePairwiseOnDemand]: 286/293 looper letters, 10 selfloop transitions, 4 changer transitions 0/255 dead transitions. [2022-11-16 12:48:02,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 255 transitions, 624 flow [2022-11-16 12:48:02,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:48:02,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 12:48:02,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1207 transitions. [2022-11-16 12:48:02,282 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8238907849829351 [2022-11-16 12:48:02,282 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1207 transitions. [2022-11-16 12:48:02,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1207 transitions. [2022-11-16 12:48:02,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:02,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1207 transitions. [2022-11-16 12:48:02,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 241.4) internal successors, (1207), 5 states have internal predecessors, (1207), 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-11-16 12:48:02,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 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-11-16 12:48:02,293 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 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-11-16 12:48:02,293 INFO L175 Difference]: Start difference. First operand has 264 places, 255 transitions, 596 flow. Second operand 5 states and 1207 transitions. [2022-11-16 12:48:02,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 255 transitions, 624 flow [2022-11-16 12:48:02,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 255 transitions, 608 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-16 12:48:02,305 INFO L231 Difference]: Finished difference. Result has 263 places, 253 transitions, 588 flow [2022-11-16 12:48:02,306 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=588, PETRI_PLACES=263, PETRI_TRANSITIONS=253} [2022-11-16 12:48:02,309 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 14 predicate places. [2022-11-16 12:48:02,309 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 253 transitions, 588 flow [2022-11-16 12:48:02,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 239.75) internal successors, (959), 4 states have internal predecessors, (959), 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-11-16 12:48:02,310 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:02,311 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-11-16 12:48:02,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:48:02,311 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 12:48:02,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:02,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1969892839, now seen corresponding path program 1 times [2022-11-16 12:48:02,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:02,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983679846] [2022-11-16 12:48:02,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:02,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 12:48:02,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:02,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983679846] [2022-11-16 12:48:02,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983679846] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:02,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374060320] [2022-11-16 12:48:02,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:02,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:02,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:02,608 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:02,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:48:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:02,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 12:48:02,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 12:48:02,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:48:03,053 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 12:48:03,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374060320] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:48:03,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:48:03,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-16 12:48:03,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244947972] [2022-11-16 12:48:03,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:48:03,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 12:48:03,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:03,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 12:48:03,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:48:03,065 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 293 [2022-11-16 12:48:03,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 253 transitions, 588 flow. Second operand has 18 states, 18 states have (on average 241.05555555555554) internal successors, (4339), 18 states have internal predecessors, (4339), 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-11-16 12:48:03,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:03,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 293 [2022-11-16 12:48:03,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:03,504 INFO L130 PetriNetUnfolder]: 6/292 cut-off events. [2022-11-16 12:48:03,504 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-11-16 12:48:03,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 292 events. 6/292 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 814 event pairs, 0 based on Foata normal form. 4/270 useless extension candidates. Maximal degree in co-relation 240. Up to 9 conditions per place. [2022-11-16 12:48:03,509 INFO L137 encePairwiseOnDemand]: 287/293 looper letters, 34 selfloop transitions, 21 changer transitions 0/288 dead transitions. [2022-11-16 12:48:03,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 288 transitions, 852 flow [2022-11-16 12:48:03,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 12:48:03,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-16 12:48:03,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5057 transitions. [2022-11-16 12:48:03,523 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8218755078823338 [2022-11-16 12:48:03,524 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 5057 transitions. [2022-11-16 12:48:03,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 5057 transitions. [2022-11-16 12:48:03,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:03,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 5057 transitions. [2022-11-16 12:48:03,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 240.8095238095238) internal successors, (5057), 21 states have internal predecessors, (5057), 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-11-16 12:48:03,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 293.0) internal successors, (6446), 22 states have internal predecessors, (6446), 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-11-16 12:48:03,561 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 293.0) internal successors, (6446), 22 states have internal predecessors, (6446), 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-11-16 12:48:03,562 INFO L175 Difference]: Start difference. First operand has 263 places, 253 transitions, 588 flow. Second operand 21 states and 5057 transitions. [2022-11-16 12:48:03,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 288 transitions, 852 flow [2022-11-16 12:48:03,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 288 transitions, 844 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 12:48:03,571 INFO L231 Difference]: Finished difference. Result has 284 places, 266 transitions, 736 flow [2022-11-16 12:48:03,572 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=736, PETRI_PLACES=284, PETRI_TRANSITIONS=266} [2022-11-16 12:48:03,573 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 35 predicate places. [2022-11-16 12:48:03,573 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 266 transitions, 736 flow [2022-11-16 12:48:03,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 241.05555555555554) internal successors, (4339), 18 states have internal predecessors, (4339), 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-11-16 12:48:03,576 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:03,576 INFO L209 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 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] [2022-11-16 12:48:03,589 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:03,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 12:48:03,783 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 12:48:03,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:03,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1855590873, now seen corresponding path program 2 times [2022-11-16 12:48:03,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:03,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408873141] [2022-11-16 12:48:03,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:03,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:04,302 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 12:48:04,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:04,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408873141] [2022-11-16 12:48:04,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408873141] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:04,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582884492] [2022-11-16 12:48:04,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:48:04,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:04,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:04,305 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:04,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:48:04,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:48:04,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:48:04,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 12:48:04,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 12:48:04,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:48:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 12:48:05,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582884492] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:48:05,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:48:05,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-16 12:48:05,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444279116] [2022-11-16 12:48:05,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:48:05,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 12:48:05,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:05,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 12:48:05,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-16 12:48:05,018 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 293 [2022-11-16 12:48:05,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 266 transitions, 736 flow. Second operand has 23 states, 23 states have (on average 241.30434782608697) internal successors, (5550), 23 states have internal predecessors, (5550), 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-11-16 12:48:05,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:05,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 293 [2022-11-16 12:48:05,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:05,645 INFO L130 PetriNetUnfolder]: 6/313 cut-off events. [2022-11-16 12:48:05,645 INFO L131 PetriNetUnfolder]: For 224/224 co-relation queries the response was YES. [2022-11-16 12:48:05,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 313 events. 6/313 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 816 event pairs, 0 based on Foata normal form. 3/290 useless extension candidates. Maximal degree in co-relation 334. Up to 12 conditions per place. [2022-11-16 12:48:05,655 INFO L137 encePairwiseOnDemand]: 287/293 looper letters, 46 selfloop transitions, 30 changer transitions 0/309 dead transitions. [2022-11-16 12:48:05,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 309 transitions, 1098 flow [2022-11-16 12:48:05,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 12:48:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-16 12:48:05,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 7219 transitions. [2022-11-16 12:48:05,676 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8212741751990899 [2022-11-16 12:48:05,676 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 7219 transitions. [2022-11-16 12:48:05,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 7219 transitions. [2022-11-16 12:48:05,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:05,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 7219 transitions. [2022-11-16 12:48:05,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 240.63333333333333) internal successors, (7219), 30 states have internal predecessors, (7219), 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-11-16 12:48:05,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 293.0) internal successors, (9083), 31 states have internal predecessors, (9083), 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-11-16 12:48:05,728 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 293.0) internal successors, (9083), 31 states have internal predecessors, (9083), 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-11-16 12:48:05,728 INFO L175 Difference]: Start difference. First operand has 284 places, 266 transitions, 736 flow. Second operand 30 states and 7219 transitions. [2022-11-16 12:48:05,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 309 transitions, 1098 flow [2022-11-16 12:48:05,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 309 transitions, 1018 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-11-16 12:48:05,741 INFO L231 Difference]: Finished difference. Result has 309 places, 276 transitions, 834 flow [2022-11-16 12:48:05,741 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=834, PETRI_PLACES=309, PETRI_TRANSITIONS=276} [2022-11-16 12:48:05,742 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 60 predicate places. [2022-11-16 12:48:05,743 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 276 transitions, 834 flow [2022-11-16 12:48:05,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 241.30434782608697) internal successors, (5550), 23 states have internal predecessors, (5550), 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-11-16 12:48:05,745 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:05,746 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 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] [2022-11-16 12:48:05,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:05,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-16 12:48:05,953 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 12:48:05,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:05,953 INFO L85 PathProgramCache]: Analyzing trace with hash 44998914, now seen corresponding path program 3 times [2022-11-16 12:48:05,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:05,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50988740] [2022-11-16 12:48:05,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:05,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:48:06,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:48:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:48:06,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:48:06,104 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:48:06,106 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2022-11-16 12:48:06,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 29 remaining) [2022-11-16 12:48:06,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 29 remaining) [2022-11-16 12:48:06,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 29 remaining) [2022-11-16 12:48:06,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 29 remaining) [2022-11-16 12:48:06,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 29 remaining) [2022-11-16 12:48:06,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 29 remaining) [2022-11-16 12:48:06,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 29 remaining) [2022-11-16 12:48:06,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 29 remaining) [2022-11-16 12:48:06,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 29 remaining) [2022-11-16 12:48:06,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 29 remaining) [2022-11-16 12:48:06,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 29 remaining) [2022-11-16 12:48:06,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 29 remaining) [2022-11-16 12:48:06,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 29 remaining) [2022-11-16 12:48:06,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 29 remaining) [2022-11-16 12:48:06,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 29 remaining) [2022-11-16 12:48:06,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 29 remaining) [2022-11-16 12:48:06,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 29 remaining) [2022-11-16 12:48:06,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 29 remaining) [2022-11-16 12:48:06,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 29 remaining) [2022-11-16 12:48:06,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 29 remaining) [2022-11-16 12:48:06,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 29 remaining) [2022-11-16 12:48:06,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 29 remaining) [2022-11-16 12:48:06,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 29 remaining) [2022-11-16 12:48:06,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 29 remaining) [2022-11-16 12:48:06,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 29 remaining) [2022-11-16 12:48:06,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 29 remaining) [2022-11-16 12:48:06,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 29 remaining) [2022-11-16 12:48:06,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 29 remaining) [2022-11-16 12:48:06,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:48:06,125 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2022-11-16 12:48:06,128 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 12:48:06,129 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-16 12:48:06,207 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-16 12:48:06,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 322 places, 377 transitions, 772 flow [2022-11-16 12:48:06,348 INFO L130 PetriNetUnfolder]: 118/722 cut-off events. [2022-11-16 12:48:06,348 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-16 12:48:06,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 722 events. 118/722 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3910 event pairs, 0 based on Foata normal form. 0/546 useless extension candidates. Maximal degree in co-relation 449. Up to 12 conditions per place. [2022-11-16 12:48:06,362 INFO L82 GeneralOperation]: Start removeDead. Operand has 322 places, 377 transitions, 772 flow [2022-11-16 12:48:06,378 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 322 places, 377 transitions, 772 flow [2022-11-16 12:48:06,381 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:48:06,383 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@aff0779, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:48:06,383 INFO L358 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2022-11-16 12:48:06,387 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-16 12:48:06,387 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:48:06,387 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:06,387 INFO L209 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] [2022-11-16 12:48:06,388 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-16 12:48:06,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:06,388 INFO L85 PathProgramCache]: Analyzing trace with hash 204609856, now seen corresponding path program 1 times [2022-11-16 12:48:06,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:06,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710829739] [2022-11-16 12:48:06,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:06,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:48:06,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:06,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710829739] [2022-11-16 12:48:06,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710829739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:06,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:06,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:48:06,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845608766] [2022-11-16 12:48:06,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:06,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:48:06,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:06,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:48:06,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:48:06,466 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 377 [2022-11-16 12:48:06,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 377 transitions, 772 flow. Second operand has 4 states, 4 states have (on average 308.5) internal successors, (1234), 4 states have internal predecessors, (1234), 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-11-16 12:48:06,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:06,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 377 [2022-11-16 12:48:06,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:06,679 INFO L130 PetriNetUnfolder]: 17/620 cut-off events. [2022-11-16 12:48:06,679 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-11-16 12:48:06,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 620 events. 17/620 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3342 event pairs, 0 based on Foata normal form. 125/662 useless extension candidates. Maximal degree in co-relation 409. Up to 19 conditions per place. [2022-11-16 12:48:06,693 INFO L137 encePairwiseOnDemand]: 320/377 looper letters, 19 selfloop transitions, 4 changer transitions 0/330 dead transitions. [2022-11-16 12:48:06,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 330 transitions, 724 flow [2022-11-16 12:48:06,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:48:06,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 12:48:06,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1612 transitions. [2022-11-16 12:48:06,699 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8551724137931035 [2022-11-16 12:48:06,699 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1612 transitions. [2022-11-16 12:48:06,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1612 transitions. [2022-11-16 12:48:06,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:06,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1612 transitions. [2022-11-16 12:48:06,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 322.4) internal successors, (1612), 5 states have internal predecessors, (1612), 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-11-16 12:48:06,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 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-11-16 12:48:06,711 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 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-11-16 12:48:06,711 INFO L175 Difference]: Start difference. First operand has 322 places, 377 transitions, 772 flow. Second operand 5 states and 1612 transitions. [2022-11-16 12:48:06,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 330 transitions, 724 flow [2022-11-16 12:48:06,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 330 transitions, 724 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:48:06,719 INFO L231 Difference]: Finished difference. Result has 325 places, 326 transitions, 696 flow [2022-11-16 12:48:06,720 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=696, PETRI_PLACES=325, PETRI_TRANSITIONS=326} [2022-11-16 12:48:06,723 INFO L288 CegarLoopForPetriNet]: 322 programPoint places, 3 predicate places. [2022-11-16 12:48:06,723 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 326 transitions, 696 flow [2022-11-16 12:48:06,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 308.5) internal successors, (1234), 4 states have internal predecessors, (1234), 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-11-16 12:48:06,724 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:06,724 INFO L209 CegarLoopForPetriNet]: trace histogram [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] [2022-11-16 12:48:06,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:48:06,725 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-16 12:48:06,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:06,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1033228592, now seen corresponding path program 1 times [2022-11-16 12:48:06,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:06,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953707451] [2022-11-16 12:48:06,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:06,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:06,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:48:06,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:06,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953707451] [2022-11-16 12:48:06,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953707451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:06,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:06,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:48:06,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029221606] [2022-11-16 12:48:06,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:06,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:48:06,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:06,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:48:06,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:48:06,784 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 377 [2022-11-16 12:48:06,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 326 transitions, 696 flow. Second operand has 4 states, 4 states have (on average 310.25) internal successors, (1241), 4 states have internal predecessors, (1241), 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-11-16 12:48:06,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:06,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 377 [2022-11-16 12:48:06,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:06,989 INFO L130 PetriNetUnfolder]: 17/619 cut-off events. [2022-11-16 12:48:06,989 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-16 12:48:06,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 619 events. 17/619 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3324 event pairs, 0 based on Foata normal form. 1/540 useless extension candidates. Maximal degree in co-relation 620. Up to 11 conditions per place. [2022-11-16 12:48:07,002 INFO L137 encePairwiseOnDemand]: 371/377 looper letters, 11 selfloop transitions, 8 changer transitions 0/326 dead transitions. [2022-11-16 12:48:07,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 326 transitions, 732 flow [2022-11-16 12:48:07,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:48:07,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 12:48:07,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1552 transitions. [2022-11-16 12:48:07,007 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.823342175066313 [2022-11-16 12:48:07,007 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1552 transitions. [2022-11-16 12:48:07,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1552 transitions. [2022-11-16 12:48:07,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:07,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1552 transitions. [2022-11-16 12:48:07,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 310.4) internal successors, (1552), 5 states have internal predecessors, (1552), 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-11-16 12:48:07,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 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-11-16 12:48:07,019 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 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-11-16 12:48:07,019 INFO L175 Difference]: Start difference. First operand has 325 places, 326 transitions, 696 flow. Second operand 5 states and 1552 transitions. [2022-11-16 12:48:07,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 326 transitions, 732 flow [2022-11-16 12:48:07,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 326 transitions, 730 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:48:07,027 INFO L231 Difference]: Finished difference. Result has 328 places, 326 transitions, 714 flow [2022-11-16 12:48:07,028 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=714, PETRI_PLACES=328, PETRI_TRANSITIONS=326} [2022-11-16 12:48:07,029 INFO L288 CegarLoopForPetriNet]: 322 programPoint places, 6 predicate places. [2022-11-16 12:48:07,029 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 326 transitions, 714 flow [2022-11-16 12:48:07,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 310.25) internal successors, (1241), 4 states have internal predecessors, (1241), 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-11-16 12:48:07,030 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:07,030 INFO L209 CegarLoopForPetriNet]: trace histogram [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] [2022-11-16 12:48:07,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:48:07,031 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-16 12:48:07,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:07,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1965314162, now seen corresponding path program 1 times [2022-11-16 12:48:07,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:07,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080402039] [2022-11-16 12:48:07,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:07,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:07,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:48:07,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:07,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080402039] [2022-11-16 12:48:07,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080402039] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:07,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541420992] [2022-11-16 12:48:07,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:07,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:07,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:07,119 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:07,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:48:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:07,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:48:07,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:07,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:48:07,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:48:07,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541420992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:07,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:48:07,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-16 12:48:07,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693664024] [2022-11-16 12:48:07,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:07,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:48:07,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:07,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:48:07,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:48:07,308 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 377 [2022-11-16 12:48:07,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 326 transitions, 714 flow. Second operand has 5 states, 5 states have (on average 309.8) internal successors, (1549), 5 states have internal predecessors, (1549), 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-11-16 12:48:07,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:07,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 377 [2022-11-16 12:48:07,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:07,489 INFO L130 PetriNetUnfolder]: 17/618 cut-off events. [2022-11-16 12:48:07,489 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-11-16 12:48:07,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 618 events. 17/618 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3329 event pairs, 0 based on Foata normal form. 1/539 useless extension candidates. Maximal degree in co-relation 618. Up to 14 conditions per place. [2022-11-16 12:48:07,504 INFO L137 encePairwiseOnDemand]: 373/377 looper letters, 13 selfloop transitions, 5 changer transitions 0/325 dead transitions. [2022-11-16 12:48:07,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 325 transitions, 746 flow [2022-11-16 12:48:07,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:48:07,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-16 12:48:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1243 transitions. [2022-11-16 12:48:07,509 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8242705570291777 [2022-11-16 12:48:07,510 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1243 transitions. [2022-11-16 12:48:07,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1243 transitions. [2022-11-16 12:48:07,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:07,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1243 transitions. [2022-11-16 12:48:07,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 310.75) internal successors, (1243), 4 states have internal predecessors, (1243), 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-11-16 12:48:07,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 377.0) internal successors, (1885), 5 states have internal predecessors, (1885), 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-11-16 12:48:07,542 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 377.0) internal successors, (1885), 5 states have internal predecessors, (1885), 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-11-16 12:48:07,542 INFO L175 Difference]: Start difference. First operand has 328 places, 326 transitions, 714 flow. Second operand 4 states and 1243 transitions. [2022-11-16 12:48:07,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 325 transitions, 746 flow [2022-11-16 12:48:07,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 325 transitions, 734 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 12:48:07,553 INFO L231 Difference]: Finished difference. Result has 327 places, 325 transitions, 708 flow [2022-11-16 12:48:07,554 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=708, PETRI_PLACES=327, PETRI_TRANSITIONS=325} [2022-11-16 12:48:07,554 INFO L288 CegarLoopForPetriNet]: 322 programPoint places, 5 predicate places. [2022-11-16 12:48:07,555 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 325 transitions, 708 flow [2022-11-16 12:48:07,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 309.8) internal successors, (1549), 5 states have internal predecessors, (1549), 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-11-16 12:48:07,556 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:07,556 INFO L209 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] [2022-11-16 12:48:07,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:07,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-16 12:48:07,764 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-16 12:48:07,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:07,765 INFO L85 PathProgramCache]: Analyzing trace with hash -417133539, now seen corresponding path program 1 times [2022-11-16 12:48:07,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:07,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940543005] [2022-11-16 12:48:07,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:07,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:48:07,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:07,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940543005] [2022-11-16 12:48:07,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940543005] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:07,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818108035] [2022-11-16 12:48:07,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:07,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:07,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:07,865 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:07,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:48:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:07,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:48:07,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:48:08,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:48:08,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:48:08,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818108035] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:48:08,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:48:08,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-16 12:48:08,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855181785] [2022-11-16 12:48:08,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:48:08,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:48:08,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:08,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:48:08,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:48:08,080 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 377 [2022-11-16 12:48:08,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 325 transitions, 708 flow. Second operand has 10 states, 10 states have (on average 309.7) internal successors, (3097), 10 states have internal predecessors, (3097), 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-11-16 12:48:08,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:08,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 377 [2022-11-16 12:48:08,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:08,325 INFO L130 PetriNetUnfolder]: 17/626 cut-off events. [2022-11-16 12:48:08,325 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-11-16 12:48:08,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 626 events. 17/626 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3301 event pairs, 0 based on Foata normal form. 2/548 useless extension candidates. Maximal degree in co-relation 608. Up to 11 conditions per place. [2022-11-16 12:48:08,347 INFO L137 encePairwiseOnDemand]: 371/377 looper letters, 20 selfloop transitions, 9 changer transitions 0/336 dead transitions. [2022-11-16 12:48:08,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 336 transitions, 804 flow [2022-11-16 12:48:08,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:48:08,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 12:48:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2794 transitions. [2022-11-16 12:48:08,357 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8234600648393752 [2022-11-16 12:48:08,357 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2794 transitions. [2022-11-16 12:48:08,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2794 transitions. [2022-11-16 12:48:08,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:08,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2794 transitions. [2022-11-16 12:48:08,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 310.44444444444446) internal successors, (2794), 9 states have internal predecessors, (2794), 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-11-16 12:48:08,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 377.0) internal successors, (3770), 10 states have internal predecessors, (3770), 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-11-16 12:48:08,379 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 377.0) internal successors, (3770), 10 states have internal predecessors, (3770), 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-11-16 12:48:08,379 INFO L175 Difference]: Start difference. First operand has 327 places, 325 transitions, 708 flow. Second operand 9 states and 2794 transitions. [2022-11-16 12:48:08,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 336 transitions, 804 flow [2022-11-16 12:48:08,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 336 transitions, 790 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 12:48:08,389 INFO L231 Difference]: Finished difference. Result has 336 places, 329 transitions, 754 flow [2022-11-16 12:48:08,390 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=754, PETRI_PLACES=336, PETRI_TRANSITIONS=329} [2022-11-16 12:48:08,391 INFO L288 CegarLoopForPetriNet]: 322 programPoint places, 14 predicate places. [2022-11-16 12:48:08,391 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 329 transitions, 754 flow [2022-11-16 12:48:08,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 309.7) internal successors, (3097), 10 states have internal predecessors, (3097), 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-11-16 12:48:08,393 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:08,393 INFO L209 CegarLoopForPetriNet]: trace histogram [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] [2022-11-16 12:48:08,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:08,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 12:48:08,599 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-16 12:48:08,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:08,600 INFO L85 PathProgramCache]: Analyzing trace with hash 679389725, now seen corresponding path program 2 times [2022-11-16 12:48:08,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:08,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235966218] [2022-11-16 12:48:08,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:08,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:08,688 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 12:48:08,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:08,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235966218] [2022-11-16 12:48:08,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235966218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:08,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:08,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:48:08,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529099953] [2022-11-16 12:48:08,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:08,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:48:08,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:08,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:48:08,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:48:08,693 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 377 [2022-11-16 12:48:08,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 329 transitions, 754 flow. Second operand has 4 states, 4 states have (on average 308.75) internal successors, (1235), 4 states have internal predecessors, (1235), 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-11-16 12:48:08,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:08,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 377 [2022-11-16 12:48:08,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:08,872 INFO L130 PetriNetUnfolder]: 13/510 cut-off events. [2022-11-16 12:48:08,872 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-11-16 12:48:08,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 510 events. 13/510 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2452 event pairs, 0 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 514. Up to 21 conditions per place. [2022-11-16 12:48:08,886 INFO L137 encePairwiseOnDemand]: 370/377 looper letters, 19 selfloop transitions, 4 changer transitions 0/336 dead transitions. [2022-11-16 12:48:08,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 336 transitions, 814 flow [2022-11-16 12:48:08,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:48:08,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 12:48:08,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1561 transitions. [2022-11-16 12:48:08,893 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8281167108753316 [2022-11-16 12:48:08,893 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1561 transitions. [2022-11-16 12:48:08,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1561 transitions. [2022-11-16 12:48:08,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:08,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1561 transitions. [2022-11-16 12:48:08,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 312.2) internal successors, (1561), 5 states have internal predecessors, (1561), 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-11-16 12:48:08,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 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-11-16 12:48:08,903 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 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-11-16 12:48:08,904 INFO L175 Difference]: Start difference. First operand has 336 places, 329 transitions, 754 flow. Second operand 5 states and 1561 transitions. [2022-11-16 12:48:08,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 336 transitions, 814 flow [2022-11-16 12:48:08,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 336 transitions, 798 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-16 12:48:08,913 INFO L231 Difference]: Finished difference. Result has 339 places, 332 transitions, 770 flow [2022-11-16 12:48:08,914 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=770, PETRI_PLACES=339, PETRI_TRANSITIONS=332} [2022-11-16 12:48:08,915 INFO L288 CegarLoopForPetriNet]: 322 programPoint places, 17 predicate places. [2022-11-16 12:48:08,915 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 332 transitions, 770 flow [2022-11-16 12:48:08,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 308.75) internal successors, (1235), 4 states have internal predecessors, (1235), 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-11-16 12:48:08,916 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:08,917 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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] [2022-11-16 12:48:08,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:48:08,917 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-16 12:48:08,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:08,918 INFO L85 PathProgramCache]: Analyzing trace with hash -705075548, now seen corresponding path program 1 times [2022-11-16 12:48:08,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:08,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210266548] [2022-11-16 12:48:08,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:08,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:08,992 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-16 12:48:08,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:08,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210266548] [2022-11-16 12:48:08,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210266548] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:08,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:08,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:48:08,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987386708] [2022-11-16 12:48:08,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:08,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:48:08,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:08,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:48:08,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:48:08,998 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 377 [2022-11-16 12:48:09,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 332 transitions, 770 flow. Second operand has 4 states, 4 states have (on average 310.75) internal successors, (1243), 4 states have internal predecessors, (1243), 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-11-16 12:48:09,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:09,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 377 [2022-11-16 12:48:09,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:09,190 INFO L130 PetriNetUnfolder]: 13/509 cut-off events. [2022-11-16 12:48:09,190 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-11-16 12:48:09,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 509 events. 13/509 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2443 event pairs, 0 based on Foata normal form. 1/452 useless extension candidates. Maximal degree in co-relation 521. Up to 10 conditions per place. [2022-11-16 12:48:09,202 INFO L137 encePairwiseOnDemand]: 371/377 looper letters, 11 selfloop transitions, 8 changer transitions 0/332 dead transitions. [2022-11-16 12:48:09,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 332 transitions, 806 flow [2022-11-16 12:48:09,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:48:09,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 12:48:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1552 transitions. [2022-11-16 12:48:09,206 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.823342175066313 [2022-11-16 12:48:09,206 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1552 transitions. [2022-11-16 12:48:09,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1552 transitions. [2022-11-16 12:48:09,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:09,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1552 transitions. [2022-11-16 12:48:09,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 310.4) internal successors, (1552), 5 states have internal predecessors, (1552), 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-11-16 12:48:09,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 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-11-16 12:48:09,215 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 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-11-16 12:48:09,215 INFO L175 Difference]: Start difference. First operand has 339 places, 332 transitions, 770 flow. Second operand 5 states and 1552 transitions. [2022-11-16 12:48:09,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 332 transitions, 806 flow [2022-11-16 12:48:09,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 332 transitions, 804 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:48:09,224 INFO L231 Difference]: Finished difference. Result has 342 places, 332 transitions, 788 flow [2022-11-16 12:48:09,224 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=788, PETRI_PLACES=342, PETRI_TRANSITIONS=332} [2022-11-16 12:48:09,226 INFO L288 CegarLoopForPetriNet]: 322 programPoint places, 20 predicate places. [2022-11-16 12:48:09,226 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 332 transitions, 788 flow [2022-11-16 12:48:09,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 310.75) internal successors, (1243), 4 states have internal predecessors, (1243), 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-11-16 12:48:09,227 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:09,227 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-11-16 12:48:09,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:48:09,228 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-16 12:48:09,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:09,229 INFO L85 PathProgramCache]: Analyzing trace with hash -382504469, now seen corresponding path program 1 times [2022-11-16 12:48:09,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:09,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320104518] [2022-11-16 12:48:09,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:09,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:48:09,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:09,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320104518] [2022-11-16 12:48:09,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320104518] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:09,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093042131] [2022-11-16 12:48:09,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:09,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:09,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:09,411 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:09,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:48:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:09,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 12:48:09,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:09,617 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:48:09,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:48:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:48:09,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093042131] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:48:09,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:48:09,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-16 12:48:09,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467384330] [2022-11-16 12:48:09,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:48:09,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 12:48:09,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:09,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 12:48:09,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:48:09,779 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 377 [2022-11-16 12:48:09,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 332 transitions, 788 flow. Second operand has 18 states, 18 states have (on average 310.1111111111111) internal successors, (5582), 18 states have internal predecessors, (5582), 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-11-16 12:48:09,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:09,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 377 [2022-11-16 12:48:09,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:10,239 INFO L130 PetriNetUnfolder]: 13/537 cut-off events. [2022-11-16 12:48:10,239 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-11-16 12:48:10,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 537 events. 13/537 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2447 event pairs, 0 based on Foata normal form. 4/483 useless extension candidates. Maximal degree in co-relation 515. Up to 11 conditions per place. [2022-11-16 12:48:10,253 INFO L137 encePairwiseOnDemand]: 371/377 looper letters, 36 selfloop transitions, 21 changer transitions 0/367 dead transitions. [2022-11-16 12:48:10,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 367 transitions, 1056 flow [2022-11-16 12:48:10,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 12:48:10,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-16 12:48:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6508 transitions. [2022-11-16 12:48:10,267 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8220285461664772 [2022-11-16 12:48:10,268 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 6508 transitions. [2022-11-16 12:48:10,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 6508 transitions. [2022-11-16 12:48:10,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:10,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 6508 transitions. [2022-11-16 12:48:10,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 309.9047619047619) internal successors, (6508), 21 states have internal predecessors, (6508), 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-11-16 12:48:10,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 377.0) internal successors, (8294), 22 states have internal predecessors, (8294), 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-11-16 12:48:10,307 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 377.0) internal successors, (8294), 22 states have internal predecessors, (8294), 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-11-16 12:48:10,308 INFO L175 Difference]: Start difference. First operand has 342 places, 332 transitions, 788 flow. Second operand 21 states and 6508 transitions. [2022-11-16 12:48:10,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 367 transitions, 1056 flow [2022-11-16 12:48:10,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 367 transitions, 1044 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 12:48:10,318 INFO L231 Difference]: Finished difference. Result has 364 places, 345 transitions, 932 flow [2022-11-16 12:48:10,319 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=932, PETRI_PLACES=364, PETRI_TRANSITIONS=345} [2022-11-16 12:48:10,320 INFO L288 CegarLoopForPetriNet]: 322 programPoint places, 42 predicate places. [2022-11-16 12:48:10,320 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 345 transitions, 932 flow [2022-11-16 12:48:10,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 310.1111111111111) internal successors, (5582), 18 states have internal predecessors, (5582), 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-11-16 12:48:10,322 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:10,323 INFO L209 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 2, 2, 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] [2022-11-16 12:48:10,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:10,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:10,530 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-16 12:48:10,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:10,531 INFO L85 PathProgramCache]: Analyzing trace with hash -514640405, now seen corresponding path program 2 times [2022-11-16 12:48:10,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:10,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173349622] [2022-11-16 12:48:10,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:10,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:10,990 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:48:10,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:10,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173349622] [2022-11-16 12:48:10,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173349622] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:10,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443569909] [2022-11-16 12:48:10,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:48:10,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:10,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:11,005 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:11,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 12:48:11,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:48:11,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:48:11,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 12:48:11,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:11,317 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:48:11,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:48:11,626 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:48:11,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443569909] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:48:11,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:48:11,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-16 12:48:11,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034050643] [2022-11-16 12:48:11,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:48:11,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 12:48:11,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:11,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 12:48:11,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-16 12:48:11,638 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 377 [2022-11-16 12:48:11,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 345 transitions, 932 flow. Second operand has 23 states, 23 states have (on average 310.3478260869565) internal successors, (7138), 23 states have internal predecessors, (7138), 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-11-16 12:48:11,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:11,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 377 [2022-11-16 12:48:11,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:12,288 INFO L130 PetriNetUnfolder]: 13/558 cut-off events. [2022-11-16 12:48:12,289 INFO L131 PetriNetUnfolder]: For 241/241 co-relation queries the response was YES. [2022-11-16 12:48:12,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 558 events. 13/558 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2448 event pairs, 0 based on Foata normal form. 3/503 useless extension candidates. Maximal degree in co-relation 572. Up to 12 conditions per place. [2022-11-16 12:48:12,303 INFO L137 encePairwiseOnDemand]: 371/377 looper letters, 48 selfloop transitions, 30 changer transitions 0/388 dead transitions. [2022-11-16 12:48:12,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 388 transitions, 1298 flow [2022-11-16 12:48:12,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 12:48:12,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-16 12:48:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9291 transitions. [2022-11-16 12:48:12,344 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8214854111405836 [2022-11-16 12:48:12,344 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 9291 transitions. [2022-11-16 12:48:12,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 9291 transitions. [2022-11-16 12:48:12,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:12,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 9291 transitions. [2022-11-16 12:48:12,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 309.7) internal successors, (9291), 30 states have internal predecessors, (9291), 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-11-16 12:48:12,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 377.0) internal successors, (11687), 31 states have internal predecessors, (11687), 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-11-16 12:48:12,389 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 377.0) internal successors, (11687), 31 states have internal predecessors, (11687), 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-11-16 12:48:12,389 INFO L175 Difference]: Start difference. First operand has 364 places, 345 transitions, 932 flow. Second operand 30 states and 9291 transitions. [2022-11-16 12:48:12,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 388 transitions, 1298 flow [2022-11-16 12:48:12,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 388 transitions, 1218 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-11-16 12:48:12,401 INFO L231 Difference]: Finished difference. Result has 389 places, 355 transitions, 1030 flow [2022-11-16 12:48:12,403 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1030, PETRI_PLACES=389, PETRI_TRANSITIONS=355} [2022-11-16 12:48:12,403 INFO L288 CegarLoopForPetriNet]: 322 programPoint places, 67 predicate places. [2022-11-16 12:48:12,404 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 355 transitions, 1030 flow [2022-11-16 12:48:12,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 310.3478260869565) internal successors, (7138), 23 states have internal predecessors, (7138), 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-11-16 12:48:12,406 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:12,407 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 2, 2, 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] [2022-11-16 12:48:12,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:12,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:12,614 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-16 12:48:12,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:12,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2125618267, now seen corresponding path program 3 times [2022-11-16 12:48:12,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:12,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326971341] [2022-11-16 12:48:12,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:12,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-16 12:48:12,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:12,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326971341] [2022-11-16 12:48:12,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326971341] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:12,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41072412] [2022-11-16 12:48:12,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:48:12,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:12,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:12,797 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:12,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:48:12,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 12:48:12,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:48:12,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:48:12,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-16 12:48:13,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:48:13,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41072412] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:13,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:48:13,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-16 12:48:13,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742150443] [2022-11-16 12:48:13,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:13,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:48:13,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:13,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:48:13,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:48:13,020 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 377 [2022-11-16 12:48:13,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 355 transitions, 1030 flow. Second operand has 5 states, 5 states have (on average 310.2) internal successors, (1551), 5 states have internal predecessors, (1551), 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-11-16 12:48:13,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:13,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 377 [2022-11-16 12:48:13,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:13,243 INFO L130 PetriNetUnfolder]: 13/557 cut-off events. [2022-11-16 12:48:13,243 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-11-16 12:48:13,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 557 events. 13/557 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2435 event pairs, 0 based on Foata normal form. 1/500 useless extension candidates. Maximal degree in co-relation 530. Up to 17 conditions per place. [2022-11-16 12:48:13,254 INFO L137 encePairwiseOnDemand]: 373/377 looper letters, 13 selfloop transitions, 5 changer transitions 0/354 dead transitions. [2022-11-16 12:48:13,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 354 transitions, 1062 flow [2022-11-16 12:48:13,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:48:13,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-16 12:48:13,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1243 transitions. [2022-11-16 12:48:13,258 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8242705570291777 [2022-11-16 12:48:13,258 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1243 transitions. [2022-11-16 12:48:13,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1243 transitions. [2022-11-16 12:48:13,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:13,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1243 transitions. [2022-11-16 12:48:13,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 310.75) internal successors, (1243), 4 states have internal predecessors, (1243), 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-11-16 12:48:13,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 377.0) internal successors, (1885), 5 states have internal predecessors, (1885), 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-11-16 12:48:13,270 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 377.0) internal successors, (1885), 5 states have internal predecessors, (1885), 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-11-16 12:48:13,270 INFO L175 Difference]: Start difference. First operand has 389 places, 355 transitions, 1030 flow. Second operand 4 states and 1243 transitions. [2022-11-16 12:48:13,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 354 transitions, 1062 flow [2022-11-16 12:48:13,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 354 transitions, 1016 flow, removed 5 selfloop flow, removed 18 redundant places. [2022-11-16 12:48:13,282 INFO L231 Difference]: Finished difference. Result has 373 places, 354 transitions, 990 flow [2022-11-16 12:48:13,283 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=980, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=990, PETRI_PLACES=373, PETRI_TRANSITIONS=354} [2022-11-16 12:48:13,283 INFO L288 CegarLoopForPetriNet]: 322 programPoint places, 51 predicate places. [2022-11-16 12:48:13,284 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 354 transitions, 990 flow [2022-11-16 12:48:13,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 310.2) internal successors, (1551), 5 states have internal predecessors, (1551), 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-11-16 12:48:13,285 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:13,285 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 12:48:13,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:13,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:13,491 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-16 12:48:13,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:13,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1096350380, now seen corresponding path program 1 times [2022-11-16 12:48:13,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:13,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623512717] [2022-11-16 12:48:13,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:13,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:14,153 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-16 12:48:14,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:14,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623512717] [2022-11-16 12:48:14,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623512717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:14,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:14,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:48:14,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447603176] [2022-11-16 12:48:14,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:14,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:48:14,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:14,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:48:14,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:48:14,160 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 377 [2022-11-16 12:48:14,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 354 transitions, 990 flow. Second operand has 11 states, 11 states have (on average 266.3636363636364) internal successors, (2930), 11 states have internal predecessors, (2930), 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-11-16 12:48:14,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:14,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 377 [2022-11-16 12:48:14,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:26,327 INFO L130 PetriNetUnfolder]: 11432/43314 cut-off events. [2022-11-16 12:48:26,327 INFO L131 PetriNetUnfolder]: For 774/784 co-relation queries the response was YES. [2022-11-16 12:48:26,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60093 conditions, 43314 events. 11432/43314 cut-off events. For 774/784 co-relation queries the response was YES. Maximal size of possible extension queue 1363. Compared 602310 event pairs, 1828 based on Foata normal form. 1/37372 useless extension candidates. Maximal degree in co-relation 59826. Up to 8352 conditions per place. [2022-11-16 12:48:27,001 INFO L137 encePairwiseOnDemand]: 357/377 looper letters, 320 selfloop transitions, 71 changer transitions 0/686 dead transitions. [2022-11-16 12:48:27,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 686 transitions, 2517 flow [2022-11-16 12:48:27,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 12:48:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-16 12:48:27,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 6739 transitions. [2022-11-16 12:48:27,011 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7448054818744474 [2022-11-16 12:48:27,011 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 6739 transitions. [2022-11-16 12:48:27,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 6739 transitions. [2022-11-16 12:48:27,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:27,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 6739 transitions. [2022-11-16 12:48:27,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 280.7916666666667) internal successors, (6739), 24 states have internal predecessors, (6739), 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-11-16 12:48:27,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 377.0) internal successors, (9425), 25 states have internal predecessors, (9425), 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-11-16 12:48:27,042 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 377.0) internal successors, (9425), 25 states have internal predecessors, (9425), 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-11-16 12:48:27,042 INFO L175 Difference]: Start difference. First operand has 373 places, 354 transitions, 990 flow. Second operand 24 states and 6739 transitions. [2022-11-16 12:48:27,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 686 transitions, 2517 flow [2022-11-16 12:48:27,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 686 transitions, 2507 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 12:48:27,064 INFO L231 Difference]: Finished difference. Result has 411 places, 440 transitions, 1548 flow [2022-11-16 12:48:27,065 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=980, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1548, PETRI_PLACES=411, PETRI_TRANSITIONS=440} [2022-11-16 12:48:27,066 INFO L288 CegarLoopForPetriNet]: 322 programPoint places, 89 predicate places. [2022-11-16 12:48:27,066 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 440 transitions, 1548 flow [2022-11-16 12:48:27,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 266.3636363636364) internal successors, (2930), 11 states have internal predecessors, (2930), 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-11-16 12:48:27,068 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:27,068 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 12:48:27,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 12:48:27,068 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-16 12:48:27,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:27,069 INFO L85 PathProgramCache]: Analyzing trace with hash 255317849, now seen corresponding path program 1 times [2022-11-16 12:48:27,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:27,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425752364] [2022-11-16 12:48:27,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:27,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-16 12:48:27,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:27,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425752364] [2022-11-16 12:48:27,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425752364] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:27,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426806129] [2022-11-16 12:48:27,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:27,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:27,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:27,215 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:27,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 12:48:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:27,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:48:27,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2022-11-16 12:48:27,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:48:27,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426806129] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:27,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:48:27,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-16 12:48:27,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903821293] [2022-11-16 12:48:27,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:27,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:48:27,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:27,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:48:27,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:48:27,411 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 377 [2022-11-16 12:48:27,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 440 transitions, 1548 flow. Second operand has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:48:27,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:27,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 377 [2022-11-16 12:48:27,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:28,950 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1308] t_funEXIT-->L958-4: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_7|} AuxVars[] AssignedVars[][380], [t_funThread1of2ForFork0NotInUse, Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), 2296#true, t_funThread2of2ForFork0NotInUse, Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), 744#true, 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), 268#L958-4true, Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-16 12:48:28,950 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-16 12:48:28,950 INFO L386 tUnfolder$Statistics]: existing Event has 180 ancestors and is cut-off event [2022-11-16 12:48:28,950 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 12:48:28,950 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 12:48:29,200 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1308] t_funEXIT-->L958-4: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_7|} AuxVars[] AssignedVars[][380], [t_funThread1of2ForFork0NotInUse, 2296#true, Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), 18#t_funENTRYtrue, t_funThread2of2ForFork0InUse, Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), 744#true, 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 268#L958-4true, Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-16 12:48:29,201 INFO L383 tUnfolder$Statistics]: this new event has 234 ancestors and is cut-off event [2022-11-16 12:48:29,201 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-16 12:48:29,201 INFO L386 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-11-16 12:48:29,201 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-16 12:48:29,208 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] t_funEXIT-->L958-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][414], [Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), 2296#true, t_funThread1of2ForFork0InUse, Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread2of2ForFork0NotInUse, Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), 744#true, 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 268#L958-4true, Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), 249#t_funENTRYtrue, Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-16 12:48:29,208 INFO L383 tUnfolder$Statistics]: this new event has 234 ancestors and is cut-off event [2022-11-16 12:48:29,208 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-16 12:48:29,209 INFO L386 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-11-16 12:48:29,209 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-16 12:48:29,287 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] t_funEXIT-->L958-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][414], [Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread1of2ForFork0InUse, 2296#true, Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread2of2ForFork0NotInUse, Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), 744#true, 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, 37#L947-2true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), 268#L958-4true, Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-16 12:48:29,288 INFO L383 tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event [2022-11-16 12:48:29,288 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 12:48:29,289 INFO L386 tUnfolder$Statistics]: existing Event has 228 ancestors and is cut-off event [2022-11-16 12:48:29,289 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is cut-off event [2022-11-16 12:48:29,334 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1308] t_funEXIT-->L958-4: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_7|} AuxVars[] AssignedVars[][380], [t_funThread1of2ForFork0NotInUse, Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), 2296#true, Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread2of2ForFork0InUse, Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), 744#true, 231#L941-10true, 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), 268#L958-4true, Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-16 12:48:29,334 INFO L383 tUnfolder$Statistics]: this new event has 243 ancestors and is cut-off event [2022-11-16 12:48:29,334 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-16 12:48:29,335 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-16 12:48:29,335 INFO L386 tUnfolder$Statistics]: existing Event has 255 ancestors and is cut-off event [2022-11-16 12:48:29,335 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] t_funEXIT-->L958-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][414], [Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread1of2ForFork0InUse, 2296#true, Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread2of2ForFork0NotInUse, Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), 744#true, 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), 14#L940true, Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), 268#L958-4true, Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-16 12:48:29,335 INFO L383 tUnfolder$Statistics]: this new event has 242 ancestors and is cut-off event [2022-11-16 12:48:29,335 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-16 12:48:29,335 INFO L386 tUnfolder$Statistics]: existing Event has 230 ancestors and is cut-off event [2022-11-16 12:48:29,336 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-16 12:48:29,400 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] t_funEXIT-->L958-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][414], [t_funThread1of2ForFork0NotInUse, Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), 2296#true, Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread2of2ForFork0NotInUse, Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 744#true, 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), 268#L958-4true, Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-16 12:48:29,401 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-16 12:48:29,401 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:48:29,401 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-16 12:48:29,402 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-16 12:48:29,458 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([891] L954-17-->L954-18: Formula: (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t_ids~0#1.base_5| 0)) InVars {ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid][376], [t_funThread1of2ForFork0NotInUse, Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), 2296#true, Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread2of2ForFork0InUse, Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 2230#(= 3 |~#cache~0.base|), 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 744#true, 231#L941-10true, 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), Black: 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 12#L954-18true, 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-16 12:48:29,458 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-16 12:48:29,459 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 12:48:29,459 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-16 12:48:29,459 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is cut-off event [2022-11-16 12:48:29,460 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1309] t_funEXIT-->L958-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][414], [t_funThread1of2ForFork0NotInUse, Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), 2296#true, Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread2of2ForFork0NotInUse, Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), 744#true, 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 268#L958-4true, Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-16 12:48:29,460 INFO L383 tUnfolder$Statistics]: this new event has 249 ancestors and is cut-off event [2022-11-16 12:48:29,460 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-16 12:48:29,461 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-16 12:48:29,461 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-16 12:48:29,461 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-16 12:48:29,505 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] t_funEXIT-->L958-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem57#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][414], [Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), 2296#true, t_funThread1of2ForFork0InUse, Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread2of2ForFork0NotInUse, Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 744#true, 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), 97#L941-6true, Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), 268#L958-4true, Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-16 12:48:29,506 INFO L383 tUnfolder$Statistics]: this new event has 251 ancestors and is cut-off event [2022-11-16 12:48:29,506 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 12:48:29,506 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-16 12:48:29,506 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-16 12:48:29,957 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1150] L947-1-->L947-2: Formula: (and (= (+ (* |v_t_funThread1of2ForFork0_~i~0#1_9| 28) |v_~#cache~0.offset_9|) |v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset_1|) (= |v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base_1| |v_~#cache~0.base_10|)) InVars {~#cache~0.offset=|v_~#cache~0.offset_9|, ~#cache~0.base=|v_~#cache~0.base_10|, t_funThread1of2ForFork0_~i~0#1=|v_t_funThread1of2ForFork0_~i~0#1_9|} OutVars{~#cache~0.offset=|v_~#cache~0.offset_9|, ~#cache~0.base=|v_~#cache~0.base_10|, t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base=|v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base_1|, t_funThread1of2ForFork0_~i~0#1=|v_t_funThread1of2ForFork0_~i~0#1_9|, t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset=|v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset_1|} AuxVars[] AssignedVars[t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset, t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base][202], [Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread1of2ForFork0InUse, 2296#true, Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread2of2ForFork0InUse, Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 283#L959true, 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 744#true, 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), 231#L941-10true, 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, 37#L947-2true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-16 12:48:29,957 INFO L383 tUnfolder$Statistics]: this new event has 244 ancestors and is cut-off event [2022-11-16 12:48:29,958 INFO L386 tUnfolder$Statistics]: existing Event has 232 ancestors and is cut-off event [2022-11-16 12:48:29,958 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-16 12:48:29,958 INFO L386 tUnfolder$Statistics]: existing Event has 244 ancestors and is cut-off event [2022-11-16 12:48:30,062 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([891] L954-17-->L954-18: Formula: (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t_ids~0#1.base_5| 0)) InVars {ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid][376], [Black: 1620#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread1of2ForFork0InUse, 2296#true, Black: 1603#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread2of2ForFork0NotInUse, 154#L941-10true, Black: 1231#(<= |ULTIMATE.start_main_~i~1#1| 7), 2230#(= 3 |~#cache~0.base|), 459#true, Black: 327#(= |ULTIMATE.start_main_~i~1#1| 0), 744#true, 1215#true, Black: 463#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 631#(< |ULTIMATE.start_main_~i~1#1| 10), 753#true, Black: 739#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2248#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 2266#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 737#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 2262#(and (= 3 |~#cache~0.base|) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2256#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2258#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2232#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2231#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1)), Black: 2260#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)), Black: 2264#(and (= 3 |~#cache~0.base|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2246#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2244#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2254#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2276#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2242#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2240#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 2252#(and (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), Black: 2270#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 3 |~#cache~0.base|) (= (select |#valid| 3) 1) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0)), 12#L954-18true, 335#true, Black: 1066#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1089#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 761#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1049#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-16 12:48:30,063 INFO L383 tUnfolder$Statistics]: this new event has 264 ancestors and is cut-off event [2022-11-16 12:48:30,063 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-16 12:48:30,063 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-16 12:48:30,064 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 12:48:30,064 INFO L130 PetriNetUnfolder]: 663/7652 cut-off events. [2022-11-16 12:48:30,064 INFO L131 PetriNetUnfolder]: For 3530/3732 co-relation queries the response was YES. [2022-11-16 12:48:30,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10481 conditions, 7652 events. 663/7652 cut-off events. For 3530/3732 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 83652 event pairs, 79 based on Foata normal form. 25/6631 useless extension candidates. Maximal degree in co-relation 10285. Up to 251 conditions per place. [2022-11-16 12:48:30,289 INFO L137 encePairwiseOnDemand]: 374/377 looper letters, 14 selfloop transitions, 2 changer transitions 0/444 dead transitions. [2022-11-16 12:48:30,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 444 transitions, 1588 flow [2022-11-16 12:48:30,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:48:30,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:48:30,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 950 transitions. [2022-11-16 12:48:30,293 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8399646330680813 [2022-11-16 12:48:30,293 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 950 transitions. [2022-11-16 12:48:30,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 950 transitions. [2022-11-16 12:48:30,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:30,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 950 transitions. [2022-11-16 12:48:30,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 316.6666666666667) internal successors, (950), 3 states have internal predecessors, (950), 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-11-16 12:48:30,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 377.0) internal successors, (1508), 4 states have internal predecessors, (1508), 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-11-16 12:48:30,300 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 377.0) internal successors, (1508), 4 states have internal predecessors, (1508), 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-11-16 12:48:30,300 INFO L175 Difference]: Start difference. First operand has 411 places, 440 transitions, 1548 flow. Second operand 3 states and 950 transitions. [2022-11-16 12:48:30,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 444 transitions, 1588 flow [2022-11-16 12:48:30,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 444 transitions, 1587 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:48:30,339 INFO L231 Difference]: Finished difference. Result has 413 places, 441 transitions, 1559 flow [2022-11-16 12:48:30,340 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=1547, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1559, PETRI_PLACES=413, PETRI_TRANSITIONS=441} [2022-11-16 12:48:30,340 INFO L288 CegarLoopForPetriNet]: 322 programPoint places, 91 predicate places. [2022-11-16 12:48:30,341 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 441 transitions, 1559 flow [2022-11-16 12:48:30,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:48:30,341 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:30,342 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 3, 2, 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] [2022-11-16 12:48:30,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:30,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:30,549 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-16 12:48:30,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:30,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1911635379, now seen corresponding path program 1 times [2022-11-16 12:48:30,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:30,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857548828] [2022-11-16 12:48:30,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:30,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:48:30,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:48:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:48:30,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:48:30,653 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:48:30,653 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 35 remaining) [2022-11-16 12:48:30,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 35 remaining) [2022-11-16 12:48:30,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 35 remaining) [2022-11-16 12:48:30,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 35 remaining) [2022-11-16 12:48:30,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 35 remaining) [2022-11-16 12:48:30,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 35 remaining) [2022-11-16 12:48:30,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 35 remaining) [2022-11-16 12:48:30,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 35 remaining) [2022-11-16 12:48:30,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 35 remaining) [2022-11-16 12:48:30,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 35 remaining) [2022-11-16 12:48:30,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 35 remaining) [2022-11-16 12:48:30,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 35 remaining) [2022-11-16 12:48:30,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 35 remaining) [2022-11-16 12:48:30,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 35 remaining) [2022-11-16 12:48:30,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 35 remaining) [2022-11-16 12:48:30,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 35 remaining) [2022-11-16 12:48:30,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 35 remaining) [2022-11-16 12:48:30,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 35 remaining) [2022-11-16 12:48:30,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 35 remaining) [2022-11-16 12:48:30,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 35 remaining) [2022-11-16 12:48:30,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 35 remaining) [2022-11-16 12:48:30,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 35 remaining) [2022-11-16 12:48:30,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 35 remaining) [2022-11-16 12:48:30,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 35 remaining) [2022-11-16 12:48:30,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 35 remaining) [2022-11-16 12:48:30,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 35 remaining) [2022-11-16 12:48:30,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 35 remaining) [2022-11-16 12:48:30,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 35 remaining) [2022-11-16 12:48:30,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 35 remaining) [2022-11-16 12:48:30,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 35 remaining) [2022-11-16 12:48:30,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 35 remaining) [2022-11-16 12:48:30,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 35 remaining) [2022-11-16 12:48:30,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 35 remaining) [2022-11-16 12:48:30,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 35 remaining) [2022-11-16 12:48:30,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 35 remaining) [2022-11-16 12:48:30,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 12:48:30,664 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:30,665 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 12:48:30,666 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-16 12:48:30,745 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 12:48:30,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 393 places, 461 transitions, 952 flow [2022-11-16 12:48:30,974 INFO L130 PetriNetUnfolder]: 168/1038 cut-off events. [2022-11-16 12:48:30,974 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-16 12:48:30,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1066 conditions, 1038 events. 168/1038 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5994 event pairs, 1 based on Foata normal form. 0/786 useless extension candidates. Maximal degree in co-relation 730. Up to 16 conditions per place. [2022-11-16 12:48:30,991 INFO L82 GeneralOperation]: Start removeDead. Operand has 393 places, 461 transitions, 952 flow [2022-11-16 12:48:31,012 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 393 places, 461 transitions, 952 flow [2022-11-16 12:48:31,014 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:48:31,015 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@aff0779, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:48:31,015 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-11-16 12:48:31,020 INFO L130 PetriNetUnfolder]: 1/30 cut-off events. [2022-11-16 12:48:31,021 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:48:31,021 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:31,021 INFO L209 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] [2022-11-16 12:48:31,021 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-16 12:48:31,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:31,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1444119021, now seen corresponding path program 1 times [2022-11-16 12:48:31,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:31,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836478747] [2022-11-16 12:48:31,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:31,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:31,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:48:31,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:31,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836478747] [2022-11-16 12:48:31,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836478747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:31,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:31,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:48:31,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116540866] [2022-11-16 12:48:31,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:31,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:48:31,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:31,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:48:31,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:48:31,081 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 461 [2022-11-16 12:48:31,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 461 transitions, 952 flow. Second operand has 4 states, 4 states have (on average 377.5) internal successors, (1510), 4 states have internal predecessors, (1510), 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-11-16 12:48:31,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:31,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 461 [2022-11-16 12:48:31,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:31,612 INFO L130 PetriNetUnfolder]: 27/893 cut-off events. [2022-11-16 12:48:31,612 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-11-16 12:48:31,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 893 events. 27/893 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5178 event pairs, 1 based on Foata normal form. 255/1026 useless extension candidates. Maximal degree in co-relation 653. Up to 28 conditions per place. [2022-11-16 12:48:31,633 INFO L137 encePairwiseOnDemand]: 392/461 looper letters, 21 selfloop transitions, 4 changer transitions 0/401 dead transitions. [2022-11-16 12:48:31,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 401 transitions, 882 flow [2022-11-16 12:48:31,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:48:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 12:48:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1971 transitions. [2022-11-16 12:48:31,636 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8550976138828633 [2022-11-16 12:48:31,637 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1971 transitions. [2022-11-16 12:48:31,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1971 transitions. [2022-11-16 12:48:31,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:31,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1971 transitions. [2022-11-16 12:48:31,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 394.2) internal successors, (1971), 5 states have internal predecessors, (1971), 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-11-16 12:48:31,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 461.0) internal successors, (2766), 6 states have internal predecessors, (2766), 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-11-16 12:48:31,646 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 461.0) internal successors, (2766), 6 states have internal predecessors, (2766), 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-11-16 12:48:31,647 INFO L175 Difference]: Start difference. First operand has 393 places, 461 transitions, 952 flow. Second operand 5 states and 1971 transitions. [2022-11-16 12:48:31,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 401 transitions, 882 flow [2022-11-16 12:48:31,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 401 transitions, 882 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:48:31,655 INFO L231 Difference]: Finished difference. Result has 395 places, 397 transitions, 850 flow [2022-11-16 12:48:31,656 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=850, PETRI_PLACES=395, PETRI_TRANSITIONS=397} [2022-11-16 12:48:31,657 INFO L288 CegarLoopForPetriNet]: 393 programPoint places, 2 predicate places. [2022-11-16 12:48:31,657 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 397 transitions, 850 flow [2022-11-16 12:48:31,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 377.5) internal successors, (1510), 4 states have internal predecessors, (1510), 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-11-16 12:48:31,658 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:31,658 INFO L209 CegarLoopForPetriNet]: trace histogram [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] [2022-11-16 12:48:31,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 12:48:31,659 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-16 12:48:31,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:31,659 INFO L85 PathProgramCache]: Analyzing trace with hash -431308176, now seen corresponding path program 1 times [2022-11-16 12:48:31,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:31,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115710725] [2022-11-16 12:48:31,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:31,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:48:31,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:31,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115710725] [2022-11-16 12:48:31,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115710725] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:31,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:31,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:48:31,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189120910] [2022-11-16 12:48:31,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:31,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:48:31,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:31,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:48:31,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:48:31,705 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 461 [2022-11-16 12:48:31,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 397 transitions, 850 flow. Second operand has 4 states, 4 states have (on average 379.25) internal successors, (1517), 4 states have internal predecessors, (1517), 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-11-16 12:48:31,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:31,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 461 [2022-11-16 12:48:31,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:31,962 INFO L130 PetriNetUnfolder]: 27/892 cut-off events. [2022-11-16 12:48:31,962 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-11-16 12:48:31,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 892 events. 27/892 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5168 event pairs, 1 based on Foata normal form. 1/774 useless extension candidates. Maximal degree in co-relation 915. Up to 20 conditions per place. [2022-11-16 12:48:31,988 INFO L137 encePairwiseOnDemand]: 455/461 looper letters, 13 selfloop transitions, 8 changer transitions 0/397 dead transitions. [2022-11-16 12:48:31,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 397 transitions, 890 flow [2022-11-16 12:48:31,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:48:31,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 12:48:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1899 transitions. [2022-11-16 12:48:31,992 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8238611713665943 [2022-11-16 12:48:31,992 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1899 transitions. [2022-11-16 12:48:31,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1899 transitions. [2022-11-16 12:48:31,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:31,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1899 transitions. [2022-11-16 12:48:31,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 379.8) internal successors, (1899), 5 states have internal predecessors, (1899), 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-11-16 12:48:32,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 461.0) internal successors, (2766), 6 states have internal predecessors, (2766), 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-11-16 12:48:32,001 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 461.0) internal successors, (2766), 6 states have internal predecessors, (2766), 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-11-16 12:48:32,001 INFO L175 Difference]: Start difference. First operand has 395 places, 397 transitions, 850 flow. Second operand 5 states and 1899 transitions. [2022-11-16 12:48:32,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 397 transitions, 890 flow [2022-11-16 12:48:32,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 397 transitions, 888 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:48:32,013 INFO L231 Difference]: Finished difference. Result has 398 places, 397 transitions, 868 flow [2022-11-16 12:48:32,013 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=868, PETRI_PLACES=398, PETRI_TRANSITIONS=397} [2022-11-16 12:48:32,014 INFO L288 CegarLoopForPetriNet]: 393 programPoint places, 5 predicate places. [2022-11-16 12:48:32,014 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 397 transitions, 868 flow [2022-11-16 12:48:32,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 379.25) internal successors, (1517), 4 states have internal predecessors, (1517), 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-11-16 12:48:32,015 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:32,015 INFO L209 CegarLoopForPetriNet]: trace histogram [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] [2022-11-16 12:48:32,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 12:48:32,016 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-16 12:48:32,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:32,016 INFO L85 PathProgramCache]: Analyzing trace with hash -485649989, now seen corresponding path program 1 times [2022-11-16 12:48:32,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:32,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644808491] [2022-11-16 12:48:32,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:32,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:32,088 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:48:32,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:32,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644808491] [2022-11-16 12:48:32,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644808491] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:32,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352736070] [2022-11-16 12:48:32,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:32,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:32,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:32,091 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:32,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 12:48:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:32,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:48:32,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:32,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:48:32,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:48:32,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352736070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:32,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:48:32,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-16 12:48:32,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495567130] [2022-11-16 12:48:32,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:32,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:48:32,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:32,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:48:32,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:48:32,286 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 461 [2022-11-16 12:48:32,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 397 transitions, 868 flow. Second operand has 5 states, 5 states have (on average 378.8) internal successors, (1894), 5 states have internal predecessors, (1894), 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-11-16 12:48:32,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:32,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 461 [2022-11-16 12:48:32,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:32,540 INFO L130 PetriNetUnfolder]: 27/891 cut-off events. [2022-11-16 12:48:32,541 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2022-11-16 12:48:32,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 891 events. 27/891 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5165 event pairs, 1 based on Foata normal form. 1/773 useless extension candidates. Maximal degree in co-relation 913. Up to 23 conditions per place. [2022-11-16 12:48:32,566 INFO L137 encePairwiseOnDemand]: 457/461 looper letters, 15 selfloop transitions, 5 changer transitions 0/396 dead transitions. [2022-11-16 12:48:32,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 396 transitions, 904 flow [2022-11-16 12:48:32,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:48:32,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-16 12:48:32,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1521 transitions. [2022-11-16 12:48:32,570 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8248373101952278 [2022-11-16 12:48:32,570 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1521 transitions. [2022-11-16 12:48:32,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1521 transitions. [2022-11-16 12:48:32,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:32,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1521 transitions. [2022-11-16 12:48:32,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 380.25) internal successors, (1521), 4 states have internal predecessors, (1521), 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-11-16 12:48:32,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 461.0) internal successors, (2305), 5 states have internal predecessors, (2305), 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-11-16 12:48:32,577 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 461.0) internal successors, (2305), 5 states have internal predecessors, (2305), 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-11-16 12:48:32,577 INFO L175 Difference]: Start difference. First operand has 398 places, 397 transitions, 868 flow. Second operand 4 states and 1521 transitions. [2022-11-16 12:48:32,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 396 transitions, 904 flow [2022-11-16 12:48:32,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 396 transitions, 892 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 12:48:32,586 INFO L231 Difference]: Finished difference. Result has 397 places, 396 transitions, 862 flow [2022-11-16 12:48:32,587 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=862, PETRI_PLACES=397, PETRI_TRANSITIONS=396} [2022-11-16 12:48:32,587 INFO L288 CegarLoopForPetriNet]: 393 programPoint places, 4 predicate places. [2022-11-16 12:48:32,588 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 396 transitions, 862 flow [2022-11-16 12:48:32,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 378.8) internal successors, (1894), 5 states have internal predecessors, (1894), 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-11-16 12:48:32,589 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:32,589 INFO L209 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] [2022-11-16 12:48:32,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:32,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:32,795 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-16 12:48:32,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:32,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2094493468, now seen corresponding path program 1 times [2022-11-16 12:48:32,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:32,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771361936] [2022-11-16 12:48:32,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:32,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:48:32,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:32,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771361936] [2022-11-16 12:48:32,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771361936] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:32,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90518860] [2022-11-16 12:48:32,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:32,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:32,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:32,856 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:32,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 12:48:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:33,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:48:33,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:33,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:48:33,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:48:33,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:48:33,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90518860] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:48:33,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:48:33,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-16 12:48:33,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397615015] [2022-11-16 12:48:33,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:48:33,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:48:33,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:33,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:48:33,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:48:33,090 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 461 [2022-11-16 12:48:33,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 396 transitions, 862 flow. Second operand has 10 states, 10 states have (on average 378.7) internal successors, (3787), 10 states have internal predecessors, (3787), 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-11-16 12:48:33,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:33,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 461 [2022-11-16 12:48:33,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:33,516 INFO L130 PetriNetUnfolder]: 27/899 cut-off events. [2022-11-16 12:48:33,516 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-11-16 12:48:33,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 899 events. 27/899 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5157 event pairs, 1 based on Foata normal form. 2/782 useless extension candidates. Maximal degree in co-relation 903. Up to 20 conditions per place. [2022-11-16 12:48:33,540 INFO L137 encePairwiseOnDemand]: 455/461 looper letters, 22 selfloop transitions, 9 changer transitions 0/407 dead transitions. [2022-11-16 12:48:33,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 407 transitions, 962 flow [2022-11-16 12:48:33,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:48:33,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 12:48:33,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3417 transitions. [2022-11-16 12:48:33,548 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8235719450469993 [2022-11-16 12:48:33,548 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3417 transitions. [2022-11-16 12:48:33,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3417 transitions. [2022-11-16 12:48:33,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:33,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3417 transitions. [2022-11-16 12:48:33,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 379.6666666666667) internal successors, (3417), 9 states have internal predecessors, (3417), 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-11-16 12:48:33,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 461.0) internal successors, (4610), 10 states have internal predecessors, (4610), 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-11-16 12:48:33,578 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 461.0) internal successors, (4610), 10 states have internal predecessors, (4610), 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-11-16 12:48:33,579 INFO L175 Difference]: Start difference. First operand has 397 places, 396 transitions, 862 flow. Second operand 9 states and 3417 transitions. [2022-11-16 12:48:33,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 407 transitions, 962 flow [2022-11-16 12:48:33,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 407 transitions, 948 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 12:48:33,588 INFO L231 Difference]: Finished difference. Result has 406 places, 400 transitions, 908 flow [2022-11-16 12:48:33,589 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=908, PETRI_PLACES=406, PETRI_TRANSITIONS=400} [2022-11-16 12:48:33,590 INFO L288 CegarLoopForPetriNet]: 393 programPoint places, 13 predicate places. [2022-11-16 12:48:33,590 INFO L495 AbstractCegarLoop]: Abstraction has has 406 places, 400 transitions, 908 flow [2022-11-16 12:48:33,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 378.7) internal successors, (3787), 10 states have internal predecessors, (3787), 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-11-16 12:48:33,591 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:33,592 INFO L209 CegarLoopForPetriNet]: trace histogram [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] [2022-11-16 12:48:33,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:33,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-16 12:48:33,799 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-16 12:48:33,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:33,801 INFO L85 PathProgramCache]: Analyzing trace with hash -135780932, now seen corresponding path program 2 times [2022-11-16 12:48:33,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:33,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829496263] [2022-11-16 12:48:33,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:33,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:33,868 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 12:48:33,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:33,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829496263] [2022-11-16 12:48:33,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829496263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:33,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:33,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:48:33,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399509585] [2022-11-16 12:48:33,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:33,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:48:33,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:33,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:48:33,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:48:33,873 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 461 [2022-11-16 12:48:33,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 400 transitions, 908 flow. Second operand has 4 states, 4 states have (on average 377.75) internal successors, (1511), 4 states have internal predecessors, (1511), 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-11-16 12:48:33,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:33,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 461 [2022-11-16 12:48:33,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:34,147 INFO L130 PetriNetUnfolder]: 23/783 cut-off events. [2022-11-16 12:48:34,148 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-11-16 12:48:34,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 783 events. 23/783 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4310 event pairs, 1 based on Foata normal form. 0/682 useless extension candidates. Maximal degree in co-relation 819. Up to 40 conditions per place. [2022-11-16 12:48:34,175 INFO L137 encePairwiseOnDemand]: 454/461 looper letters, 21 selfloop transitions, 4 changer transitions 0/407 dead transitions. [2022-11-16 12:48:34,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 407 transitions, 972 flow [2022-11-16 12:48:34,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:48:34,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 12:48:34,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1908 transitions. [2022-11-16 12:48:34,179 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.827765726681128 [2022-11-16 12:48:34,179 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1908 transitions. [2022-11-16 12:48:34,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1908 transitions. [2022-11-16 12:48:34,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:34,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1908 transitions. [2022-11-16 12:48:34,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 381.6) internal successors, (1908), 5 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:48:34,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 461.0) internal successors, (2766), 6 states have internal predecessors, (2766), 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-11-16 12:48:34,188 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 461.0) internal successors, (2766), 6 states have internal predecessors, (2766), 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-11-16 12:48:34,188 INFO L175 Difference]: Start difference. First operand has 406 places, 400 transitions, 908 flow. Second operand 5 states and 1908 transitions. [2022-11-16 12:48:34,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 407 transitions, 972 flow [2022-11-16 12:48:34,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 407 transitions, 956 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-16 12:48:34,198 INFO L231 Difference]: Finished difference. Result has 409 places, 403 transitions, 924 flow [2022-11-16 12:48:34,199 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=924, PETRI_PLACES=409, PETRI_TRANSITIONS=403} [2022-11-16 12:48:34,200 INFO L288 CegarLoopForPetriNet]: 393 programPoint places, 16 predicate places. [2022-11-16 12:48:34,201 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 403 transitions, 924 flow [2022-11-16 12:48:34,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 377.75) internal successors, (1511), 4 states have internal predecessors, (1511), 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-11-16 12:48:34,201 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:34,202 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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] [2022-11-16 12:48:34,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-16 12:48:34,202 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-16 12:48:34,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:34,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1310307541, now seen corresponding path program 1 times [2022-11-16 12:48:34,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:34,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610323121] [2022-11-16 12:48:34,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:34,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-16 12:48:34,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:34,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610323121] [2022-11-16 12:48:34,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610323121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:34,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:34,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:48:34,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073965286] [2022-11-16 12:48:34,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:34,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:48:34,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:34,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:48:34,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:48:34,281 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 461 [2022-11-16 12:48:34,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 403 transitions, 924 flow. Second operand has 4 states, 4 states have (on average 379.75) internal successors, (1519), 4 states have internal predecessors, (1519), 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-11-16 12:48:34,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:34,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 461 [2022-11-16 12:48:34,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:34,551 INFO L130 PetriNetUnfolder]: 23/781 cut-off events. [2022-11-16 12:48:34,551 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-11-16 12:48:34,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 781 events. 23/781 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4290 event pairs, 1 based on Foata normal form. 2/689 useless extension candidates. Maximal degree in co-relation 829. Up to 20 conditions per place. [2022-11-16 12:48:34,579 INFO L137 encePairwiseOnDemand]: 455/461 looper letters, 13 selfloop transitions, 8 changer transitions 0/403 dead transitions. [2022-11-16 12:48:34,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 403 transitions, 964 flow [2022-11-16 12:48:34,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:48:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 12:48:34,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1899 transitions. [2022-11-16 12:48:34,583 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8238611713665943 [2022-11-16 12:48:34,583 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1899 transitions. [2022-11-16 12:48:34,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1899 transitions. [2022-11-16 12:48:34,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:34,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1899 transitions. [2022-11-16 12:48:34,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 379.8) internal successors, (1899), 5 states have internal predecessors, (1899), 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-11-16 12:48:34,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 461.0) internal successors, (2766), 6 states have internal predecessors, (2766), 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-11-16 12:48:34,591 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 461.0) internal successors, (2766), 6 states have internal predecessors, (2766), 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-11-16 12:48:34,591 INFO L175 Difference]: Start difference. First operand has 409 places, 403 transitions, 924 flow. Second operand 5 states and 1899 transitions. [2022-11-16 12:48:34,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 403 transitions, 964 flow [2022-11-16 12:48:34,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 403 transitions, 962 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:48:34,601 INFO L231 Difference]: Finished difference. Result has 412 places, 403 transitions, 942 flow [2022-11-16 12:48:34,602 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=942, PETRI_PLACES=412, PETRI_TRANSITIONS=403} [2022-11-16 12:48:34,602 INFO L288 CegarLoopForPetriNet]: 393 programPoint places, 19 predicate places. [2022-11-16 12:48:34,602 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 403 transitions, 942 flow [2022-11-16 12:48:34,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 379.75) internal successors, (1519), 4 states have internal predecessors, (1519), 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-11-16 12:48:34,603 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:34,603 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-11-16 12:48:34,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-16 12:48:34,604 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-16 12:48:34,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:34,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1964829607, now seen corresponding path program 1 times [2022-11-16 12:48:34,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:34,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331379140] [2022-11-16 12:48:34,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:34,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:34,762 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:48:34,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:34,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331379140] [2022-11-16 12:48:34,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331379140] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:34,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182727600] [2022-11-16 12:48:34,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:34,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:34,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:34,765 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:34,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 12:48:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:34,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 12:48:34,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:35,015 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:48:35,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:48:35,143 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:48:35,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182727600] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:48:35,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:48:35,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-16 12:48:35,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379952845] [2022-11-16 12:48:35,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:48:35,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 12:48:35,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:35,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 12:48:35,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:48:35,155 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 461 [2022-11-16 12:48:35,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 403 transitions, 942 flow. Second operand has 18 states, 18 states have (on average 379.1111111111111) internal successors, (6824), 18 states have internal predecessors, (6824), 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-11-16 12:48:35,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:35,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 461 [2022-11-16 12:48:35,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:35,687 INFO L130 PetriNetUnfolder]: 23/809 cut-off events. [2022-11-16 12:48:35,688 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-11-16 12:48:35,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 809 events. 23/809 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4297 event pairs, 1 based on Foata normal form. 4/719 useless extension candidates. Maximal degree in co-relation 819. Up to 20 conditions per place. [2022-11-16 12:48:35,706 INFO L137 encePairwiseOnDemand]: 455/461 looper letters, 38 selfloop transitions, 21 changer transitions 0/438 dead transitions. [2022-11-16 12:48:35,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 438 transitions, 1214 flow [2022-11-16 12:48:35,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 12:48:35,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-16 12:48:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 7959 transitions. [2022-11-16 12:48:35,717 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8221258134490239 [2022-11-16 12:48:35,717 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 7959 transitions. [2022-11-16 12:48:35,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 7959 transitions. [2022-11-16 12:48:35,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:35,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 7959 transitions. [2022-11-16 12:48:35,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 379.0) internal successors, (7959), 21 states have internal predecessors, (7959), 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-11-16 12:48:35,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 461.0) internal successors, (10142), 22 states have internal predecessors, (10142), 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-11-16 12:48:35,746 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 461.0) internal successors, (10142), 22 states have internal predecessors, (10142), 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-11-16 12:48:35,747 INFO L175 Difference]: Start difference. First operand has 412 places, 403 transitions, 942 flow. Second operand 21 states and 7959 transitions. [2022-11-16 12:48:35,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 438 transitions, 1214 flow [2022-11-16 12:48:35,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 438 transitions, 1202 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 12:48:35,758 INFO L231 Difference]: Finished difference. Result has 434 places, 416 transitions, 1086 flow [2022-11-16 12:48:35,758 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1086, PETRI_PLACES=434, PETRI_TRANSITIONS=416} [2022-11-16 12:48:35,759 INFO L288 CegarLoopForPetriNet]: 393 programPoint places, 41 predicate places. [2022-11-16 12:48:35,759 INFO L495 AbstractCegarLoop]: Abstraction has has 434 places, 416 transitions, 1086 flow [2022-11-16 12:48:35,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 379.1111111111111) internal successors, (6824), 18 states have internal predecessors, (6824), 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-11-16 12:48:35,761 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:35,762 INFO L209 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 2, 2, 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] [2022-11-16 12:48:35,771 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-16 12:48:35,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-16 12:48:35,968 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-16 12:48:35,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:35,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2011450983, now seen corresponding path program 2 times [2022-11-16 12:48:35,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:35,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353858610] [2022-11-16 12:48:35,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:35,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:48:36,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:36,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353858610] [2022-11-16 12:48:36,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353858610] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:36,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480830301] [2022-11-16 12:48:36,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:48:36,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:36,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:36,334 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:36,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 12:48:36,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:48:36,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:48:36,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 12:48:36,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:36,655 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:48:36,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:48:36,946 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:48:36,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480830301] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:48:36,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:48:36,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-16 12:48:36,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351645967] [2022-11-16 12:48:36,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:48:36,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 12:48:36,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:36,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 12:48:36,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-16 12:48:36,960 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 461 [2022-11-16 12:48:36,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 416 transitions, 1086 flow. Second operand has 23 states, 23 states have (on average 379.3478260869565) internal successors, (8725), 23 states have internal predecessors, (8725), 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-11-16 12:48:36,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:36,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 461 [2022-11-16 12:48:36,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:37,687 INFO L130 PetriNetUnfolder]: 23/830 cut-off events. [2022-11-16 12:48:37,687 INFO L131 PetriNetUnfolder]: For 274/274 co-relation queries the response was YES. [2022-11-16 12:48:37,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1147 conditions, 830 events. 23/830 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4301 event pairs, 1 based on Foata normal form. 3/739 useless extension candidates. Maximal degree in co-relation 822. Up to 20 conditions per place. [2022-11-16 12:48:37,707 INFO L137 encePairwiseOnDemand]: 455/461 looper letters, 50 selfloop transitions, 30 changer transitions 0/459 dead transitions. [2022-11-16 12:48:37,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 459 transitions, 1456 flow [2022-11-16 12:48:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 12:48:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-16 12:48:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 11363 transitions. [2022-11-16 12:48:37,729 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8216196673897325 [2022-11-16 12:48:37,729 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 11363 transitions. [2022-11-16 12:48:37,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 11363 transitions. [2022-11-16 12:48:37,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:37,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 11363 transitions. [2022-11-16 12:48:37,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 378.76666666666665) internal successors, (11363), 30 states have internal predecessors, (11363), 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-11-16 12:48:37,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 461.0) internal successors, (14291), 31 states have internal predecessors, (14291), 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-11-16 12:48:37,782 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 461.0) internal successors, (14291), 31 states have internal predecessors, (14291), 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-11-16 12:48:37,782 INFO L175 Difference]: Start difference. First operand has 434 places, 416 transitions, 1086 flow. Second operand 30 states and 11363 transitions. [2022-11-16 12:48:37,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 459 transitions, 1456 flow [2022-11-16 12:48:37,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 459 transitions, 1376 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-11-16 12:48:37,798 INFO L231 Difference]: Finished difference. Result has 459 places, 426 transitions, 1184 flow [2022-11-16 12:48:37,799 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1184, PETRI_PLACES=459, PETRI_TRANSITIONS=426} [2022-11-16 12:48:37,799 INFO L288 CegarLoopForPetriNet]: 393 programPoint places, 66 predicate places. [2022-11-16 12:48:37,800 INFO L495 AbstractCegarLoop]: Abstraction has has 459 places, 426 transitions, 1184 flow [2022-11-16 12:48:37,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 379.3478260869565) internal successors, (8725), 23 states have internal predecessors, (8725), 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-11-16 12:48:37,802 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:37,802 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 2, 2, 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] [2022-11-16 12:48:37,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-16 12:48:38,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-16 12:48:38,008 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-16 12:48:38,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:38,009 INFO L85 PathProgramCache]: Analyzing trace with hash -569869532, now seen corresponding path program 3 times [2022-11-16 12:48:38,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:38,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807259977] [2022-11-16 12:48:38,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:38,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-16 12:48:38,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:38,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807259977] [2022-11-16 12:48:38,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807259977] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:48:38,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026413897] [2022-11-16 12:48:38,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:48:38,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:48:38,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:38,189 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:48:38,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 12:48:38,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 12:48:38,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:48:38,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:48:38,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:38,453 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-16 12:48:38,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:48:38,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026413897] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:38,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:48:38,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-16 12:48:38,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224441307] [2022-11-16 12:48:38,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:38,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:48:38,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:38,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:48:38,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:48:38,459 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 461 [2022-11-16 12:48:38,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 426 transitions, 1184 flow. Second operand has 5 states, 5 states have (on average 379.2) internal successors, (1896), 5 states have internal predecessors, (1896), 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-11-16 12:48:38,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:38,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 461 [2022-11-16 12:48:38,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:38,865 INFO L130 PetriNetUnfolder]: 23/828 cut-off events. [2022-11-16 12:48:38,866 INFO L131 PetriNetUnfolder]: For 235/235 co-relation queries the response was YES. [2022-11-16 12:48:38,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 828 events. 23/828 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4288 event pairs, 1 based on Foata normal form. 2/736 useless extension candidates. Maximal degree in co-relation 837. Up to 30 conditions per place. [2022-11-16 12:48:38,894 INFO L137 encePairwiseOnDemand]: 457/461 looper letters, 15 selfloop transitions, 5 changer transitions 0/425 dead transitions. [2022-11-16 12:48:38,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 425 transitions, 1220 flow [2022-11-16 12:48:38,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:48:38,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-16 12:48:38,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1521 transitions. [2022-11-16 12:48:38,898 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8248373101952278 [2022-11-16 12:48:38,898 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1521 transitions. [2022-11-16 12:48:38,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1521 transitions. [2022-11-16 12:48:38,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:38,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1521 transitions. [2022-11-16 12:48:38,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 380.25) internal successors, (1521), 4 states have internal predecessors, (1521), 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-11-16 12:48:38,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 461.0) internal successors, (2305), 5 states have internal predecessors, (2305), 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-11-16 12:48:38,907 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 461.0) internal successors, (2305), 5 states have internal predecessors, (2305), 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-11-16 12:48:38,908 INFO L175 Difference]: Start difference. First operand has 459 places, 426 transitions, 1184 flow. Second operand 4 states and 1521 transitions. [2022-11-16 12:48:38,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 425 transitions, 1220 flow [2022-11-16 12:48:38,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 425 transitions, 1174 flow, removed 5 selfloop flow, removed 18 redundant places. [2022-11-16 12:48:38,924 INFO L231 Difference]: Finished difference. Result has 443 places, 425 transitions, 1144 flow [2022-11-16 12:48:38,924 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1144, PETRI_PLACES=443, PETRI_TRANSITIONS=425} [2022-11-16 12:48:38,925 INFO L288 CegarLoopForPetriNet]: 393 programPoint places, 50 predicate places. [2022-11-16 12:48:38,925 INFO L495 AbstractCegarLoop]: Abstraction has has 443 places, 425 transitions, 1144 flow [2022-11-16 12:48:38,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 379.2) internal successors, (1896), 5 states have internal predecessors, (1896), 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-11-16 12:48:38,926 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:38,927 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 12:48:38,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:39,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_628a812e-2986-4883-b7b8-38d4de6ca8e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-16 12:48:39,139 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-16 12:48:39,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:39,140 INFO L85 PathProgramCache]: Analyzing trace with hash 622411147, now seen corresponding path program 1 times [2022-11-16 12:48:39,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:39,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857541517] [2022-11-16 12:48:39,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:39,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-16 12:48:39,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:39,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857541517] [2022-11-16 12:48:39,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857541517] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:39,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:39,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:48:39,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165160854] [2022-11-16 12:48:39,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:39,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:48:39,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:39,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:48:39,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:48:39,778 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 461 [2022-11-16 12:48:39,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 425 transitions, 1144 flow. Second operand has 11 states, 11 states have (on average 329.3636363636364) internal successors, (3623), 11 states have internal predecessors, (3623), 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-11-16 12:48:39,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:39,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 461 [2022-11-16 12:48:39,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand