./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a 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_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R --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 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a --- 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-38b53e6 [2022-11-25 17:17:22,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:17:22,088 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:17:22,135 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:17:22,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:17:22,140 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:17:22,141 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:17:22,143 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:17:22,145 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:17:22,146 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:17:22,147 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:17:22,148 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:17:22,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:17:22,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:17:22,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:17:22,155 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:17:22,156 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:17:22,157 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:17:22,158 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:17:22,160 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:17:22,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:17:22,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:17:22,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:17:22,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:17:22,170 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:17:22,171 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:17:22,171 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:17:22,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:17:22,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:17:22,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:17:22,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:17:22,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:17:22,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:17:22,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:17:22,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:17:22,180 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:17:22,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:17:22,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:17:22,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:17:22,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:17:22,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:17:22,185 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-25 17:17:22,242 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:17:22,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:17:22,245 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:17:22,245 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:17:22,246 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:17:22,246 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:17:22,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:17:22,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:17:22,247 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:17:22,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:17:22,249 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:17:22,250 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:17:22,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:17:22,250 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:17:22,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:17:22,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:17:22,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:17:22,251 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:17:22,251 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 17:17:22,251 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:17:22,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:17:22,252 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:17:22,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:17:22,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:17:22,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:17:22,253 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:17:22,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:17:22,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:17:22,254 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:17:22,254 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:17:22,254 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:17:22,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:17:22,255 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:17:22,255 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:17:22,255 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:17:22,255 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:17:22,256 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/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_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R 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 -> 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a [2022-11-25 17:17:22,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:17:22,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:17:22,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:17:22,670 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:17:22,677 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:17:22,678 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i [2022-11-25 17:17:25,818 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:17:26,137 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:17:26,137 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i [2022-11-25 17:17:26,153 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/data/b8596c0a2/851e4490dee54bc08b5a4cbd8ba591fa/FLAGfda4cf0fe [2022-11-25 17:17:26,170 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/data/b8596c0a2/851e4490dee54bc08b5a4cbd8ba591fa [2022-11-25 17:17:26,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:17:26,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:17:26,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:17:26,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:17:26,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:17:26,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:17:26" (1/1) ... [2022-11-25 17:17:26,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f354520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:26, skipping insertion in model container [2022-11-25 17:17:26,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:17:26" (1/1) ... [2022-11-25 17:17:26,221 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:17:26,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:17:26,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:17:26,777 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:17:26,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:17:26,931 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:17:26,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:26 WrapperNode [2022-11-25 17:17:26,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:17:26,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:17:26,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:17:26,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:17:26,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:26" (1/1) ... [2022-11-25 17:17:26,976 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:26" (1/1) ... [2022-11-25 17:17:27,016 INFO L138 Inliner]: procedures = 262, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-11-25 17:17:27,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:17:27,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:17:27,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:17:27,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:17:27,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:26" (1/1) ... [2022-11-25 17:17:27,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:26" (1/1) ... [2022-11-25 17:17:27,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:26" (1/1) ... [2022-11-25 17:17:27,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:26" (1/1) ... [2022-11-25 17:17:27,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:26" (1/1) ... [2022-11-25 17:17:27,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:26" (1/1) ... [2022-11-25 17:17:27,079 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:26" (1/1) ... [2022-11-25 17:17:27,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:26" (1/1) ... [2022-11-25 17:17:27,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:17:27,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:17:27,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:17:27,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:17:27,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:26" (1/1) ... [2022-11-25 17:17:27,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:17:27,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:17:27,127 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:17:27,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:17:27,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:17:27,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:17:27,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:17:27,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:17:27,173 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-25 17:17:27,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:17:27,174 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-25 17:17:27,174 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-25 17:17:27,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:17:27,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:17:27,176 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:17:27,391 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:17:27,393 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:17:27,686 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:17:27,695 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:17:27,695 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-25 17:17:27,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:17:27 BoogieIcfgContainer [2022-11-25 17:17:27,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:17:27,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:17:27,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:17:27,711 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:17:27,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:17:26" (1/3) ... [2022-11-25 17:17:27,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517fad28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:17:27, skipping insertion in model container [2022-11-25 17:17:27,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:17:26" (2/3) ... [2022-11-25 17:17:27,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517fad28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:17:27, skipping insertion in model container [2022-11-25 17:17:27,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:17:27" (3/3) ... [2022-11-25 17:17:27,716 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_05-funloop_hard2.i [2022-11-25 17:17:27,727 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 17:17:27,739 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:17:27,739 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-25 17:17:27,739 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:17:27,830 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:17:27,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 110 transitions, 225 flow [2022-11-25 17:17:27,925 INFO L130 PetriNetUnfolder]: 6/109 cut-off events. [2022-11-25 17:17:27,925 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:17:27,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 109 events. 6/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-25 17:17:27,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 110 transitions, 225 flow [2022-11-25 17:17:27,938 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 109 transitions, 221 flow [2022-11-25 17:17:27,943 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:17:27,972 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 109 transitions, 221 flow [2022-11-25 17:17:27,977 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 109 transitions, 221 flow [2022-11-25 17:17:27,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 109 transitions, 221 flow [2022-11-25 17:17:28,035 INFO L130 PetriNetUnfolder]: 6/109 cut-off events. [2022-11-25 17:17:28,036 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:17:28,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 109 events. 6/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-25 17:17:28,040 INFO L119 LiptonReduction]: Number of co-enabled transitions 3072 [2022-11-25 17:17:31,339 INFO L134 LiptonReduction]: Checked pairs total: 3990 [2022-11-25 17:17:31,339 INFO L136 LiptonReduction]: Total number of compositions: 107 [2022-11-25 17:17:31,358 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:17:31,370 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;@754ae86d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:17:31,371 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-11-25 17:17:31,376 INFO L130 PetriNetUnfolder]: 1/2 cut-off events. [2022-11-25 17:17:31,376 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:17:31,377 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:17:31,378 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-11-25 17:17:31,379 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:17:31,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:31,388 INFO L85 PathProgramCache]: Analyzing trace with hash 13376, now seen corresponding path program 1 times [2022-11-25 17:17:31,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:31,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147248652] [2022-11-25 17:17:31,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:31,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:31,778 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-25 17:17:31,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:31,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147248652] [2022-11-25 17:17:31,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147248652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:17:31,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:17:31,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:17:31,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101781503] [2022-11-25 17:17:31,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:17:31,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:17:31,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:31,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:17:31,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:17:31,854 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 217 [2022-11-25 17:17:31,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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-25 17:17:31,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:17:31,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 217 [2022-11-25 17:17:31,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:17:32,031 INFO L130 PetriNetUnfolder]: 152/306 cut-off events. [2022-11-25 17:17:32,032 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:17:32,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 306 events. 152/306 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1276 event pairs, 126 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 600. Up to 306 conditions per place. [2022-11-25 17:17:32,040 INFO L137 encePairwiseOnDemand]: 212/217 looper letters, 29 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2022-11-25 17:17:32,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 127 flow [2022-11-25 17:17:32,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:17:32,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:17:32,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2022-11-25 17:17:32,070 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-11-25 17:17:32,071 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2022-11-25 17:17:32,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2022-11-25 17:17:32,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:17:32,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2022-11-25 17:17:32,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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-25 17:17:32,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 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-25 17:17:32,101 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 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-25 17:17:32,104 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 65 flow. Second operand 3 states and 341 transitions. [2022-11-25 17:17:32,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 127 flow [2022-11-25 17:17:32,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:17:32,110 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 76 flow [2022-11-25 17:17:32,113 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2022-11-25 17:17:32,118 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2022-11-25 17:17:32,118 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 76 flow [2022-11-25 17:17:32,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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-25 17:17:32,118 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:17:32,119 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:17:32,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:17:32,119 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:17:32,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:32,122 INFO L85 PathProgramCache]: Analyzing trace with hash 415849, now seen corresponding path program 1 times [2022-11-25 17:17:32,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:32,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311606491] [2022-11-25 17:17:32,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:32,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:17:32,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:32,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311606491] [2022-11-25 17:17:32,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311606491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:17:32,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:17:32,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:17:32,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869912236] [2022-11-25 17:17:32,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:17:32,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:17:32,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:32,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:17:32,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:17:32,206 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 217 [2022-11-25 17:17:32,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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-25 17:17:32,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:17:32,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 217 [2022-11-25 17:17:32,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:17:32,288 INFO L130 PetriNetUnfolder]: 152/305 cut-off events. [2022-11-25 17:17:32,289 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:17:32,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 305 events. 152/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1272 event pairs, 126 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 610. Up to 305 conditions per place. [2022-11-25 17:17:32,292 INFO L137 encePairwiseOnDemand]: 215/217 looper letters, 29 selfloop transitions, 1 changer transitions 0/30 dead transitions. [2022-11-25 17:17:32,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 132 flow [2022-11-25 17:17:32,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:17:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:17:32,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2022-11-25 17:17:32,294 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2022-11-25 17:17:32,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2022-11-25 17:17:32,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2022-11-25 17:17:32,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:17:32,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2022-11-25 17:17:32,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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-25 17:17:32,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 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-25 17:17:32,299 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 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-25 17:17:32,299 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 76 flow. Second operand 3 states and 336 transitions. [2022-11-25 17:17:32,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 132 flow [2022-11-25 17:17:32,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 128 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 17:17:32,304 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 70 flow [2022-11-25 17:17:32,304 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2022-11-25 17:17:32,305 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2022-11-25 17:17:32,305 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 70 flow [2022-11-25 17:17:32,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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-25 17:17:32,306 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:17:32,306 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 17:17:32,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:17:32,307 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:17:32,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:32,312 INFO L85 PathProgramCache]: Analyzing trace with hash -495525492, now seen corresponding path program 1 times [2022-11-25 17:17:32,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:32,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241657668] [2022-11-25 17:17:32,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:32,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:32,449 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-25 17:17:32,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:32,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241657668] [2022-11-25 17:17:32,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241657668] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:17:32,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964966003] [2022-11-25 17:17:32,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:32,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:17:32,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:17:32,457 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:17:32,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:17:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:32,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:17:32,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:17:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:17:32,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:17:32,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964966003] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:17:32,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:17:32,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2022-11-25 17:17:32,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137874805] [2022-11-25 17:17:32,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:17:32,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:17:32,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:32,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:17:32,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:17:32,579 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 217 [2022-11-25 17:17:32,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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-25 17:17:32,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:17:32,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 217 [2022-11-25 17:17:32,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:17:32,711 INFO L130 PetriNetUnfolder]: 222/435 cut-off events. [2022-11-25 17:17:32,711 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:17:32,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 435 events. 222/435 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1932 event pairs, 117 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 872. Up to 286 conditions per place. [2022-11-25 17:17:32,715 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 44 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2022-11-25 17:17:32,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 198 flow [2022-11-25 17:17:32,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:17:32,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:17:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2022-11-25 17:17:32,717 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5407066052227343 [2022-11-25 17:17:32,717 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2022-11-25 17:17:32,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2022-11-25 17:17:32,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:17:32,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2022-11-25 17:17:32,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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-25 17:17:32,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 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-25 17:17:32,722 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 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-25 17:17:32,722 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 70 flow. Second operand 3 states and 352 transitions. [2022-11-25 17:17:32,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 198 flow [2022-11-25 17:17:32,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 197 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:17:32,724 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 95 flow [2022-11-25 17:17:32,725 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2022-11-25 17:17:32,725 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2022-11-25 17:17:32,726 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 95 flow [2022-11-25 17:17:32,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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-25 17:17:32,726 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:17:32,727 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 17:17:32,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:17:32,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-25 17:17:32,933 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:17:32,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:32,934 INFO L85 PathProgramCache]: Analyzing trace with hash -495525482, now seen corresponding path program 1 times [2022-11-25 17:17:32,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:32,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30359027] [2022-11-25 17:17:32,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:32,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:33,032 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-25 17:17:33,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:33,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30359027] [2022-11-25 17:17:33,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30359027] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:17:33,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779606531] [2022-11-25 17:17:33,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:33,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:17:33,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:17:33,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:17:33,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:17:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:33,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:17:33,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:17:33,157 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-25 17:17:33,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:17:33,176 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-25 17:17:33,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779606531] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:17:33,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:17:33,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-25 17:17:33,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982623105] [2022-11-25 17:17:33,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:17:33,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:17:33,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:33,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:17:33,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:17:33,209 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 217 [2022-11-25 17:17:33,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 95 flow. Second operand has 7 states, 7 states have (on average 102.57142857142857) internal successors, (718), 7 states have internal predecessors, (718), 0 states have call successors, (0), 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-25 17:17:33,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:17:33,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 217 [2022-11-25 17:17:33,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:17:33,381 INFO L130 PetriNetUnfolder]: 222/438 cut-off events. [2022-11-25 17:17:33,381 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-11-25 17:17:33,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 438 events. 222/438 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1848 event pairs, 180 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 991. Up to 435 conditions per place. [2022-11-25 17:17:33,386 INFO L137 encePairwiseOnDemand]: 214/217 looper letters, 30 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2022-11-25 17:17:33,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 177 flow [2022-11-25 17:17:33,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:17:33,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:17:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions. [2022-11-25 17:17:33,389 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4930875576036866 [2022-11-25 17:17:33,389 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 642 transitions. [2022-11-25 17:17:33,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 642 transitions. [2022-11-25 17:17:33,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:17:33,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 642 transitions. [2022-11-25 17:17:33,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 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-25 17:17:33,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 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-25 17:17:33,395 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 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-25 17:17:33,395 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 95 flow. Second operand 6 states and 642 transitions. [2022-11-25 17:17:33,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 177 flow [2022-11-25 17:17:33,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 171 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:17:33,399 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 125 flow [2022-11-25 17:17:33,399 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=125, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2022-11-25 17:17:33,401 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2022-11-25 17:17:33,401 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 125 flow [2022-11-25 17:17:33,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.57142857142857) internal successors, (718), 7 states have internal predecessors, (718), 0 states have call successors, (0), 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-25 17:17:33,402 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:17:33,402 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2022-11-25 17:17:33,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:17:33,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:17:33,615 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:17:33,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:33,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1911453727, now seen corresponding path program 2 times [2022-11-25 17:17:33,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:33,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251401086] [2022-11-25 17:17:33,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:33,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:17:33,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:33,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251401086] [2022-11-25 17:17:33,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251401086] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:17:33,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989560359] [2022-11-25 17:17:33,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:17:33,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:17:33,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:17:33,718 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:17:33,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:17:33,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 17:17:33,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:17:33,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 17:17:33,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:17:33,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-25 17:17:33,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:17:33,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:17:33,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 17:17:33,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:17:33,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989560359] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:17:33,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:17:33,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2022-11-25 17:17:33,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965263425] [2022-11-25 17:17:33,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:17:33,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:17:33,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:33,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:17:33,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:17:33,992 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 217 [2022-11-25 17:17:33,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 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-25 17:17:33,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:17:33,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 217 [2022-11-25 17:17:33,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:17:34,136 INFO L130 PetriNetUnfolder]: 251/496 cut-off events. [2022-11-25 17:17:34,136 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-11-25 17:17:34,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1107 conditions, 496 events. 251/496 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2231 event pairs, 74 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 1094. Up to 431 conditions per place. [2022-11-25 17:17:34,141 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 44 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2022-11-25 17:17:34,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 245 flow [2022-11-25 17:17:34,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:17:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:17:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2022-11-25 17:17:34,143 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5299539170506913 [2022-11-25 17:17:34,144 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2022-11-25 17:17:34,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2022-11-25 17:17:34,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:17:34,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2022-11-25 17:17:34,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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-25 17:17:34,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 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-25 17:17:34,148 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 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-25 17:17:34,148 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 125 flow. Second operand 3 states and 345 transitions. [2022-11-25 17:17:34,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 245 flow [2022-11-25 17:17:34,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 231 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-11-25 17:17:34,154 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 130 flow [2022-11-25 17:17:34,154 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2022-11-25 17:17:34,157 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2022-11-25 17:17:34,157 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 130 flow [2022-11-25 17:17:34,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 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-25 17:17:34,158 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:17:34,158 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-11-25 17:17:34,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-25 17:17:34,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:17:34,363 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:17:34,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:34,364 INFO L85 PathProgramCache]: Analyzing trace with hash -874476207, now seen corresponding path program 1 times [2022-11-25 17:17:34,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:34,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219190855] [2022-11-25 17:17:34,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:34,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:34,517 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:17:34,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:34,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219190855] [2022-11-25 17:17:34,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219190855] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:17:34,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748430859] [2022-11-25 17:17:34,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:34,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:17:34,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:17:34,520 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:17:34,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:17:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:34,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:17:34,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:17:34,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:17:34,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:17:34,713 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:17:34,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748430859] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:17:34,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:17:34,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-25 17:17:34,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493765719] [2022-11-25 17:17:34,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:17:34,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 17:17:34,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:34,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 17:17:34,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:17:34,762 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 217 [2022-11-25 17:17:34,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 130 flow. Second operand has 13 states, 13 states have (on average 102.38461538461539) internal successors, (1331), 13 states have internal predecessors, (1331), 0 states have call successors, (0), 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-25 17:17:34,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:17:34,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 217 [2022-11-25 17:17:34,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:17:34,950 INFO L130 PetriNetUnfolder]: 251/502 cut-off events. [2022-11-25 17:17:34,951 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2022-11-25 17:17:34,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1210 conditions, 502 events. 251/502 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2255 event pairs, 200 based on Foata normal form. 6/312 useless extension candidates. Maximal degree in co-relation 1195. Up to 493 conditions per place. [2022-11-25 17:17:34,955 INFO L137 encePairwiseOnDemand]: 214/217 looper letters, 32 selfloop transitions, 11 changer transitions 0/43 dead transitions. [2022-11-25 17:17:34,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 43 transitions, 252 flow [2022-11-25 17:17:34,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 17:17:34,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-25 17:17:34,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1257 transitions. [2022-11-25 17:17:34,959 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4827188940092166 [2022-11-25 17:17:34,959 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1257 transitions. [2022-11-25 17:17:34,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1257 transitions. [2022-11-25 17:17:34,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:17:34,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1257 transitions. [2022-11-25 17:17:34,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 104.75) internal successors, (1257), 12 states have internal predecessors, (1257), 0 states have call successors, (0), 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-25 17:17:34,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 217.0) internal successors, (2821), 13 states have internal predecessors, (2821), 0 states have call successors, (0), 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-25 17:17:34,974 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 217.0) internal successors, (2821), 13 states have internal predecessors, (2821), 0 states have call successors, (0), 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-25 17:17:34,974 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 130 flow. Second operand 12 states and 1257 transitions. [2022-11-25 17:17:34,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 43 transitions, 252 flow [2022-11-25 17:17:34,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 249 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:17:34,977 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 211 flow [2022-11-25 17:17:34,977 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=211, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2022-11-25 17:17:34,978 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 28 predicate places. [2022-11-25 17:17:34,978 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 211 flow [2022-11-25 17:17:34,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 102.38461538461539) internal successors, (1331), 13 states have internal predecessors, (1331), 0 states have call successors, (0), 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-25 17:17:34,979 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:17:34,979 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-11-25 17:17:34,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:17:35,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:17:35,187 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:17:35,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:35,187 INFO L85 PathProgramCache]: Analyzing trace with hash 94135473, now seen corresponding path program 2 times [2022-11-25 17:17:35,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:35,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96529440] [2022-11-25 17:17:35,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:35,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:35,416 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:17:35,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:35,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96529440] [2022-11-25 17:17:35,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96529440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:17:35,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:17:35,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:17:35,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273363762] [2022-11-25 17:17:35,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:17:35,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:17:35,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:35,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:17:35,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:17:35,492 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 217 [2022-11-25 17:17:35,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 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-25 17:17:35,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:17:35,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 217 [2022-11-25 17:17:35,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:17:35,691 INFO L130 PetriNetUnfolder]: 244/488 cut-off events. [2022-11-25 17:17:35,692 INFO L131 PetriNetUnfolder]: For 87/87 co-relation queries the response was YES. [2022-11-25 17:17:35,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1199 conditions, 488 events. 244/488 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2191 event pairs, 64 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 1177. Up to 430 conditions per place. [2022-11-25 17:17:35,696 INFO L137 encePairwiseOnDemand]: 212/217 looper letters, 54 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2022-11-25 17:17:35,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 59 transitions, 365 flow [2022-11-25 17:17:35,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:17:35,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:17:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 440 transitions. [2022-11-25 17:17:35,699 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5069124423963134 [2022-11-25 17:17:35,699 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 440 transitions. [2022-11-25 17:17:35,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 440 transitions. [2022-11-25 17:17:35,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:17:35,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 440 transitions. [2022-11-25 17:17:35,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 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-25 17:17:35,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 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-25 17:17:35,703 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 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-25 17:17:35,703 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 211 flow. Second operand 4 states and 440 transitions. [2022-11-25 17:17:35,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 59 transitions, 365 flow [2022-11-25 17:17:35,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 59 transitions, 317 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-11-25 17:17:35,710 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 189 flow [2022-11-25 17:17:35,710 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2022-11-25 17:17:35,711 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 28 predicate places. [2022-11-25 17:17:35,711 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 189 flow [2022-11-25 17:17:35,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 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-25 17:17:35,712 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:17:35,712 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-11-25 17:17:35,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:17:35,712 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:17:35,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:35,713 INFO L85 PathProgramCache]: Analyzing trace with hash 94121732, now seen corresponding path program 1 times [2022-11-25 17:17:35,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:35,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069872127] [2022-11-25 17:17:35,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:35,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:35,955 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:17:35,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:35,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069872127] [2022-11-25 17:17:35,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069872127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:17:35,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:17:35,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:17:35,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938525723] [2022-11-25 17:17:35,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:17:35,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:17:35,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:35,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:17:35,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:17:36,053 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 217 [2022-11-25 17:17:36,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 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-25 17:17:36,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:17:36,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 217 [2022-11-25 17:17:36,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:17:36,231 INFO L130 PetriNetUnfolder]: 236/472 cut-off events. [2022-11-25 17:17:36,231 INFO L131 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2022-11-25 17:17:36,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1208 conditions, 472 events. 236/472 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2102 event pairs, 92 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 1184. Up to 428 conditions per place. [2022-11-25 17:17:36,235 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 49 selfloop transitions, 6 changer transitions 0/55 dead transitions. [2022-11-25 17:17:36,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 332 flow [2022-11-25 17:17:36,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:17:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:17:36,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 436 transitions. [2022-11-25 17:17:36,238 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5023041474654378 [2022-11-25 17:17:36,238 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 436 transitions. [2022-11-25 17:17:36,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 436 transitions. [2022-11-25 17:17:36,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:17:36,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 436 transitions. [2022-11-25 17:17:36,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 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-25 17:17:36,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 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-25 17:17:36,242 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 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-25 17:17:36,242 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 189 flow. Second operand 4 states and 436 transitions. [2022-11-25 17:17:36,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 332 flow [2022-11-25 17:17:36,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:17:36,246 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 213 flow [2022-11-25 17:17:36,247 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=213, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2022-11-25 17:17:36,250 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 31 predicate places. [2022-11-25 17:17:36,250 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 213 flow [2022-11-25 17:17:36,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 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-25 17:17:36,253 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:17:36,253 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:17:36,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:17:36,254 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:17:36,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:36,254 INFO L85 PathProgramCache]: Analyzing trace with hash 269886566, now seen corresponding path program 1 times [2022-11-25 17:17:36,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:36,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315902240] [2022-11-25 17:17:36,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:36,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:36,352 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:17:36,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:36,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315902240] [2022-11-25 17:17:36,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315902240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:17:36,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:17:36,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:17:36,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519143617] [2022-11-25 17:17:36,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:17:36,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:17:36,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:36,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:17:36,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:17:36,372 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 217 [2022-11-25 17:17:36,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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-25 17:17:36,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:17:36,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 217 [2022-11-25 17:17:36,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:17:36,518 INFO L130 PetriNetUnfolder]: 226/462 cut-off events. [2022-11-25 17:17:36,519 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2022-11-25 17:17:36,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 462 events. 226/462 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2092 event pairs, 88 based on Foata normal form. 0/359 useless extension candidates. Maximal degree in co-relation 1234. Up to 319 conditions per place. [2022-11-25 17:17:36,522 INFO L137 encePairwiseOnDemand]: 214/217 looper letters, 61 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2022-11-25 17:17:36,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 395 flow [2022-11-25 17:17:36,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:17:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:17:36,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2022-11-25 17:17:36,525 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5360983102918587 [2022-11-25 17:17:36,525 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2022-11-25 17:17:36,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2022-11-25 17:17:36,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:17:36,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2022-11-25 17:17:36,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 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-25 17:17:36,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 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-25 17:17:36,529 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 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-25 17:17:36,529 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 213 flow. Second operand 3 states and 349 transitions. [2022-11-25 17:17:36,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 395 flow [2022-11-25 17:17:36,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 389 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:17:36,533 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 208 flow [2022-11-25 17:17:36,533 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2022-11-25 17:17:36,535 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 32 predicate places. [2022-11-25 17:17:36,535 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 208 flow [2022-11-25 17:17:36,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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-25 17:17:36,535 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:17:36,536 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:17:36,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:17:36,536 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:17:36,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:36,537 INFO L85 PathProgramCache]: Analyzing trace with hash 256608624, now seen corresponding path program 1 times [2022-11-25 17:17:36,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:36,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129163007] [2022-11-25 17:17:36,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:36,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:36,601 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:17:36,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:36,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129163007] [2022-11-25 17:17:36,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129163007] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:17:36,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:17:36,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:17:36,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914526972] [2022-11-25 17:17:36,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:17:36,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:17:36,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:36,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:17:36,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:17:36,635 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 217 [2022-11-25 17:17:36,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 208 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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-25 17:17:36,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:17:36,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 217 [2022-11-25 17:17:36,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:17:36,805 INFO L130 PetriNetUnfolder]: 318/646 cut-off events. [2022-11-25 17:17:36,806 INFO L131 PetriNetUnfolder]: For 301/301 co-relation queries the response was YES. [2022-11-25 17:17:36,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 646 events. 318/646 cut-off events. For 301/301 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2974 event pairs, 173 based on Foata normal form. 19/523 useless extension candidates. Maximal degree in co-relation 1742. Up to 433 conditions per place. [2022-11-25 17:17:36,811 INFO L137 encePairwiseOnDemand]: 212/217 looper letters, 68 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2022-11-25 17:17:36,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 70 transitions, 439 flow [2022-11-25 17:17:36,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:17:36,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:17:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2022-11-25 17:17:36,813 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5514592933947773 [2022-11-25 17:17:36,813 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2022-11-25 17:17:36,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2022-11-25 17:17:36,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:17:36,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2022-11-25 17:17:36,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:17:36,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 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-25 17:17:36,817 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 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-25 17:17:36,817 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 208 flow. Second operand 3 states and 359 transitions. [2022-11-25 17:17:36,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 70 transitions, 439 flow [2022-11-25 17:17:36,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 70 transitions, 429 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:17:36,820 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 219 flow [2022-11-25 17:17:36,821 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=219, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2022-11-25 17:17:36,822 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 33 predicate places. [2022-11-25 17:17:36,822 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 219 flow [2022-11-25 17:17:36,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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-25 17:17:36,823 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:17:36,823 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:17:36,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:17:36,824 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:17:36,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:36,824 INFO L85 PathProgramCache]: Analyzing trace with hash -258339301, now seen corresponding path program 1 times [2022-11-25 17:17:36,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:36,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216199456] [2022-11-25 17:17:36,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:36,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:37,378 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:17:37,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:37,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216199456] [2022-11-25 17:17:37,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216199456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:17:37,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:17:37,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:17:37,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131836203] [2022-11-25 17:17:37,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:17:37,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:17:37,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:37,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:17:37,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:17:37,496 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 217 [2022-11-25 17:17:37,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 219 flow. Second operand has 7 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 0 states have call successors, (0), 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-25 17:17:37,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:17:37,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 217 [2022-11-25 17:17:37,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:17:37,834 INFO L130 PetriNetUnfolder]: 347/704 cut-off events. [2022-11-25 17:17:37,834 INFO L131 PetriNetUnfolder]: For 369/369 co-relation queries the response was YES. [2022-11-25 17:17:37,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2030 conditions, 704 events. 347/704 cut-off events. For 369/369 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3331 event pairs, 143 based on Foata normal form. 7/564 useless extension candidates. Maximal degree in co-relation 2003. Up to 605 conditions per place. [2022-11-25 17:17:37,839 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 60 selfloop transitions, 10 changer transitions 0/70 dead transitions. [2022-11-25 17:17:37,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 448 flow [2022-11-25 17:17:37,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:17:37,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:17:37,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 622 transitions. [2022-11-25 17:17:37,842 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47772657450076805 [2022-11-25 17:17:37,843 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 622 transitions. [2022-11-25 17:17:37,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 622 transitions. [2022-11-25 17:17:37,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:17:37,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 622 transitions. [2022-11-25 17:17:37,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 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-25 17:17:37,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 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-25 17:17:37,848 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 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-25 17:17:37,848 INFO L175 Difference]: Start difference. First operand has 65 places, 47 transitions, 219 flow. Second operand 6 states and 622 transitions. [2022-11-25 17:17:37,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 448 flow [2022-11-25 17:17:37,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 70 transitions, 444 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:17:37,852 INFO L231 Difference]: Finished difference. Result has 71 places, 51 transitions, 269 flow [2022-11-25 17:17:37,852 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=71, PETRI_TRANSITIONS=51} [2022-11-25 17:17:37,853 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 39 predicate places. [2022-11-25 17:17:37,853 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 51 transitions, 269 flow [2022-11-25 17:17:37,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 0 states have call successors, (0), 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-25 17:17:37,854 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:17:37,854 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:17:37,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:17:37,854 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:17:37,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:37,855 INFO L85 PathProgramCache]: Analyzing trace with hash -223450165, now seen corresponding path program 1 times [2022-11-25 17:17:37,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:37,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544028925] [2022-11-25 17:17:37,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:37,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:38,243 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:17:38,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:17:38,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544028925] [2022-11-25 17:17:38,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544028925] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:17:38,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86803655] [2022-11-25 17:17:38,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:38,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:17:38,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:17:38,247 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:17:38,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 17:17:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:17:38,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 17:17:38,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:17:38,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-25 17:17:38,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:17:38,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:17:38,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-25 17:17:43,166 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:17:43,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:17:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:17:47,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86803655] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:17:47,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:17:47,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-11-25 17:17:47,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849809947] [2022-11-25 17:17:47,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:17:47,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 17:17:47,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:17:47,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 17:17:47,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=205, Unknown=10, NotChecked=0, Total=306 [2022-11-25 17:17:49,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:17:51,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:17:53,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:17:55,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:17:57,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:17:59,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:00,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:02,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:03,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:05,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:07,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:09,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:11,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:12,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:14,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:16,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:17,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:17,843 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 217 [2022-11-25 17:18:17,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 51 transitions, 269 flow. Second operand has 18 states, 18 states have (on average 74.66666666666667) internal successors, (1344), 18 states have internal predecessors, (1344), 0 states have call successors, (0), 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-25 17:18:17,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:18:17,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 217 [2022-11-25 17:18:17,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:18:19,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:20,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:22,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:24,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:25,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:27,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:28,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:32,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:33,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:36,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:38,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:40,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:41,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:41,794 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (and (forall ((v_ArrVal_323 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_116| Int) (v_ArrVal_321 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_60| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_60|)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_60| v_ArrVal_321) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_116| v_ArrVal_323) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_116| 28)))) (forall ((v_ArrVal_323 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_116| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_116| 28)) (< 0 (+ 2147483650 (select (store .cse0 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_116| v_ArrVal_323) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115|))))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select .cse0 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115|))))))) is different from false [2022-11-25 17:18:43,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:45,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:46,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:18:46,931 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse1 (select |c_#memory_int| |c_~#cache~0.base|))) (and (forall ((v_ArrVal_323 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_116| Int) (v_ArrVal_321 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_60| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_60|)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_60| v_ArrVal_321) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_116| v_ArrVal_323) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_116| 28)))) (forall ((v_ArrVal_323 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| (+ .cse0 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_323)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115|))))) (forall ((v_ArrVal_323 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_116| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_116| 28)) (< 0 (+ 2147483650 (select (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_116| v_ArrVal_323) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115|))))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| (+ .cse0 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115|))))))) is different from false [2022-11-25 17:18:55,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:18:57,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:18:58,119 INFO L130 PetriNetUnfolder]: 687/1349 cut-off events. [2022-11-25 17:18:58,119 INFO L131 PetriNetUnfolder]: For 904/904 co-relation queries the response was YES. [2022-11-25 17:18:58,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4067 conditions, 1349 events. 687/1349 cut-off events. For 904/904 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7768 event pairs, 167 based on Foata normal form. 33/1066 useless extension candidates. Maximal degree in co-relation 4037. Up to 531 conditions per place. [2022-11-25 17:18:58,130 INFO L137 encePairwiseOnDemand]: 202/217 looper letters, 132 selfloop transitions, 42 changer transitions 0/174 dead transitions. [2022-11-25 17:18:58,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 174 transitions, 1124 flow [2022-11-25 17:18:58,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 17:18:58,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-25 17:18:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1249 transitions. [2022-11-25 17:18:58,134 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3837173579109063 [2022-11-25 17:18:58,134 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1249 transitions. [2022-11-25 17:18:58,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1249 transitions. [2022-11-25 17:18:58,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:18:58,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1249 transitions. [2022-11-25 17:18:58,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 83.26666666666667) internal successors, (1249), 15 states have internal predecessors, (1249), 0 states have call successors, (0), 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-25 17:18:58,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 217.0) internal successors, (3472), 16 states have internal predecessors, (3472), 0 states have call successors, (0), 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-25 17:18:58,144 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 217.0) internal successors, (3472), 16 states have internal predecessors, (3472), 0 states have call successors, (0), 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-25 17:18:58,144 INFO L175 Difference]: Start difference. First operand has 71 places, 51 transitions, 269 flow. Second operand 15 states and 1249 transitions. [2022-11-25 17:18:58,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 174 transitions, 1124 flow [2022-11-25 17:18:58,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 174 transitions, 1092 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-11-25 17:18:58,152 INFO L231 Difference]: Finished difference. Result has 91 places, 88 transitions, 592 flow [2022-11-25 17:18:58,152 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=592, PETRI_PLACES=91, PETRI_TRANSITIONS=88} [2022-11-25 17:18:58,153 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 59 predicate places. [2022-11-25 17:18:58,153 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 592 flow [2022-11-25 17:18:58,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 74.66666666666667) internal successors, (1344), 18 states have internal predecessors, (1344), 0 states have call successors, (0), 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-25 17:18:58,154 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:18:58,154 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:18:58,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:18:58,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:58,365 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:18:58,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:58,366 INFO L85 PathProgramCache]: Analyzing trace with hash 584466681, now seen corresponding path program 1 times [2022-11-25 17:18:58,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:58,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374960355] [2022-11-25 17:18:58,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:58,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:58,791 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:18:58,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:58,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374960355] [2022-11-25 17:18:58,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374960355] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:58,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:18:58,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:18:58,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110898956] [2022-11-25 17:18:58,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:58,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:18:58,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:58,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:18:58,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:18:58,995 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 217 [2022-11-25 17:18:58,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 592 flow. Second operand has 8 states, 8 states have (on average 92.375) internal successors, (739), 8 states have internal predecessors, (739), 0 states have call successors, (0), 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-25 17:18:58,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:18:58,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 217 [2022-11-25 17:18:58,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:18:59,623 INFO L130 PetriNetUnfolder]: 896/1790 cut-off events. [2022-11-25 17:18:59,623 INFO L131 PetriNetUnfolder]: For 3671/3671 co-relation queries the response was YES. [2022-11-25 17:18:59,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6945 conditions, 1790 events. 896/1790 cut-off events. For 3671/3671 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11400 event pairs, 172 based on Foata normal form. 0/1454 useless extension candidates. Maximal degree in co-relation 6906. Up to 992 conditions per place. [2022-11-25 17:18:59,639 INFO L137 encePairwiseOnDemand]: 207/217 looper letters, 116 selfloop transitions, 37 changer transitions 0/153 dead transitions. [2022-11-25 17:18:59,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 153 transitions, 1319 flow [2022-11-25 17:18:59,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:18:59,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 17:18:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 904 transitions. [2022-11-25 17:18:59,642 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46287762416794676 [2022-11-25 17:18:59,642 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 904 transitions. [2022-11-25 17:18:59,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 904 transitions. [2022-11-25 17:18:59,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:18:59,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 904 transitions. [2022-11-25 17:18:59,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.44444444444444) internal successors, (904), 9 states have internal predecessors, (904), 0 states have call successors, (0), 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-25 17:18:59,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 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-25 17:18:59,650 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 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-25 17:18:59,650 INFO L175 Difference]: Start difference. First operand has 91 places, 88 transitions, 592 flow. Second operand 9 states and 904 transitions. [2022-11-25 17:18:59,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 153 transitions, 1319 flow [2022-11-25 17:18:59,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 153 transitions, 1240 flow, removed 30 selfloop flow, removed 3 redundant places. [2022-11-25 17:18:59,670 INFO L231 Difference]: Finished difference. Result has 102 places, 110 transitions, 871 flow [2022-11-25 17:18:59,671 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=871, PETRI_PLACES=102, PETRI_TRANSITIONS=110} [2022-11-25 17:18:59,672 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 70 predicate places. [2022-11-25 17:18:59,672 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 110 transitions, 871 flow [2022-11-25 17:18:59,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.375) internal successors, (739), 8 states have internal predecessors, (739), 0 states have call successors, (0), 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-25 17:18:59,673 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:18:59,673 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:18:59,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:18:59,673 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:18:59,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:59,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1453088189, now seen corresponding path program 1 times [2022-11-25 17:18:59,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:59,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371003971] [2022-11-25 17:18:59,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:59,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:19:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:19:00,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:19:00,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371003971] [2022-11-25 17:19:00,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371003971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:19:00,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:19:00,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:19:00,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834079804] [2022-11-25 17:19:00,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:19:00,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:19:00,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:19:00,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:19:00,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:19:00,256 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 217 [2022-11-25 17:19:00,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 110 transitions, 871 flow. Second operand has 8 states, 8 states have (on average 93.375) internal successors, (747), 8 states have internal predecessors, (747), 0 states have call successors, (0), 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-25 17:19:00,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:19:00,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 217 [2022-11-25 17:19:00,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:19:00,830 INFO L130 PetriNetUnfolder]: 917/1850 cut-off events. [2022-11-25 17:19:00,831 INFO L131 PetriNetUnfolder]: For 5863/5863 co-relation queries the response was YES. [2022-11-25 17:19:00,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8071 conditions, 1850 events. 917/1850 cut-off events. For 5863/5863 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11835 event pairs, 409 based on Foata normal form. 6/1589 useless extension candidates. Maximal degree in co-relation 8026. Up to 1737 conditions per place. [2022-11-25 17:19:00,849 INFO L137 encePairwiseOnDemand]: 208/217 looper letters, 113 selfloop transitions, 24 changer transitions 0/137 dead transitions. [2022-11-25 17:19:00,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 137 transitions, 1336 flow [2022-11-25 17:19:00,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:19:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:19:00,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 799 transitions. [2022-11-25 17:19:00,854 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4602534562211982 [2022-11-25 17:19:00,854 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 799 transitions. [2022-11-25 17:19:00,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 799 transitions. [2022-11-25 17:19:00,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:19:00,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 799 transitions. [2022-11-25 17:19:00,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 99.875) internal successors, (799), 8 states have internal predecessors, (799), 0 states have call successors, (0), 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-25 17:19:00,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 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-25 17:19:00,861 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 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-25 17:19:00,861 INFO L175 Difference]: Start difference. First operand has 102 places, 110 transitions, 871 flow. Second operand 8 states and 799 transitions. [2022-11-25 17:19:00,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 137 transitions, 1336 flow [2022-11-25 17:19:00,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 137 transitions, 1328 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-25 17:19:00,883 INFO L231 Difference]: Finished difference. Result has 112 places, 120 transitions, 1054 flow [2022-11-25 17:19:00,884 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1054, PETRI_PLACES=112, PETRI_TRANSITIONS=120} [2022-11-25 17:19:00,884 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 80 predicate places. [2022-11-25 17:19:00,885 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 120 transitions, 1054 flow [2022-11-25 17:19:00,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.375) internal successors, (747), 8 states have internal predecessors, (747), 0 states have call successors, (0), 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-25 17:19:00,885 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:19:00,885 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:19:00,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:19:00,886 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:19:00,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:19:00,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1442103959, now seen corresponding path program 2 times [2022-11-25 17:19:00,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:19:00,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701938622] [2022-11-25 17:19:00,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:19:00,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:19:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:19:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:19:01,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:19:01,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701938622] [2022-11-25 17:19:01,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701938622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:19:01,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:19:01,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:19:01,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691970542] [2022-11-25 17:19:01,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:19:01,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:19:01,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:19:01,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:19:01,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:19:01,424 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 217 [2022-11-25 17:19:01,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 120 transitions, 1054 flow. Second operand has 8 states, 8 states have (on average 93.375) internal successors, (747), 8 states have internal predecessors, (747), 0 states have call successors, (0), 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-25 17:19:01,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:19:01,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 217 [2022-11-25 17:19:01,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:19:02,091 INFO L130 PetriNetUnfolder]: 940/1896 cut-off events. [2022-11-25 17:19:02,091 INFO L131 PetriNetUnfolder]: For 7428/7428 co-relation queries the response was YES. [2022-11-25 17:19:02,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8614 conditions, 1896 events. 940/1896 cut-off events. For 7428/7428 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12124 event pairs, 469 based on Foata normal form. 8/1639 useless extension candidates. Maximal degree in co-relation 8564. Up to 1749 conditions per place. [2022-11-25 17:19:02,116 INFO L137 encePairwiseOnDemand]: 208/217 looper letters, 118 selfloop transitions, 37 changer transitions 0/155 dead transitions. [2022-11-25 17:19:02,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 155 transitions, 1656 flow [2022-11-25 17:19:02,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:19:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-25 17:19:02,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1080 transitions. [2022-11-25 17:19:02,120 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45245077503142017 [2022-11-25 17:19:02,120 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1080 transitions. [2022-11-25 17:19:02,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1080 transitions. [2022-11-25 17:19:02,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:19:02,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1080 transitions. [2022-11-25 17:19:02,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.18181818181819) internal successors, (1080), 11 states have internal predecessors, (1080), 0 states have call successors, (0), 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-25 17:19:02,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 0 states have call successors, (0), 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-25 17:19:02,128 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 0 states have call successors, (0), 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-25 17:19:02,128 INFO L175 Difference]: Start difference. First operand has 112 places, 120 transitions, 1054 flow. Second operand 11 states and 1080 transitions. [2022-11-25 17:19:02,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 155 transitions, 1656 flow [2022-11-25 17:19:02,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 155 transitions, 1639 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-11-25 17:19:02,161 INFO L231 Difference]: Finished difference. Result has 123 places, 132 transitions, 1299 flow [2022-11-25 17:19:02,161 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1299, PETRI_PLACES=123, PETRI_TRANSITIONS=132} [2022-11-25 17:19:02,162 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 91 predicate places. [2022-11-25 17:19:02,162 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 132 transitions, 1299 flow [2022-11-25 17:19:02,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.375) internal successors, (747), 8 states have internal predecessors, (747), 0 states have call successors, (0), 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-25 17:19:02,163 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:19:02,163 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:19:02,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:19:02,163 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:19:02,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:19:02,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1442075129, now seen corresponding path program 3 times [2022-11-25 17:19:02,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:19:02,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711304027] [2022-11-25 17:19:02,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:19:02,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:19:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:19:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:19:02,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:19:02,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711304027] [2022-11-25 17:19:02,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711304027] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:19:02,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:19:02,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:19:02,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110035701] [2022-11-25 17:19:02,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:19:02,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:19:02,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:19:02,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:19:02,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:19:02,691 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 217 [2022-11-25 17:19:02,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 132 transitions, 1299 flow. Second operand has 8 states, 8 states have (on average 93.375) internal successors, (747), 8 states have internal predecessors, (747), 0 states have call successors, (0), 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-25 17:19:02,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:19:02,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 217 [2022-11-25 17:19:02,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:19:03,343 INFO L130 PetriNetUnfolder]: 927/1870 cut-off events. [2022-11-25 17:19:03,343 INFO L131 PetriNetUnfolder]: For 8544/8544 co-relation queries the response was YES. [2022-11-25 17:19:03,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8772 conditions, 1870 events. 927/1870 cut-off events. For 8544/8544 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11915 event pairs, 386 based on Foata normal form. 13/1618 useless extension candidates. Maximal degree in co-relation 8719. Up to 1658 conditions per place. [2022-11-25 17:19:03,366 INFO L137 encePairwiseOnDemand]: 209/217 looper letters, 124 selfloop transitions, 42 changer transitions 0/166 dead transitions. [2022-11-25 17:19:03,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 166 transitions, 1851 flow [2022-11-25 17:19:03,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:19:03,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-25 17:19:03,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1089 transitions. [2022-11-25 17:19:03,372 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45622119815668205 [2022-11-25 17:19:03,372 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1089 transitions. [2022-11-25 17:19:03,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1089 transitions. [2022-11-25 17:19:03,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:19:03,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1089 transitions. [2022-11-25 17:19:03,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 99.0) internal successors, (1089), 11 states have internal predecessors, (1089), 0 states have call successors, (0), 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-25 17:19:03,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 0 states have call successors, (0), 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-25 17:19:03,383 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 0 states have call successors, (0), 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-25 17:19:03,383 INFO L175 Difference]: Start difference. First operand has 123 places, 132 transitions, 1299 flow. Second operand 11 states and 1089 transitions. [2022-11-25 17:19:03,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 166 transitions, 1851 flow [2022-11-25 17:19:03,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 166 transitions, 1760 flow, removed 10 selfloop flow, removed 8 redundant places. [2022-11-25 17:19:03,418 INFO L231 Difference]: Finished difference. Result has 127 places, 134 transitions, 1340 flow [2022-11-25 17:19:03,419 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1340, PETRI_PLACES=127, PETRI_TRANSITIONS=134} [2022-11-25 17:19:03,419 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 95 predicate places. [2022-11-25 17:19:03,419 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 134 transitions, 1340 flow [2022-11-25 17:19:03,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.375) internal successors, (747), 8 states have internal predecessors, (747), 0 states have call successors, (0), 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-25 17:19:03,420 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:19:03,420 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:19:03,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 17:19:03,421 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:19:03,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:19:03,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1445125148, now seen corresponding path program 1 times [2022-11-25 17:19:03,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:19:03,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607677610] [2022-11-25 17:19:03,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:19:03,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:19:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:19:03,734 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:19:03,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:19:03,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607677610] [2022-11-25 17:19:03,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607677610] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:19:03,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:19:03,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:19:03,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645266342] [2022-11-25 17:19:03,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:19:03,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:19:03,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:19:03,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:19:03,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:19:03,918 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 217 [2022-11-25 17:19:03,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 134 transitions, 1340 flow. Second operand has 8 states, 8 states have (on average 93.375) internal successors, (747), 8 states have internal predecessors, (747), 0 states have call successors, (0), 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-25 17:19:03,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:19:03,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 217 [2022-11-25 17:19:03,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:19:04,609 INFO L130 PetriNetUnfolder]: 919/1897 cut-off events. [2022-11-25 17:19:04,610 INFO L131 PetriNetUnfolder]: For 9394/9394 co-relation queries the response was YES. [2022-11-25 17:19:04,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9110 conditions, 1897 events. 919/1897 cut-off events. For 9394/9394 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 12524 event pairs, 406 based on Foata normal form. 8/1635 useless extension candidates. Maximal degree in co-relation 9057. Up to 1683 conditions per place. [2022-11-25 17:19:04,626 INFO L137 encePairwiseOnDemand]: 207/217 looper letters, 140 selfloop transitions, 36 changer transitions 0/176 dead transitions. [2022-11-25 17:19:04,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 176 transitions, 2014 flow [2022-11-25 17:19:04,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:19:04,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:19:04,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 805 transitions. [2022-11-25 17:19:04,629 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4637096774193548 [2022-11-25 17:19:04,629 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 805 transitions. [2022-11-25 17:19:04,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 805 transitions. [2022-11-25 17:19:04,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:19:04,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 805 transitions. [2022-11-25 17:19:04,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.625) internal successors, (805), 8 states have internal predecessors, (805), 0 states have call successors, (0), 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-25 17:19:04,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 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-25 17:19:04,651 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 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-25 17:19:04,651 INFO L175 Difference]: Start difference. First operand has 127 places, 134 transitions, 1340 flow. Second operand 8 states and 805 transitions. [2022-11-25 17:19:04,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 176 transitions, 2014 flow [2022-11-25 17:19:04,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 176 transitions, 1951 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-11-25 17:19:04,695 INFO L231 Difference]: Finished difference. Result has 128 places, 144 transitions, 1498 flow [2022-11-25 17:19:04,696 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1276, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1498, PETRI_PLACES=128, PETRI_TRANSITIONS=144} [2022-11-25 17:19:04,696 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 96 predicate places. [2022-11-25 17:19:04,697 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 144 transitions, 1498 flow [2022-11-25 17:19:04,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.375) internal successors, (747), 8 states have internal predecessors, (747), 0 states have call successors, (0), 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-25 17:19:04,697 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:19:04,697 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:19:04,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 17:19:04,698 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:19:04,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:19:04,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1452966909, now seen corresponding path program 2 times [2022-11-25 17:19:04,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:19:04,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355354000] [2022-11-25 17:19:04,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:19:04,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:19:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:19:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:19:05,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:19:05,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355354000] [2022-11-25 17:19:05,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355354000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:19:05,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:19:05,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:19:05,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282206580] [2022-11-25 17:19:05,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:19:05,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:19:05,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:19:05,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:19:05,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:19:05,220 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 217 [2022-11-25 17:19:05,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 144 transitions, 1498 flow. Second operand has 8 states, 8 states have (on average 93.375) internal successors, (747), 8 states have internal predecessors, (747), 0 states have call successors, (0), 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-25 17:19:05,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:19:05,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 217 [2022-11-25 17:19:05,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:19:06,007 INFO L130 PetriNetUnfolder]: 950/1949 cut-off events. [2022-11-25 17:19:06,007 INFO L131 PetriNetUnfolder]: For 10594/10594 co-relation queries the response was YES. [2022-11-25 17:19:06,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9603 conditions, 1949 events. 950/1949 cut-off events. For 10594/10594 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 12843 event pairs, 424 based on Foata normal form. 9/1686 useless extension candidates. Maximal degree in co-relation 9548. Up to 1695 conditions per place. [2022-11-25 17:19:06,024 INFO L137 encePairwiseOnDemand]: 207/217 looper letters, 152 selfloop transitions, 49 changer transitions 0/201 dead transitions. [2022-11-25 17:19:06,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 201 transitions, 2390 flow [2022-11-25 17:19:06,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:19:06,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-25 17:19:06,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1088 transitions. [2022-11-25 17:19:06,027 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45580226225387516 [2022-11-25 17:19:06,027 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1088 transitions. [2022-11-25 17:19:06,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1088 transitions. [2022-11-25 17:19:06,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:19:06,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1088 transitions. [2022-11-25 17:19:06,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.9090909090909) internal successors, (1088), 11 states have internal predecessors, (1088), 0 states have call successors, (0), 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-25 17:19:06,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 0 states have call successors, (0), 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-25 17:19:06,034 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 0 states have call successors, (0), 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-25 17:19:06,034 INFO L175 Difference]: Start difference. First operand has 128 places, 144 transitions, 1498 flow. Second operand 11 states and 1088 transitions. [2022-11-25 17:19:06,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 201 transitions, 2390 flow [2022-11-25 17:19:06,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 201 transitions, 2356 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-25 17:19:06,079 INFO L231 Difference]: Finished difference. Result has 136 places, 165 transitions, 1913 flow [2022-11-25 17:19:06,080 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1469, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1913, PETRI_PLACES=136, PETRI_TRANSITIONS=165} [2022-11-25 17:19:06,080 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 104 predicate places. [2022-11-25 17:19:06,080 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 165 transitions, 1913 flow [2022-11-25 17:19:06,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.375) internal successors, (747), 8 states have internal predecessors, (747), 0 states have call successors, (0), 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-25 17:19:06,081 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:19:06,081 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:19:06,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 17:19:06,081 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:19:06,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:19:06,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1453168718, now seen corresponding path program 2 times [2022-11-25 17:19:06,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:19:06,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839695358] [2022-11-25 17:19:06,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:19:06,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:19:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:19:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:19:06,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:19:06,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839695358] [2022-11-25 17:19:06,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839695358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:19:06,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:19:06,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:19:06,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428667175] [2022-11-25 17:19:06,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:19:06,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:19:06,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:19:06,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:19:06,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:19:06,558 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 217 [2022-11-25 17:19:06,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 165 transitions, 1913 flow. Second operand has 8 states, 8 states have (on average 93.375) internal successors, (747), 8 states have internal predecessors, (747), 0 states have call successors, (0), 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-25 17:19:06,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:19:06,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 217 [2022-11-25 17:19:06,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:19:07,340 INFO L130 PetriNetUnfolder]: 965/1978 cut-off events. [2022-11-25 17:19:07,340 INFO L131 PetriNetUnfolder]: For 13037/13037 co-relation queries the response was YES. [2022-11-25 17:19:07,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10287 conditions, 1978 events. 965/1978 cut-off events. For 13037/13037 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 13051 event pairs, 418 based on Foata normal form. 8/1712 useless extension candidates. Maximal degree in co-relation 10228. Up to 1764 conditions per place. [2022-11-25 17:19:07,360 INFO L137 encePairwiseOnDemand]: 207/217 looper letters, 161 selfloop transitions, 41 changer transitions 0/202 dead transitions. [2022-11-25 17:19:07,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 202 transitions, 2594 flow [2022-11-25 17:19:07,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:19:07,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-25 17:19:07,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 994 transitions. [2022-11-25 17:19:07,364 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45806451612903226 [2022-11-25 17:19:07,364 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 994 transitions. [2022-11-25 17:19:07,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 994 transitions. [2022-11-25 17:19:07,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:19:07,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 994 transitions. [2022-11-25 17:19:07,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.4) internal successors, (994), 10 states have internal predecessors, (994), 0 states have call successors, (0), 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-25 17:19:07,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 217.0) internal successors, (2387), 11 states have internal predecessors, (2387), 0 states have call successors, (0), 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-25 17:19:07,378 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 217.0) internal successors, (2387), 11 states have internal predecessors, (2387), 0 states have call successors, (0), 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-25 17:19:07,378 INFO L175 Difference]: Start difference. First operand has 136 places, 165 transitions, 1913 flow. Second operand 10 states and 994 transitions. [2022-11-25 17:19:07,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 202 transitions, 2594 flow [2022-11-25 17:19:07,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 202 transitions, 2555 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-11-25 17:19:07,441 INFO L231 Difference]: Finished difference. Result has 142 places, 170 transitions, 2056 flow [2022-11-25 17:19:07,442 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1874, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2056, PETRI_PLACES=142, PETRI_TRANSITIONS=170} [2022-11-25 17:19:07,442 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 110 predicate places. [2022-11-25 17:19:07,442 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 170 transitions, 2056 flow [2022-11-25 17:19:07,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.375) internal successors, (747), 8 states have internal predecessors, (747), 0 states have call successors, (0), 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-25 17:19:07,443 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:19:07,443 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:19:07,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 17:19:07,443 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:19:07,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:19:07,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1452883208, now seen corresponding path program 3 times [2022-11-25 17:19:07,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:19:07,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085827517] [2022-11-25 17:19:07,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:19:07,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:19:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:19:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:19:07,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:19:07,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085827517] [2022-11-25 17:19:07,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085827517] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:19:07,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:19:07,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:19:07,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667092453] [2022-11-25 17:19:07,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:19:07,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:19:07,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:19:07,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:19:07,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:19:07,890 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 217 [2022-11-25 17:19:07,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 170 transitions, 2056 flow. Second operand has 8 states, 8 states have (on average 93.375) internal successors, (747), 8 states have internal predecessors, (747), 0 states have call successors, (0), 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-25 17:19:07,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:19:07,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 217 [2022-11-25 17:19:07,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:19:08,684 INFO L130 PetriNetUnfolder]: 937/1929 cut-off events. [2022-11-25 17:19:08,684 INFO L131 PetriNetUnfolder]: For 14212/14212 co-relation queries the response was YES. [2022-11-25 17:19:08,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10178 conditions, 1929 events. 937/1929 cut-off events. For 14212/14212 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12665 event pairs, 370 based on Foata normal form. 14/1681 useless extension candidates. Maximal degree in co-relation 10116. Up to 1630 conditions per place. [2022-11-25 17:19:08,705 INFO L137 encePairwiseOnDemand]: 207/217 looper letters, 153 selfloop transitions, 60 changer transitions 0/213 dead transitions. [2022-11-25 17:19:08,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 213 transitions, 2772 flow [2022-11-25 17:19:08,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:19:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-25 17:19:08,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1100 transitions. [2022-11-25 17:19:08,709 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4608294930875576 [2022-11-25 17:19:08,709 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1100 transitions. [2022-11-25 17:19:08,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1100 transitions. [2022-11-25 17:19:08,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:19:08,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1100 transitions. [2022-11-25 17:19:08,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 100.0) internal successors, (1100), 11 states have internal predecessors, (1100), 0 states have call successors, (0), 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-25 17:19:08,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 0 states have call successors, (0), 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-25 17:19:08,718 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 0 states have call successors, (0), 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-25 17:19:08,718 INFO L175 Difference]: Start difference. First operand has 142 places, 170 transitions, 2056 flow. Second operand 11 states and 1100 transitions. [2022-11-25 17:19:08,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 213 transitions, 2772 flow [2022-11-25 17:19:08,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 213 transitions, 2673 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-11-25 17:19:08,776 INFO L231 Difference]: Finished difference. Result has 148 places, 171 transitions, 2169 flow [2022-11-25 17:19:08,777 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1915, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2169, PETRI_PLACES=148, PETRI_TRANSITIONS=171} [2022-11-25 17:19:08,777 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 116 predicate places. [2022-11-25 17:19:08,778 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 171 transitions, 2169 flow [2022-11-25 17:19:08,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.375) internal successors, (747), 8 states have internal predecessors, (747), 0 states have call successors, (0), 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-25 17:19:08,778 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:19:08,778 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:19:08,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 17:19:08,779 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:19:08,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:19:08,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1452883209, now seen corresponding path program 3 times [2022-11-25 17:19:08,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:19:08,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524675912] [2022-11-25 17:19:08,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:19:08,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:19:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:19:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:19:09,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:19:09,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524675912] [2022-11-25 17:19:09,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524675912] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:19:09,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:19:09,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:19:09,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808274215] [2022-11-25 17:19:09,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:19:09,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:19:09,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:19:09,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:19:09,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:19:09,357 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 217 [2022-11-25 17:19:09,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 171 transitions, 2169 flow. Second operand has 8 states, 8 states have (on average 93.375) internal successors, (747), 8 states have internal predecessors, (747), 0 states have call successors, (0), 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-25 17:19:09,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:19:09,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 217 [2022-11-25 17:19:09,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:19:10,207 INFO L130 PetriNetUnfolder]: 929/1914 cut-off events. [2022-11-25 17:19:10,208 INFO L131 PetriNetUnfolder]: For 15811/15811 co-relation queries the response was YES. [2022-11-25 17:19:10,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10456 conditions, 1914 events. 929/1914 cut-off events. For 15811/15811 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 12543 event pairs, 369 based on Foata normal form. 7/1702 useless extension candidates. Maximal degree in co-relation 10392. Up to 1628 conditions per place. [2022-11-25 17:19:10,232 INFO L137 encePairwiseOnDemand]: 208/217 looper letters, 152 selfloop transitions, 58 changer transitions 0/210 dead transitions. [2022-11-25 17:19:10,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 210 transitions, 2825 flow [2022-11-25 17:19:10,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:19:10,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-25 17:19:10,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1097 transitions. [2022-11-25 17:19:10,237 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.459572685379137 [2022-11-25 17:19:10,237 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1097 transitions. [2022-11-25 17:19:10,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1097 transitions. [2022-11-25 17:19:10,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:19:10,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1097 transitions. [2022-11-25 17:19:10,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 99.72727272727273) internal successors, (1097), 11 states have internal predecessors, (1097), 0 states have call successors, (0), 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-25 17:19:10,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 0 states have call successors, (0), 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-25 17:19:10,244 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 0 states have call successors, (0), 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-25 17:19:10,244 INFO L175 Difference]: Start difference. First operand has 148 places, 171 transitions, 2169 flow. Second operand 11 states and 1097 transitions. [2022-11-25 17:19:10,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 210 transitions, 2825 flow [2022-11-25 17:19:10,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 210 transitions, 2679 flow, removed 11 selfloop flow, removed 8 redundant places. [2022-11-25 17:19:10,303 INFO L231 Difference]: Finished difference. Result has 150 places, 168 transitions, 2087 flow [2022-11-25 17:19:10,303 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1971, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2087, PETRI_PLACES=150, PETRI_TRANSITIONS=168} [2022-11-25 17:19:10,304 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 118 predicate places. [2022-11-25 17:19:10,304 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 168 transitions, 2087 flow [2022-11-25 17:19:10,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.375) internal successors, (747), 8 states have internal predecessors, (747), 0 states have call successors, (0), 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-25 17:19:10,304 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:19:10,305 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:19:10,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 17:19:10,305 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:19:10,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:19:10,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1787771528, now seen corresponding path program 1 times [2022-11-25 17:19:10,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:19:10,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802158569] [2022-11-25 17:19:10,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:19:10,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:19:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:19:10,622 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:19:10,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:19:10,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802158569] [2022-11-25 17:19:10,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802158569] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:19:10,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494249615] [2022-11-25 17:19:10,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:19:10,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:19:10,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:19:10,624 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:19:10,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 17:19:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:19:10,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 17:19:10,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:19:10,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-25 17:19:10,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:19:10,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:19:11,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-25 17:19:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:19:17,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:19:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:19:21,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494249615] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:19:21,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:19:21,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2022-11-25 17:19:21,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385399922] [2022-11-25 17:19:21,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:19:21,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-25 17:19:21,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:19:21,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-25 17:19:21,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=301, Unknown=11, NotChecked=0, Total=420 [2022-11-25 17:19:23,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:19:25,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:19:26,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:19:28,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:19:30,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:19:32,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:19:33,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:19:35,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:19:36,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:19:38,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:19:40,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:19:41,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:19:43,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:19:44,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:19:46,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:19:48,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:19:48,197 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 217 [2022-11-25 17:19:48,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 168 transitions, 2087 flow. Second operand has 21 states, 21 states have (on average 75.57142857142857) internal successors, (1587), 21 states have internal predecessors, (1587), 0 states have call successors, (0), 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-25 17:19:48,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:19:48,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 217 [2022-11-25 17:19:48,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:19:49,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:19:51,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:19:52,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:19:54,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:19:55,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:19:57,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:19:59,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:20:01,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:20:05,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:20:07,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:20:09,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:20:14,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:20:15,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:20:17,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:20:26,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:20:29,169 INFO L130 PetriNetUnfolder]: 894/1847 cut-off events. [2022-11-25 17:20:29,169 INFO L131 PetriNetUnfolder]: For 12561/12561 co-relation queries the response was YES. [2022-11-25 17:20:29,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9692 conditions, 1847 events. 894/1847 cut-off events. For 12561/12561 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11738 event pairs, 136 based on Foata normal form. 32/1660 useless extension candidates. Maximal degree in co-relation 9630. Up to 1030 conditions per place. [2022-11-25 17:20:29,187 INFO L137 encePairwiseOnDemand]: 207/217 looper letters, 165 selfloop transitions, 88 changer transitions 0/253 dead transitions. [2022-11-25 17:20:29,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 253 transitions, 3198 flow [2022-11-25 17:20:29,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 17:20:29,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-25 17:20:29,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1005 transitions. [2022-11-25 17:20:29,190 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3859447004608295 [2022-11-25 17:20:29,191 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1005 transitions. [2022-11-25 17:20:29,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1005 transitions. [2022-11-25 17:20:29,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:20:29,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1005 transitions. [2022-11-25 17:20:29,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 83.75) internal successors, (1005), 12 states have internal predecessors, (1005), 0 states have call successors, (0), 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-25 17:20:29,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 217.0) internal successors, (2821), 13 states have internal predecessors, (2821), 0 states have call successors, (0), 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-25 17:20:29,198 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 217.0) internal successors, (2821), 13 states have internal predecessors, (2821), 0 states have call successors, (0), 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-25 17:20:29,198 INFO L175 Difference]: Start difference. First operand has 150 places, 168 transitions, 2087 flow. Second operand 12 states and 1005 transitions. [2022-11-25 17:20:29,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 253 transitions, 3198 flow [2022-11-25 17:20:29,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 253 transitions, 3111 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-11-25 17:20:29,254 INFO L231 Difference]: Finished difference. Result has 159 places, 180 transitions, 2494 flow [2022-11-25 17:20:29,255 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2494, PETRI_PLACES=159, PETRI_TRANSITIONS=180} [2022-11-25 17:20:29,255 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 127 predicate places. [2022-11-25 17:20:29,255 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 180 transitions, 2494 flow [2022-11-25 17:20:29,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 75.57142857142857) internal successors, (1587), 21 states have internal predecessors, (1587), 0 states have call successors, (0), 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-25 17:20:29,256 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:20:29,256 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:20:29,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:20:29,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:20:29,462 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:20:29,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:20:29,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1662979877, now seen corresponding path program 1 times [2022-11-25 17:20:29,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:20:29,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172186981] [2022-11-25 17:20:29,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:20:29,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:20:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:20:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:20:29,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:20:29,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172186981] [2022-11-25 17:20:29,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172186981] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:20:29,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64505136] [2022-11-25 17:20:29,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:20:29,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:20:29,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:20:29,767 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:20:29,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 17:20:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:20:29,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 17:20:29,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:20:29,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-25 17:20:29,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:20:29,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:20:30,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-25 17:20:37,987 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:20:37,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:20:44,222 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_118| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_119| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_62| Int) (v_ArrVal_740 (Array Int Int))) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_118| (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_119| 28)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_62|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_62| v_ArrVal_740) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_119| v_ArrVal_742) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_118|) 2147483647))) is different from false [2022-11-25 17:20:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:20:44,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64505136] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:20:44,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:20:44,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-11-25 17:20:44,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686464742] [2022-11-25 17:20:44,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:20:44,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 17:20:44,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:20:44,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 17:20:44,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=215, Unknown=8, NotChecked=32, Total=342 [2022-11-25 17:20:44,501 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 217 [2022-11-25 17:20:44,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 180 transitions, 2494 flow. Second operand has 19 states, 19 states have (on average 80.63157894736842) internal successors, (1532), 19 states have internal predecessors, (1532), 0 states have call successors, (0), 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-25 17:20:44,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:20:44,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 217 [2022-11-25 17:20:44,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:20:46,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:20:48,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:20:50,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:20:52,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:20:53,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:20:55,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:20:57,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:20:59,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:21:01,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:21:03,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:21:05,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:21:07,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:21:09,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:21:11,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:21:13,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:21:15,204 INFO L130 PetriNetUnfolder]: 930/1916 cut-off events. [2022-11-25 17:21:15,204 INFO L131 PetriNetUnfolder]: For 18023/18023 co-relation queries the response was YES. [2022-11-25 17:21:15,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11090 conditions, 1916 events. 930/1916 cut-off events. For 18023/18023 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12448 event pairs, 302 based on Foata normal form. 18/1705 useless extension candidates. Maximal degree in co-relation 11021. Up to 1439 conditions per place. [2022-11-25 17:21:15,225 INFO L137 encePairwiseOnDemand]: 207/217 looper letters, 167 selfloop transitions, 101 changer transitions 0/268 dead transitions. [2022-11-25 17:21:15,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 268 transitions, 4095 flow [2022-11-25 17:21:15,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 17:21:15,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-25 17:21:15,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1049 transitions. [2022-11-25 17:21:15,228 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40284178187403996 [2022-11-25 17:21:15,228 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1049 transitions. [2022-11-25 17:21:15,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1049 transitions. [2022-11-25 17:21:15,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:21:15,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1049 transitions. [2022-11-25 17:21:15,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 87.41666666666667) internal successors, (1049), 12 states have internal predecessors, (1049), 0 states have call successors, (0), 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-25 17:21:15,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 217.0) internal successors, (2821), 13 states have internal predecessors, (2821), 0 states have call successors, (0), 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-25 17:21:15,236 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 217.0) internal successors, (2821), 13 states have internal predecessors, (2821), 0 states have call successors, (0), 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-25 17:21:15,236 INFO L175 Difference]: Start difference. First operand has 159 places, 180 transitions, 2494 flow. Second operand 12 states and 1049 transitions. [2022-11-25 17:21:15,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 268 transitions, 4095 flow [2022-11-25 17:21:15,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 268 transitions, 3891 flow, removed 77 selfloop flow, removed 4 redundant places. [2022-11-25 17:21:15,358 INFO L231 Difference]: Finished difference. Result has 172 places, 219 transitions, 3377 flow [2022-11-25 17:21:15,359 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2366, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3377, PETRI_PLACES=172, PETRI_TRANSITIONS=219} [2022-11-25 17:21:15,360 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 140 predicate places. [2022-11-25 17:21:15,360 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 219 transitions, 3377 flow [2022-11-25 17:21:15,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 80.63157894736842) internal successors, (1532), 19 states have internal predecessors, (1532), 0 states have call successors, (0), 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-25 17:21:15,361 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:21:15,361 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 17:21:15,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-25 17:21:15,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-25 17:21:15,567 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:21:15,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:21:15,568 INFO L85 PathProgramCache]: Analyzing trace with hash 61457396, now seen corresponding path program 1 times [2022-11-25 17:21:15,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:21:15,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412730013] [2022-11-25 17:21:15,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:21:15,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:21:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:21:15,615 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-25 17:21:15,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:21:15,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412730013] [2022-11-25 17:21:15,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412730013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:21:15,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:21:15,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:21:15,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857814964] [2022-11-25 17:21:15,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:21:15,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:21:15,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:21:15,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:21:15,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:21:15,630 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 217 [2022-11-25 17:21:15,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 219 transitions, 3377 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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-25 17:21:15,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:21:15,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 217 [2022-11-25 17:21:15,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:21:16,147 INFO L130 PetriNetUnfolder]: 848/1754 cut-off events. [2022-11-25 17:21:16,147 INFO L131 PetriNetUnfolder]: For 19063/19063 co-relation queries the response was YES. [2022-11-25 17:21:16,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10898 conditions, 1754 events. 848/1754 cut-off events. For 19063/19063 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11209 event pairs, 264 based on Foata normal form. 0/1611 useless extension candidates. Maximal degree in co-relation 10822. Up to 1258 conditions per place. [2022-11-25 17:21:16,171 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 256 selfloop transitions, 16 changer transitions 0/272 dead transitions. [2022-11-25 17:21:16,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 272 transitions, 4543 flow [2022-11-25 17:21:16,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:21:16,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:21:16,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2022-11-25 17:21:16,172 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5345622119815668 [2022-11-25 17:21:16,173 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2022-11-25 17:21:16,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2022-11-25 17:21:16,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:21:16,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2022-11-25 17:21:16,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:21:16,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 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-25 17:21:16,177 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 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-25 17:21:16,177 INFO L175 Difference]: Start difference. First operand has 172 places, 219 transitions, 3377 flow. Second operand 3 states and 348 transitions. [2022-11-25 17:21:16,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 272 transitions, 4543 flow [2022-11-25 17:21:16,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 272 transitions, 4343 flow, removed 49 selfloop flow, removed 7 redundant places. [2022-11-25 17:21:16,333 INFO L231 Difference]: Finished difference. Result has 167 places, 219 transitions, 3260 flow [2022-11-25 17:21:16,333 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3202, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3260, PETRI_PLACES=167, PETRI_TRANSITIONS=219} [2022-11-25 17:21:16,334 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 135 predicate places. [2022-11-25 17:21:16,334 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 219 transitions, 3260 flow [2022-11-25 17:21:16,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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-25 17:21:16,334 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:21:16,335 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 17:21:16,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 17:21:16,335 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:21:16,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:21:16,335 INFO L85 PathProgramCache]: Analyzing trace with hash 61457394, now seen corresponding path program 1 times [2022-11-25 17:21:16,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:21:16,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082772226] [2022-11-25 17:21:16,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:21:16,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:21:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:21:16,396 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:21:16,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:21:16,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082772226] [2022-11-25 17:21:16,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082772226] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:21:16,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750377685] [2022-11-25 17:21:16,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:21:16,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:21:16,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:21:16,399 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:21:16,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 17:21:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:21:16,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:21:16,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:21:16,575 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:21:16,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:21:16,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750377685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:21:16,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:21:16,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-11-25 17:21:16,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717248300] [2022-11-25 17:21:16,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:21:16,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:21:16,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:21:16,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:21:16,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:21:16,594 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 217 [2022-11-25 17:21:16,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 219 transitions, 3260 flow. Second operand has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 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-25 17:21:16,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:21:16,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 217 [2022-11-25 17:21:16,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:21:17,124 INFO L130 PetriNetUnfolder]: 766/1592 cut-off events. [2022-11-25 17:21:17,125 INFO L131 PetriNetUnfolder]: For 17141/17141 co-relation queries the response was YES. [2022-11-25 17:21:17,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10252 conditions, 1592 events. 766/1592 cut-off events. For 17141/17141 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9917 event pairs, 200 based on Foata normal form. 80/1615 useless extension candidates. Maximal degree in co-relation 10178. Up to 1159 conditions per place. [2022-11-25 17:21:17,145 INFO L137 encePairwiseOnDemand]: 214/217 looper letters, 257 selfloop transitions, 11 changer transitions 0/268 dead transitions. [2022-11-25 17:21:17,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 268 transitions, 4247 flow [2022-11-25 17:21:17,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:21:17,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:21:17,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions. [2022-11-25 17:21:17,147 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2022-11-25 17:21:17,147 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 469 transitions. [2022-11-25 17:21:17,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 469 transitions. [2022-11-25 17:21:17,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:21:17,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 469 transitions. [2022-11-25 17:21:17,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 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-25 17:21:17,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 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-25 17:21:17,151 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 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-25 17:21:17,151 INFO L175 Difference]: Start difference. First operand has 167 places, 219 transitions, 3260 flow. Second operand 4 states and 469 transitions. [2022-11-25 17:21:17,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 268 transitions, 4247 flow [2022-11-25 17:21:17,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 268 transitions, 4231 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:21:17,299 INFO L231 Difference]: Finished difference. Result has 168 places, 218 transitions, 3262 flow [2022-11-25 17:21:17,299 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3240, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3262, PETRI_PLACES=168, PETRI_TRANSITIONS=218} [2022-11-25 17:21:17,300 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 136 predicate places. [2022-11-25 17:21:17,300 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 218 transitions, 3262 flow [2022-11-25 17:21:17,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 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-25 17:21:17,301 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:21:17,301 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 17:21:17,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:21:17,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-25 17:21:17,507 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:21:17,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:21:17,507 INFO L85 PathProgramCache]: Analyzing trace with hash 395837916, now seen corresponding path program 1 times [2022-11-25 17:21:17,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:21:17,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680622745] [2022-11-25 17:21:17,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:21:17,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:21:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:21:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-25 17:21:17,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:21:17,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680622745] [2022-11-25 17:21:17,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680622745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:21:17,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:21:17,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:21:17,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596551416] [2022-11-25 17:21:17,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:21:17,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:21:17,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:21:17,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:21:17,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:21:17,567 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 217 [2022-11-25 17:21:17,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 218 transitions, 3262 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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-25 17:21:17,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:21:17,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 217 [2022-11-25 17:21:17,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:21:17,927 INFO L130 PetriNetUnfolder]: 728/1510 cut-off events. [2022-11-25 17:21:17,927 INFO L131 PetriNetUnfolder]: For 16358/16358 co-relation queries the response was YES. [2022-11-25 17:21:17,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9841 conditions, 1510 events. 728/1510 cut-off events. For 16358/16358 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9305 event pairs, 162 based on Foata normal form. 0/1497 useless extension candidates. Maximal degree in co-relation 9766. Up to 870 conditions per place. [2022-11-25 17:21:17,941 INFO L137 encePairwiseOnDemand]: 212/217 looper letters, 216 selfloop transitions, 24 changer transitions 0/240 dead transitions. [2022-11-25 17:21:17,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 240 transitions, 4012 flow [2022-11-25 17:21:17,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:21:17,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:21:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2022-11-25 17:21:17,945 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5176651305683564 [2022-11-25 17:21:17,945 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2022-11-25 17:21:17,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2022-11-25 17:21:17,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:21:17,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2022-11-25 17:21:17,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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-25 17:21:17,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 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-25 17:21:17,948 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 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-25 17:21:17,948 INFO L175 Difference]: Start difference. First operand has 168 places, 218 transitions, 3262 flow. Second operand 3 states and 337 transitions. [2022-11-25 17:21:17,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 240 transitions, 4012 flow [2022-11-25 17:21:18,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 240 transitions, 3995 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:21:18,033 INFO L231 Difference]: Finished difference. Result has 168 places, 218 transitions, 3326 flow [2022-11-25 17:21:18,033 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3246, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3326, PETRI_PLACES=168, PETRI_TRANSITIONS=218} [2022-11-25 17:21:18,034 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 136 predicate places. [2022-11-25 17:21:18,034 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 218 transitions, 3326 flow [2022-11-25 17:21:18,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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-25 17:21:18,034 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:21:18,034 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 17:21:18,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 17:21:18,035 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:21:18,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:21:18,035 INFO L85 PathProgramCache]: Analyzing trace with hash 395837914, now seen corresponding path program 1 times [2022-11-25 17:21:18,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:21:18,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508804206] [2022-11-25 17:21:18,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:21:18,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:21:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:21:18,098 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:21:18,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:21:18,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508804206] [2022-11-25 17:21:18,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508804206] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:21:18,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849777000] [2022-11-25 17:21:18,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:21:18,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:21:18,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:21:18,101 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:21:18,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 17:21:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:21:18,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:21:18,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:21:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:21:18,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:21:18,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849777000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:21:18,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:21:18,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-11-25 17:21:18,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623589314] [2022-11-25 17:21:18,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:21:18,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:21:18,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:21:18,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:21:18,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:21:18,284 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 217 [2022-11-25 17:21:18,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 218 transitions, 3326 flow. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 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-25 17:21:18,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:21:18,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 217 [2022-11-25 17:21:18,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:21:18,653 INFO L130 PetriNetUnfolder]: 690/1428 cut-off events. [2022-11-25 17:21:18,654 INFO L131 PetriNetUnfolder]: For 15892/15892 co-relation queries the response was YES. [2022-11-25 17:21:18,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9746 conditions, 1428 events. 690/1428 cut-off events. For 15892/15892 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8625 event pairs, 83 based on Foata normal form. 44/1459 useless extension candidates. Maximal degree in co-relation 9671. Up to 1044 conditions per place. [2022-11-25 17:21:18,666 INFO L137 encePairwiseOnDemand]: 214/217 looper letters, 237 selfloop transitions, 10 changer transitions 0/247 dead transitions. [2022-11-25 17:21:18,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 247 transitions, 4157 flow [2022-11-25 17:21:18,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:21:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:21:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 451 transitions. [2022-11-25 17:21:18,668 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5195852534562212 [2022-11-25 17:21:18,668 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 451 transitions. [2022-11-25 17:21:18,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 451 transitions. [2022-11-25 17:21:18,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:21:18,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 451 transitions. [2022-11-25 17:21:18,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 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-25 17:21:18,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 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-25 17:21:18,672 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 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-25 17:21:18,672 INFO L175 Difference]: Start difference. First operand has 168 places, 218 transitions, 3326 flow. Second operand 4 states and 451 transitions. [2022-11-25 17:21:18,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 247 transitions, 4157 flow [2022-11-25 17:21:18,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 247 transitions, 4131 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 17:21:18,762 INFO L231 Difference]: Finished difference. Result has 169 places, 217 transitions, 3317 flow [2022-11-25 17:21:18,762 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3297, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3317, PETRI_PLACES=169, PETRI_TRANSITIONS=217} [2022-11-25 17:21:18,763 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 137 predicate places. [2022-11-25 17:21:18,763 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 217 transitions, 3317 flow [2022-11-25 17:21:18,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 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-25 17:21:18,763 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:21:18,764 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:21:18,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 17:21:18,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-25 17:21:18,975 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:21:18,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:21:18,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1907434353, now seen corresponding path program 1 times [2022-11-25 17:21:18,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:21:18,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833911294] [2022-11-25 17:21:18,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:21:18,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:21:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:21:19,571 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:21:19,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:21:19,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833911294] [2022-11-25 17:21:19,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833911294] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:21:19,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158766902] [2022-11-25 17:21:19,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:21:19,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:21:19,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:21:19,573 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:21:19,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 17:21:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:21:19,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-25 17:21:19,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:21:19,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 17:21:20,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:21:20,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 17:21:20,127 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:21:20,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:21:20,726 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:21:20,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-25 17:21:20,735 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:21:20,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2022-11-25 17:21:20,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-25 17:21:20,765 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:21:20,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2022-11-25 17:21:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:21:20,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158766902] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:21:20,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:21:20,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-25 17:21:20,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199815975] [2022-11-25 17:21:20,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:21:20,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-25 17:21:20,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:21:20,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-25 17:21:20,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-11-25 17:21:23,121 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 217 [2022-11-25 17:21:23,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 217 transitions, 3317 flow. Second operand has 25 states, 25 states have (on average 86.68) internal successors, (2167), 25 states have internal predecessors, (2167), 0 states have call successors, (0), 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-25 17:21:23,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:21:23,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 217 [2022-11-25 17:21:23,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:21:25,952 INFO L130 PetriNetUnfolder]: 1062/2157 cut-off events. [2022-11-25 17:21:25,952 INFO L131 PetriNetUnfolder]: For 23826/23826 co-relation queries the response was YES. [2022-11-25 17:21:25,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14140 conditions, 2157 events. 1062/2157 cut-off events. For 23826/23826 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 14094 event pairs, 154 based on Foata normal form. 12/2147 useless extension candidates. Maximal degree in co-relation 14064. Up to 787 conditions per place. [2022-11-25 17:21:25,967 INFO L137 encePairwiseOnDemand]: 207/217 looper letters, 289 selfloop transitions, 162 changer transitions 0/451 dead transitions. [2022-11-25 17:21:25,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 451 transitions, 6775 flow [2022-11-25 17:21:25,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 17:21:25,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-11-25 17:21:25,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2487 transitions. [2022-11-25 17:21:25,973 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4244751664106503 [2022-11-25 17:21:25,973 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2487 transitions. [2022-11-25 17:21:25,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2487 transitions. [2022-11-25 17:21:25,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:21:25,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2487 transitions. [2022-11-25 17:21:25,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 92.11111111111111) internal successors, (2487), 27 states have internal predecessors, (2487), 0 states have call successors, (0), 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-25 17:21:25,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 217.0) internal successors, (6076), 28 states have internal predecessors, (6076), 0 states have call successors, (0), 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-25 17:21:25,987 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 217.0) internal successors, (6076), 28 states have internal predecessors, (6076), 0 states have call successors, (0), 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-25 17:21:25,988 INFO L175 Difference]: Start difference. First operand has 169 places, 217 transitions, 3317 flow. Second operand 27 states and 2487 transitions. [2022-11-25 17:21:25,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 451 transitions, 6775 flow [2022-11-25 17:21:26,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 451 transitions, 6732 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-25 17:21:26,095 INFO L231 Difference]: Finished difference. Result has 199 places, 277 transitions, 4646 flow [2022-11-25 17:21:26,095 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3256, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=4646, PETRI_PLACES=199, PETRI_TRANSITIONS=277} [2022-11-25 17:21:26,095 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 167 predicate places. [2022-11-25 17:21:26,096 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 277 transitions, 4646 flow [2022-11-25 17:21:26,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 86.68) internal successors, (2167), 25 states have internal predecessors, (2167), 0 states have call successors, (0), 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-25 17:21:26,097 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:21:26,097 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:21:26,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:21:26,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-25 17:21:26,303 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:21:26,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:21:26,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1601323109, now seen corresponding path program 1 times [2022-11-25 17:21:26,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:21:26,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225518656] [2022-11-25 17:21:26,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:21:26,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:21:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:21:26,378 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:21:26,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:21:26,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225518656] [2022-11-25 17:21:26,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225518656] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:21:26,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744586177] [2022-11-25 17:21:26,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:21:26,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:21:26,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:21:26,380 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:21:26,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 17:21:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:21:26,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:21:26,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:21:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:21:26,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:21:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:21:26,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744586177] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:21:26,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:21:26,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-25 17:21:26,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470590107] [2022-11-25 17:21:26,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:21:26,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:21:26,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:21:26,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:21:26,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:21:26,620 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 217 [2022-11-25 17:21:26,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 277 transitions, 4646 flow. Second operand has 7 states, 7 states have (on average 104.57142857142857) internal successors, (732), 7 states have internal predecessors, (732), 0 states have call successors, (0), 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-25 17:21:26,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:21:26,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 217 [2022-11-25 17:21:26,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:21:27,588 INFO L130 PetriNetUnfolder]: 1400/2940 cut-off events. [2022-11-25 17:21:27,589 INFO L131 PetriNetUnfolder]: For 41856/41856 co-relation queries the response was YES. [2022-11-25 17:21:27,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21111 conditions, 2940 events. 1400/2940 cut-off events. For 41856/41856 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 18760 event pairs, 255 based on Foata normal form. 327/3267 useless extension candidates. Maximal degree in co-relation 21028. Up to 747 conditions per place. [2022-11-25 17:21:27,612 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 396 selfloop transitions, 33 changer transitions 0/429 dead transitions. [2022-11-25 17:21:27,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 429 transitions, 8016 flow [2022-11-25 17:21:27,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:21:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:21:27,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 682 transitions. [2022-11-25 17:21:27,614 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-11-25 17:21:27,615 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 682 transitions. [2022-11-25 17:21:27,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 682 transitions. [2022-11-25 17:21:27,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:21:27,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 682 transitions. [2022-11-25 17:21:27,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 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-25 17:21:27,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 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-25 17:21:27,620 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 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-25 17:21:27,620 INFO L175 Difference]: Start difference. First operand has 199 places, 277 transitions, 4646 flow. Second operand 6 states and 682 transitions. [2022-11-25 17:21:27,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 429 transitions, 8016 flow [2022-11-25 17:21:27,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 429 transitions, 7690 flow, removed 78 selfloop flow, removed 7 redundant places. [2022-11-25 17:21:27,782 INFO L231 Difference]: Finished difference. Result has 201 places, 277 transitions, 4609 flow [2022-11-25 17:21:27,783 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=4301, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4609, PETRI_PLACES=201, PETRI_TRANSITIONS=277} [2022-11-25 17:21:27,783 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 169 predicate places. [2022-11-25 17:21:27,784 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 277 transitions, 4609 flow [2022-11-25 17:21:27,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.57142857142857) internal successors, (732), 7 states have internal predecessors, (732), 0 states have call successors, (0), 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-25 17:21:27,784 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:21:27,784 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:21:27,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 17:21:27,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-25 17:21:27,987 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:21:27,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:21:27,987 INFO L85 PathProgramCache]: Analyzing trace with hash -131731751, now seen corresponding path program 1 times [2022-11-25 17:21:27,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:21:27,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359353777] [2022-11-25 17:21:27,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:21:27,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:21:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:21:28,566 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:21:28,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:21:28,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359353777] [2022-11-25 17:21:28,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359353777] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:21:28,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411422300] [2022-11-25 17:21:28,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:21:28,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:21:28,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:21:28,568 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:21:28,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 17:21:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:21:28,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 17:21:28,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:21:28,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-25 17:21:28,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:21:28,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:21:29,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-25 17:21:29,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-25 17:21:29,439 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:21:29,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:21:29,984 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1196 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_122| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_63| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_63| v_ArrVal_1192) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1196) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_122|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_122| (+ 28 |c_~#cache~0.offset|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_63|)))) is different from false [2022-11-25 17:21:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:21:30,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411422300] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:21:30,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:21:30,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 28 [2022-11-25 17:21:30,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185640840] [2022-11-25 17:21:30,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:21:30,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-25 17:21:30,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:21:30,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 17:21:30,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=683, Unknown=1, NotChecked=54, Total=870 [2022-11-25 17:21:30,555 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 217 [2022-11-25 17:21:30,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 277 transitions, 4609 flow. Second operand has 30 states, 30 states have (on average 64.5) internal successors, (1935), 30 states have internal predecessors, (1935), 0 states have call successors, (0), 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-25 17:21:30,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:21:30,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 217 [2022-11-25 17:21:30,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:21:46,578 INFO L130 PetriNetUnfolder]: 1980/4125 cut-off events. [2022-11-25 17:21:46,579 INFO L131 PetriNetUnfolder]: For 62044/62044 co-relation queries the response was YES. [2022-11-25 17:21:46,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30419 conditions, 4125 events. 1980/4125 cut-off events. For 62044/62044 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 28226 event pairs, 497 based on Foata normal form. 107/4232 useless extension candidates. Maximal degree in co-relation 30334. Up to 2551 conditions per place. [2022-11-25 17:21:46,690 INFO L137 encePairwiseOnDemand]: 201/217 looper letters, 279 selfloop transitions, 399 changer transitions 0/678 dead transitions. [2022-11-25 17:21:46,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 678 transitions, 11743 flow [2022-11-25 17:21:46,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-25 17:21:46,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2022-11-25 17:21:46,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 5176 transitions. [2022-11-25 17:21:46,700 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3097731761326231 [2022-11-25 17:21:46,701 INFO L72 ComplementDD]: Start complementDD. Operand 77 states and 5176 transitions. [2022-11-25 17:21:46,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 5176 transitions. [2022-11-25 17:21:46,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:21:46,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 77 states and 5176 transitions. [2022-11-25 17:21:46,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 78 states, 77 states have (on average 67.22077922077922) internal successors, (5176), 77 states have internal predecessors, (5176), 0 states have call successors, (0), 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-25 17:21:46,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 78 states, 78 states have (on average 217.0) internal successors, (16926), 78 states have internal predecessors, (16926), 0 states have call successors, (0), 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-25 17:21:46,731 INFO L81 ComplementDD]: Finished complementDD. Result has 78 states, 78 states have (on average 217.0) internal successors, (16926), 78 states have internal predecessors, (16926), 0 states have call successors, (0), 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-25 17:21:46,731 INFO L175 Difference]: Start difference. First operand has 201 places, 277 transitions, 4609 flow. Second operand 77 states and 5176 transitions. [2022-11-25 17:21:46,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 678 transitions, 11743 flow [2022-11-25 17:21:46,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 678 transitions, 11667 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-11-25 17:21:46,992 INFO L231 Difference]: Finished difference. Result has 318 places, 565 transitions, 10900 flow [2022-11-25 17:21:46,993 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=4572, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=77, PETRI_FLOW=10900, PETRI_PLACES=318, PETRI_TRANSITIONS=565} [2022-11-25 17:21:46,993 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 286 predicate places. [2022-11-25 17:21:46,993 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 565 transitions, 10900 flow [2022-11-25 17:21:46,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 64.5) internal successors, (1935), 30 states have internal predecessors, (1935), 0 states have call successors, (0), 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-25 17:21:46,994 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:21:46,994 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:21:46,999 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-25 17:21:47,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:21:47,195 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:21:47,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:21:47,195 INFO L85 PathProgramCache]: Analyzing trace with hash 716083081, now seen corresponding path program 1 times [2022-11-25 17:21:47,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:21:47,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371430354] [2022-11-25 17:21:47,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:21:47,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:21:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:21:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:21:48,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:21:48,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371430354] [2022-11-25 17:21:48,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371430354] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:21:48,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796754280] [2022-11-25 17:21:48,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:21:48,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:21:48,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:21:48,072 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:21:48,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 17:21:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:21:48,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 17:21:48,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:21:48,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-25 17:21:48,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:21:48,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:21:48,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-25 17:21:48,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-25 17:21:48,945 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:21:48,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:21:52,310 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:21:52,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796754280] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:21:52,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:21:52,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2022-11-25 17:21:52,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504085390] [2022-11-25 17:21:52,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:21:52,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-25 17:21:52,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:21:52,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-25 17:21:52,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=822, Unknown=3, NotChecked=0, Total=1056 [2022-11-25 17:21:54,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:21:56,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:22:00,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:22:02,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:22:07,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:22:08,242 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 217 [2022-11-25 17:22:08,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 565 transitions, 10900 flow. Second operand has 33 states, 33 states have (on average 64.36363636363636) internal successors, (2124), 33 states have internal predecessors, (2124), 0 states have call successors, (0), 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-25 17:22:08,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:22:08,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 217 [2022-11-25 17:22:08,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:22:09,804 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse1 (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0)) (.cse4 (select |c_#memory_int| |c_~#cache~0.base|))) (and (= .cse0 (store .cse1 .cse2 0)) (or (= .cse0 .cse1) (and (<= .cse2 |c_~#cache~0.offset|) (= |c_t_funThread1of1ForFork0_~i~0#1| 0))) (<= 1 (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| Int) (v_ArrVal_1275 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_64| Int) (v_ArrVal_1272 (Array Int Int))) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_64| v_ArrVal_1272) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1275) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_64|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| (+ 28 |c_~#cache~0.offset|)))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1275 Int)) (= .cse4 (store .cse0 |c_~#cache~0.offset| v_ArrVal_1275))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| Int) (v_ArrVal_1273 Int) (v_ArrVal_1275 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_int| |c_~#cache~0.base| (store .cse4 |c_~#cache~0.offset| v_ArrVal_1273)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1275))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190|) 2147483650)))))))) is different from false [2022-11-25 17:22:11,711 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse1 (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0)) (.cse5 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse6 (select |c_#memory_int| |c_~#cache~0.base|))) (and (= .cse0 (store .cse1 .cse2 0)) (or (= .cse0 .cse1) (and (<= .cse2 |c_~#cache~0.offset|) (= |c_t_funThread1of1ForFork0_~i~0#1| 0))) (<= 1 (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| Int) (v_ArrVal_1273 Int) (v_ArrVal_1275 Int)) (or (< 0 (+ 2147483650 (select (select (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1273)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1275))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| .cse5))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| Int) (v_ArrVal_1275 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_64| Int) (v_ArrVal_1272 (Array Int Int))) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_64| v_ArrVal_1272) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1275) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_64|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| (+ 28 |c_~#cache~0.offset|)))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1275 Int)) (= .cse6 (store .cse0 |c_~#cache~0.offset| v_ArrVal_1275))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| Int) (v_ArrVal_1273 Int) (v_ArrVal_1275 Int)) (or (< 0 (+ 2147483650 (select (select (let ((.cse7 (store |c_#memory_int| |c_~#cache~0.base| (store .cse6 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1273)))) (store .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1275))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| .cse5))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| Int) (v_ArrVal_1273 Int) (v_ArrVal_1275 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| .cse5) (< 0 (+ (select (select (let ((.cse8 (store |c_#memory_int| |c_~#cache~0.base| (store .cse6 |c_~#cache~0.offset| v_ArrVal_1273)))) (store .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1275))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190|) 2147483650)))))))) is different from false [2022-11-25 17:22:11,809 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((as const (Array Int Int)) 0)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (and (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| Int) (v_ArrVal_1275 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_64| Int) (v_ArrVal_1272 (Array Int Int))) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_64| v_ArrVal_1272) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1275) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_64|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| (+ 28 |c_~#cache~0.offset|)))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1275 Int)) (= .cse0 (store .cse1 |c_~#cache~0.offset| v_ArrVal_1275))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| Int) (v_ArrVal_1273 Int) (v_ArrVal_1275 Int)) (or (< 0 (+ 2147483650 (select (select (let ((.cse2 (store |c_#memory_int| |c_~#cache~0.base| (store .cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1273)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1275))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| .cse3))) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (exists ((v_ArrVal_1275 Int)) (= (store .cse1 0 v_ArrVal_1275) (select |c_#memory_int| 1))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| Int) (v_ArrVal_1273 Int) (v_ArrVal_1275 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| .cse3) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_int| |c_~#cache~0.base| (store .cse0 |c_~#cache~0.offset| v_ArrVal_1273)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1275))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190|) 2147483650)))))) is different from false [2022-11-25 17:22:18,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:22:48,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:22:58,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:23:00,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:23:02,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:23:05,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:23:06,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:23:19,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:23:27,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:23:37,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:23:39,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:23:41,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:23:53,235 WARN L233 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:23:57,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:23:58,857 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#cache~0.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| Int) (v_ArrVal_1273 Int) (v_ArrVal_1275 Int)) (or (< 0 (+ 2147483650 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1273)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1275))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| .cse1))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| Int) (v_ArrVal_1275 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_64| Int) (v_ArrVal_1272 (Array Int Int))) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_64| v_ArrVal_1272) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1275) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_64|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| (+ 28 |c_~#cache~0.offset|)))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1275 Int)) (= .cse2 (store ((as const (Array Int Int)) 0) |c_~#cache~0.offset| v_ArrVal_1275))) (< 0 (+ (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483650)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| Int) (v_ArrVal_1273 Int) (v_ArrVal_1275 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| .cse1) (< 0 (+ (select (select (let ((.cse3 (store |c_#memory_int| |c_~#cache~0.base| (store .cse2 |c_~#cache~0.offset| v_ArrVal_1273)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1275))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190|) 2147483650)))))) is different from false [2022-11-25 17:24:04,889 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 ((as const (Array Int Int)) 0)) (.cse1 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#cache~0.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| Int) (v_ArrVal_1273 Int) (v_ArrVal_1275 Int)) (or (< 0 (+ 2147483650 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1273)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1275))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| .cse1))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| Int) (v_ArrVal_1275 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_64| Int) (v_ArrVal_1272 (Array Int Int))) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_64| v_ArrVal_1272) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1275) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_64|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| (+ 28 |c_~#cache~0.offset|)))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1275 Int)) (= .cse2 (store .cse3 |c_~#cache~0.offset| v_ArrVal_1275))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (exists ((v_ArrVal_1275 Int)) (= (store .cse3 0 v_ArrVal_1275) (select |c_#memory_int| 1))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| Int) (v_ArrVal_1273 Int) (v_ArrVal_1275 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| .cse1) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_int| |c_~#cache~0.base| (store .cse2 |c_~#cache~0.offset| v_ArrVal_1273)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1275))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190|) 2147483650)))))) is different from false [2022-11-25 17:24:11,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:24:13,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:24:20,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:24:23,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:24:34,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:24:36,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:24:38,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:24:38,571 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((as const (Array Int Int)) 0)) (.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (and (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| Int) (v_ArrVal_1275 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_64| Int) (v_ArrVal_1272 (Array Int Int))) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_64| v_ArrVal_1272) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1275) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_64|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| (+ 28 |c_~#cache~0.offset|)))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1275 Int)) (= .cse0 (store .cse1 |c_~#cache~0.offset| v_ArrVal_1275))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (exists ((v_ArrVal_1275 Int)) (= (store .cse1 0 v_ArrVal_1275) (select |c_#memory_int| 1))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| Int) (v_ArrVal_1273 Int) (v_ArrVal_1275 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_int| |c_~#cache~0.base| (store .cse0 |c_~#cache~0.offset| v_ArrVal_1273)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1275))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_190|) 2147483650)))))) is different from false [2022-11-25 17:24:51,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:24:55,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:25:10,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:25:23,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:25:35,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:25:37,974 INFO L130 PetriNetUnfolder]: 3085/6390 cut-off events. [2022-11-25 17:25:37,974 INFO L131 PetriNetUnfolder]: For 237215/237215 co-relation queries the response was YES. [2022-11-25 17:25:38,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60245 conditions, 6390 events. 3085/6390 cut-off events. For 237215/237215 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 49145 event pairs, 505 based on Foata normal form. 139/6529 useless extension candidates. Maximal degree in co-relation 60116. Up to 2672 conditions per place. [2022-11-25 17:25:38,043 INFO L137 encePairwiseOnDemand]: 201/217 looper letters, 656 selfloop transitions, 836 changer transitions 0/1492 dead transitions. [2022-11-25 17:25:38,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 1492 transitions, 31252 flow [2022-11-25 17:25:38,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-11-25 17:25:38,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2022-11-25 17:25:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 6712 transitions. [2022-11-25 17:25:38,055 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.315621179347315 [2022-11-25 17:25:38,055 INFO L72 ComplementDD]: Start complementDD. Operand 98 states and 6712 transitions. [2022-11-25 17:25:38,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 6712 transitions. [2022-11-25 17:25:38,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:25:38,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 98 states and 6712 transitions. [2022-11-25 17:25:38,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 99 states, 98 states have (on average 68.48979591836735) internal successors, (6712), 98 states have internal predecessors, (6712), 0 states have call successors, (0), 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-25 17:25:38,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 99 states, 99 states have (on average 217.0) internal successors, (21483), 99 states have internal predecessors, (21483), 0 states have call successors, (0), 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-25 17:25:38,143 INFO L81 ComplementDD]: Finished complementDD. Result has 99 states, 99 states have (on average 217.0) internal successors, (21483), 99 states have internal predecessors, (21483), 0 states have call successors, (0), 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-25 17:25:38,143 INFO L175 Difference]: Start difference. First operand has 318 places, 565 transitions, 10900 flow. Second operand 98 states and 6712 transitions. [2022-11-25 17:25:38,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 1492 transitions, 31252 flow [2022-11-25 17:25:39,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 1492 transitions, 29823 flow, removed 625 selfloop flow, removed 11 redundant places. [2022-11-25 17:25:40,019 INFO L231 Difference]: Finished difference. Result has 462 places, 1129 transitions, 24093 flow [2022-11-25 17:25:40,020 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=10201, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=341, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=98, PETRI_FLOW=24093, PETRI_PLACES=462, PETRI_TRANSITIONS=1129} [2022-11-25 17:25:40,020 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 430 predicate places. [2022-11-25 17:25:40,020 INFO L495 AbstractCegarLoop]: Abstraction has has 462 places, 1129 transitions, 24093 flow [2022-11-25 17:25:40,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 64.36363636363636) internal successors, (2124), 33 states have internal predecessors, (2124), 0 states have call successors, (0), 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-25 17:25:40,021 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:25:40,021 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:25:40,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 17:25:40,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:25:40,228 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:25:40,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:25:40,229 INFO L85 PathProgramCache]: Analyzing trace with hash 631817849, now seen corresponding path program 1 times [2022-11-25 17:25:40,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:25:40,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540367780] [2022-11-25 17:25:40,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:25:40,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:25:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:25:41,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:25:41,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540367780] [2022-11-25 17:25:41,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540367780] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:25:41,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340586882] [2022-11-25 17:25:41,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:25:41,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:25:41,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:25:41,291 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:25:41,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 17:25:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:41,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-25 17:25:41,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:25:41,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-25 17:25:41,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:25:41,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:25:42,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2022-11-25 17:25:42,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2022-11-25 17:25:42,348 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:25:42,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:25:43,337 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1356 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_65| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125| Int)) (or (< 0 (+ 2147483650 (select (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_65| v_ArrVal_1356) |c_~#cache~0.base|))) (store .cse0 |c_~#cache~0.offset| (+ (select .cse0 |c_~#cache~0.offset|) 1))) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_65|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125| (+ 28 |c_~#cache~0.offset|)))) is different from false [2022-11-25 17:25:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:25:43,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340586882] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:25:43,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:25:43,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-25 17:25:43,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765101782] [2022-11-25 17:25:43,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:25:43,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-25 17:25:43,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:25:43,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-25 17:25:43,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=847, Unknown=1, NotChecked=64, Total=1190 [2022-11-25 17:25:44,676 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 217 [2022-11-25 17:25:44,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 1129 transitions, 24093 flow. Second operand has 35 states, 35 states have (on average 58.285714285714285) internal successors, (2040), 35 states have internal predecessors, (2040), 0 states have call successors, (0), 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-25 17:25:44,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:25:44,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 217 [2022-11-25 17:25:44,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:25:58,523 WARN L233 SmtUtils]: Spent 5.49s on a formula simplification. DAG size of input: 97 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:26:34,516 INFO L130 PetriNetUnfolder]: 3904/7995 cut-off events. [2022-11-25 17:26:34,516 INFO L131 PetriNetUnfolder]: For 502084/502084 co-relation queries the response was YES. [2022-11-25 17:26:34,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97262 conditions, 7995 events. 3904/7995 cut-off events. For 502084/502084 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 64109 event pairs, 139 based on Foata normal form. 245/8240 useless extension candidates. Maximal degree in co-relation 97077. Up to 2036 conditions per place. [2022-11-25 17:26:34,673 INFO L137 encePairwiseOnDemand]: 202/217 looper letters, 482 selfloop transitions, 1698 changer transitions 1/2181 dead transitions. [2022-11-25 17:26:34,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 2181 transitions, 49843 flow [2022-11-25 17:26:34,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-25 17:26:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2022-11-25 17:26:34,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 3422 transitions. [2022-11-25 17:26:34,680 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.2867197318810222 [2022-11-25 17:26:34,680 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 3422 transitions. [2022-11-25 17:26:34,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 3422 transitions. [2022-11-25 17:26:34,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:26:34,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 3422 transitions. [2022-11-25 17:26:34,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 62.21818181818182) internal successors, (3422), 55 states have internal predecessors, (3422), 0 states have call successors, (0), 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-25 17:26:34,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 217.0) internal successors, (12152), 56 states have internal predecessors, (12152), 0 states have call successors, (0), 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-25 17:26:34,703 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 217.0) internal successors, (12152), 56 states have internal predecessors, (12152), 0 states have call successors, (0), 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-25 17:26:34,703 INFO L175 Difference]: Start difference. First operand has 462 places, 1129 transitions, 24093 flow. Second operand 55 states and 3422 transitions. [2022-11-25 17:26:34,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 2181 transitions, 49843 flow [2022-11-25 17:26:38,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 2181 transitions, 47126 flow, removed 1045 selfloop flow, removed 18 redundant places. [2022-11-25 17:26:38,884 INFO L231 Difference]: Finished difference. Result has 512 places, 1972 transitions, 44524 flow [2022-11-25 17:26:38,885 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=20328, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1055, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=843, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=44524, PETRI_PLACES=512, PETRI_TRANSITIONS=1972} [2022-11-25 17:26:38,885 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 480 predicate places. [2022-11-25 17:26:38,885 INFO L495 AbstractCegarLoop]: Abstraction has has 512 places, 1972 transitions, 44524 flow [2022-11-25 17:26:38,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 58.285714285714285) internal successors, (2040), 35 states have internal predecessors, (2040), 0 states have call successors, (0), 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-25 17:26:38,886 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:26:38,886 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:26:38,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-25 17:26:39,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-25 17:26:39,087 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:26:39,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:26:39,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1709665736, now seen corresponding path program 1 times [2022-11-25 17:26:39,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:26:39,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706697238] [2022-11-25 17:26:39,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:26:39,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:26:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:26:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:26:39,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:26:39,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706697238] [2022-11-25 17:26:39,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706697238] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:26:39,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652719587] [2022-11-25 17:26:39,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:26:39,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:26:39,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:26:39,795 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:26:39,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 17:26:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:26:39,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-25 17:26:39,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:26:39,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-25 17:26:40,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:26:40,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:26:40,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2022-11-25 17:26:40,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-25 17:26:40,868 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:26:40,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:26:46,176 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:26:46,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652719587] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:26:46,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:26:46,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2022-11-25 17:26:46,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911286279] [2022-11-25 17:26:46,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:26:46,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-25 17:26:46,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:26:46,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-25 17:26:46,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=958, Unknown=5, NotChecked=0, Total=1122 [2022-11-25 17:26:48,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:26:50,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:26:52,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:26:54,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:26:56,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:26:58,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:27:00,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:27:02,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:27:04,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:27:07,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:27:09,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:27:11,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:27:14,167 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 217 [2022-11-25 17:27:14,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 1972 transitions, 44524 flow. Second operand has 34 states, 34 states have (on average 64.32352941176471) internal successors, (2187), 34 states have internal predecessors, (2187), 0 states have call successors, (0), 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-25 17:27:14,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:27:14,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 217 [2022-11-25 17:27:14,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:27:15,181 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (.cse4 (+ .cse6 28 |c_~#cache~0.offset|)) (.cse0 (+ .cse6 |c_~#cache~0.offset|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse0) (<= .cse1 1) (forall ((v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1440 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_66| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| Int) (v_ArrVal_1438 Int)) (let ((.cse2 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_66| v_ArrVal_1436) |c_~#cache~0.base|))) (or (< (select (store (store .cse2 |c_~#cache~0.offset| v_ArrVal_1438) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| v_ArrVal_1440) |c_~#cache~0.offset|) 2147483647) (< (+ (select .cse2 |c_~#cache~0.offset|) 1) v_ArrVal_1438) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_66|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| (+ 28 |c_~#cache~0.offset|))))) (forall ((v_ArrVal_1440 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| Int) (v_ArrVal_1438 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1438)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| v_ArrVal_1440) |c_~#cache~0.offset|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| .cse4) (not (<= v_ArrVal_1438 (+ |c_ULTIMATE.start_cache_entry_addref_#t~post32#1| 1))))) (= ((as const (Array Int Int)) 0) (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((v_ArrVal_1440 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| Int) (v_ArrVal_1438 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1438)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| v_ArrVal_1440) |c_~#cache~0.offset|) 2147483647) (< (+ .cse1 1) v_ArrVal_1438) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| .cse4))) (forall ((v_ArrVal_1440 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| Int) (v_ArrVal_1438 Int)) (let ((.cse5 (select |c_#memory_int| |c_~#cache~0.base|))) (or (< (+ (select .cse5 .cse0) 1) v_ArrVal_1438) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| .cse4) (< (select (store (store .cse5 .cse0 v_ArrVal_1438) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| v_ArrVal_1440) |c_~#cache~0.offset|) 2147483647)))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)))) is different from false [2022-11-25 17:27:16,056 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse10 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse6 (+ .cse10 28 |c_~#cache~0.offset|)) (.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_#t~post32#1| 1)) (.cse1 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse8 ((as const (Array Int Int)) 0)) (.cse2 (+ .cse10 |c_~#cache~0.offset|)) (.cse3 (<= (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 1)) (.cse0 (not .cse9))) (and (or .cse0 (and (= |c_ULTIMATE.start_cache_entry_addref_#t~post32#1| 0) .cse1)) (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse2) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) .cse3 (forall ((v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1440 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_66| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| Int) (v_ArrVal_1438 Int)) (let ((.cse4 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_66| v_ArrVal_1436) |c_~#cache~0.base|))) (or (< (select (store (store .cse4 |c_~#cache~0.offset| v_ArrVal_1438) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| v_ArrVal_1440) |c_~#cache~0.offset|) 2147483647) (< (+ (select .cse4 |c_~#cache~0.offset|) 1) v_ArrVal_1438) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_66|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| (+ 28 |c_~#cache~0.offset|))))) (forall ((v_ArrVal_1440 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| Int) (v_ArrVal_1438 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1438)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| v_ArrVal_1440) |c_~#cache~0.offset|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| .cse6) (not (<= v_ArrVal_1438 .cse7)))) (forall ((v_ArrVal_1440 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| Int) (v_ArrVal_1438 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| .cse6) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1438)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| v_ArrVal_1440) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 2147483647) (not (<= v_ArrVal_1438 .cse7)))) (= |c_~#cache~0.offset| 0) (= .cse8 (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (or (and .cse1 (<= (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) .cse9) (exists ((v_ArrVal_1438 Int)) (and (<= v_ArrVal_1438 (+ (select .cse8 .cse2) 1)) (= (store .cse8 .cse2 v_ArrVal_1438) (select |c_#memory_int| |c_~#cache~0.base|)))) (or .cse3 .cse0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)))) is different from false [2022-11-25 17:27:16,552 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (.cse2 (+ .cse6 28 |c_~#cache~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse0 (+ .cse6 |c_~#cache~0.offset|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse0) (forall ((v_ArrVal_1440 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| Int)) (or (< (select (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| v_ArrVal_1440) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| .cse2))) (<= .cse3 1) (forall ((v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1440 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_66| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| Int) (v_ArrVal_1438 Int)) (let ((.cse4 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_66| v_ArrVal_1436) |c_~#cache~0.base|))) (or (< (select (store (store .cse4 |c_~#cache~0.offset| v_ArrVal_1438) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| v_ArrVal_1440) |c_~#cache~0.offset|) 2147483647) (< (+ (select .cse4 |c_~#cache~0.offset|) 1) v_ArrVal_1438) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_66|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| (+ 28 |c_~#cache~0.offset|))))) (= ((as const (Array Int Int)) 0) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((v_ArrVal_1440 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| Int) (v_ArrVal_1438 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1438)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| v_ArrVal_1440) |c_~#cache~0.offset|) 2147483647) (< (+ .cse3 1) v_ArrVal_1438) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| .cse2))) (forall ((v_ArrVal_1440 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| Int) (v_ArrVal_1438 Int)) (or (< (+ (select .cse1 .cse0) 1) v_ArrVal_1438) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| .cse2) (< (select (store (store .cse1 .cse0 v_ArrVal_1438) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| v_ArrVal_1440) |c_~#cache~0.offset|) 2147483647))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)))) is different from false [2022-11-25 17:27:18,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:27:19,565 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse1 ((as const (Array Int Int)) 0)) (.cse3 (<= (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 1))) (and (exists ((v_ArrVal_1438 Int)) (and (= .cse0 (store .cse1 |c_~#cache~0.offset| v_ArrVal_1438)) (<= v_ArrVal_1438 (+ (select .cse1 |c_~#cache~0.offset|) 1)))) (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse2 |c_~#cache~0.offset|)) (forall ((v_ArrVal_1440 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| Int)) (or (< (select (store .cse0 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| v_ArrVal_1440) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| (+ .cse2 28 |c_~#cache~0.offset|)))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) .cse3 (forall ((v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1440 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_66| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| Int) (v_ArrVal_1438 Int)) (let ((.cse4 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_66| v_ArrVal_1436) |c_~#cache~0.base|))) (or (< (select (store (store .cse4 |c_~#cache~0.offset| v_ArrVal_1438) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| v_ArrVal_1440) |c_~#cache~0.offset|) 2147483647) (< (+ (select .cse4 |c_~#cache~0.offset|) 1) v_ArrVal_1438) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_66|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| (+ 28 |c_~#cache~0.offset|))))) (= |c_~#cache~0.offset| 0) (= .cse1 (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (or .cse3 (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)))) is different from false [2022-11-25 17:27:21,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:27:36,124 WARN L233 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 69 DAG size of output: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:27:36,196 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 ((as const (Array Int Int)) 0))) (let ((.cse3 (@diff .cse2 .cse1)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse0) (= .cse1 (store .cse2 .cse3 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1440 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_66| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| Int) (v_ArrVal_1438 Int)) (let ((.cse4 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_66| v_ArrVal_1436) |c_~#cache~0.base|))) (or (< (select (store (store .cse4 |c_~#cache~0.offset| v_ArrVal_1438) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| v_ArrVal_1440) |c_~#cache~0.offset|) 2147483647) (< (+ (select .cse4 |c_~#cache~0.offset|) 1) v_ArrVal_1438) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_66|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| (+ 28 |c_~#cache~0.offset|))))) (= .cse1 (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (<= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1) (or (= .cse1 .cse2) (<= (+ 28 .cse3) .cse0)) (or (<= (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 1) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)))) is different from false [2022-11-25 17:27:46,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:27:56,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:28:01,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:28:03,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:28:05,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:28:09,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:28:18,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:28:21,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:28:31,860 WARN L233 SmtUtils]: Spent 6.30s on a formula simplification that was a NOOP. DAG size: 86 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:28:34,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:28:38,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:28:44,002 INFO L130 PetriNetUnfolder]: 4082/8414 cut-off events. [2022-11-25 17:28:44,002 INFO L131 PetriNetUnfolder]: For 534635/534635 co-relation queries the response was YES. [2022-11-25 17:28:44,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107592 conditions, 8414 events. 4082/8414 cut-off events. For 534635/534635 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 68250 event pairs, 787 based on Foata normal form. 26/8440 useless extension candidates. Maximal degree in co-relation 107394. Up to 7494 conditions per place. [2022-11-25 17:28:44,186 INFO L137 encePairwiseOnDemand]: 202/217 looper letters, 1962 selfloop transitions, 399 changer transitions 0/2361 dead transitions. [2022-11-25 17:28:44,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 2361 transitions, 57999 flow [2022-11-25 17:28:44,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-25 17:28:44,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-11-25 17:28:44,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 4021 transitions. [2022-11-25 17:28:44,192 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3088325652841782 [2022-11-25 17:28:44,193 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 4021 transitions. [2022-11-25 17:28:44,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 4021 transitions. [2022-11-25 17:28:44,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:28:44,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 4021 transitions. [2022-11-25 17:28:44,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 67.01666666666667) internal successors, (4021), 60 states have internal predecessors, (4021), 0 states have call successors, (0), 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-25 17:28:44,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 217.0) internal successors, (13237), 61 states have internal predecessors, (13237), 0 states have call successors, (0), 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-25 17:28:44,343 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 217.0) internal successors, (13237), 61 states have internal predecessors, (13237), 0 states have call successors, (0), 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-25 17:28:44,344 INFO L175 Difference]: Start difference. First operand has 512 places, 1972 transitions, 44524 flow. Second operand 60 states and 4021 transitions. [2022-11-25 17:28:44,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 2361 transitions, 57999 flow [2022-11-25 17:28:52,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 2361 transitions, 55196 flow, removed 1339 selfloop flow, removed 16 redundant places. [2022-11-25 17:28:52,498 INFO L231 Difference]: Finished difference. Result has 587 places, 2212 transitions, 49922 flow [2022-11-25 17:28:52,500 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=42687, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1972, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=204, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=49922, PETRI_PLACES=587, PETRI_TRANSITIONS=2212} [2022-11-25 17:28:52,500 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 555 predicate places. [2022-11-25 17:28:52,501 INFO L495 AbstractCegarLoop]: Abstraction has has 587 places, 2212 transitions, 49922 flow [2022-11-25 17:28:52,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 64.32352941176471) internal successors, (2187), 34 states have internal predecessors, (2187), 0 states have call successors, (0), 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-25 17:28:52,501 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:28:52,501 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:28:52,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-25 17:28:52,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-25 17:28:52,708 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:28:52,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:28:52,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2125626912, now seen corresponding path program 1 times [2022-11-25 17:28:52,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:28:52,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468304398] [2022-11-25 17:28:52,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:28:52,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:28:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:28:53,332 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:28:53,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:28:53,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468304398] [2022-11-25 17:28:53,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468304398] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:28:53,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214344334] [2022-11-25 17:28:53,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:28:53,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:28:53,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:28:53,335 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:28:53,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-25 17:28:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:28:53,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 17:28:53,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:28:53,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-25 17:28:53,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:28:53,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:28:54,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-25 17:28:54,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-25 17:28:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:28:54,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:28:55,060 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1516 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_67| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1520 Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_67| v_ArrVal_1516) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1520) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| (+ 28 |c_~#cache~0.offset|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_67|)))) is different from false [2022-11-25 17:28:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:28:55,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214344334] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:28:55,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:28:55,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 28 [2022-11-25 17:28:55,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668701923] [2022-11-25 17:28:55,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:28:55,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-25 17:28:55,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:28:55,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 17:28:55,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=666, Unknown=1, NotChecked=54, Total=870 [2022-11-25 17:28:55,346 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 217 [2022-11-25 17:28:55,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 2212 transitions, 49922 flow. Second operand has 30 states, 30 states have (on average 64.5) internal successors, (1935), 30 states have internal predecessors, (1935), 0 states have call successors, (0), 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-25 17:28:55,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:28:55,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 217 [2022-11-25 17:28:55,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:29:24,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:29:35,596 INFO L130 PetriNetUnfolder]: 4983/10311 cut-off events. [2022-11-25 17:29:35,596 INFO L131 PetriNetUnfolder]: For 633444/633444 co-relation queries the response was YES. [2022-11-25 17:29:35,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129622 conditions, 10311 events. 4983/10311 cut-off events. For 633444/633444 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 87476 event pairs, 830 based on Foata normal form. 141/10452 useless extension candidates. Maximal degree in co-relation 129396. Up to 7925 conditions per place. [2022-11-25 17:29:35,860 INFO L137 encePairwiseOnDemand]: 202/217 looper letters, 2233 selfloop transitions, 828 changer transitions 0/3061 dead transitions. [2022-11-25 17:29:35,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 713 places, 3061 transitions, 76685 flow [2022-11-25 17:29:35,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-11-25 17:29:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2022-11-25 17:29:35,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 8524 transitions. [2022-11-25 17:29:35,881 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.30930004717152293 [2022-11-25 17:29:35,881 INFO L72 ComplementDD]: Start complementDD. Operand 127 states and 8524 transitions. [2022-11-25 17:29:35,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 8524 transitions. [2022-11-25 17:29:35,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:29:35,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 127 states and 8524 transitions. [2022-11-25 17:29:35,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 128 states, 127 states have (on average 67.11811023622047) internal successors, (8524), 127 states have internal predecessors, (8524), 0 states have call successors, (0), 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-25 17:29:35,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 128 states, 128 states have (on average 217.0) internal successors, (27776), 128 states have internal predecessors, (27776), 0 states have call successors, (0), 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-25 17:29:35,929 INFO L81 ComplementDD]: Finished complementDD. Result has 128 states, 128 states have (on average 217.0) internal successors, (27776), 128 states have internal predecessors, (27776), 0 states have call successors, (0), 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-25 17:29:35,930 INFO L175 Difference]: Start difference. First operand has 587 places, 2212 transitions, 49922 flow. Second operand 127 states and 8524 transitions. [2022-11-25 17:29:35,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 713 places, 3061 transitions, 76685 flow [2022-11-25 17:29:45,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 3061 transitions, 74503 flow, removed 707 selfloop flow, removed 13 redundant places. [2022-11-25 17:29:45,154 INFO L231 Difference]: Finished difference. Result has 751 places, 2795 transitions, 66732 flow [2022-11-25 17:29:45,156 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=48801, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=368, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1758, PETRI_DIFFERENCE_SUBTRAHEND_STATES=127, PETRI_FLOW=66732, PETRI_PLACES=751, PETRI_TRANSITIONS=2795} [2022-11-25 17:29:45,157 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 719 predicate places. [2022-11-25 17:29:45,157 INFO L495 AbstractCegarLoop]: Abstraction has has 751 places, 2795 transitions, 66732 flow [2022-11-25 17:29:45,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 64.5) internal successors, (1935), 30 states have internal predecessors, (1935), 0 states have call successors, (0), 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-25 17:29:45,158 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:29:45,158 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:29:45,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-25 17:29:45,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-25 17:29:45,365 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-25 17:29:45,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:29:45,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1829426066, now seen corresponding path program 2 times [2022-11-25 17:29:45,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:29:45,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658204584] [2022-11-25 17:29:45,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:29:45,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:29:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:29:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:29:46,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:29:46,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658204584] [2022-11-25 17:29:46,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658204584] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:29:46,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164031308] [2022-11-25 17:29:46,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:29:46,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:29:46,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:29:46,088 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:29:46,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f067a11-588b-4301-a639-c6b627d30c6c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-25 17:29:46,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:29:46,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:29:46,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 17:29:46,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:29:46,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-25 17:29:46,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:29:46,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-25 17:29:46,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-25 17:29:46,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-25 17:29:47,048 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:29:47,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:29:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 17:29:56,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164031308] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:29:56,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:29:56,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-25 17:29:56,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501158988] [2022-11-25 17:29:56,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:29:56,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-25 17:29:56,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:29:56,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-25 17:29:56,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=755, Unknown=11, NotChecked=0, Total=992 [2022-11-25 17:29:59,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:30:01,534 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 217 [2022-11-25 17:30:01,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 751 places, 2795 transitions, 66732 flow. Second operand has 32 states, 32 states have (on average 70.40625) internal successors, (2253), 32 states have internal predecessors, (2253), 0 states have call successors, (0), 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-25 17:30:01,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:30:01,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 217 [2022-11-25 17:30:01,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:30:02,923 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (exists ((v_ArrVal_1599 Int)) (= (store .cse0 |c_~#cache~0.offset| v_ArrVal_1599) (select |c_#memory_int| |c_~#cache~0.base|))) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_68| Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1599 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_68| v_ArrVal_1596) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1599) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200|) 2147483647) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_68|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| (+ 28 |c_~#cache~0.offset|)))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_ArrVal_1599 Int)) (= (store .cse0 0 v_ArrVal_1599) (select |c_#memory_int| 1))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (forall ((v_ArrVal_1598 Int) (v_ArrVal_1599 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1598)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1599) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200|) 2147483647))))) is different from false [2022-11-25 17:30:05,136 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (exists ((v_ArrVal_1599 Int)) (= (store ((as const (Array Int Int)) 0) |c_~#cache~0.offset| v_ArrVal_1599) (select |c_#memory_int| |c_~#cache~0.base|))) (forall ((v_ArrVal_1598 Int) (v_ArrVal_1599 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| Int)) (or (< (select (select (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1598)))) (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1599))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| .cse2))) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_68| Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1599 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_68| v_ArrVal_1596) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1599) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200|) 2147483647) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_68|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| (+ 28 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_1598 Int) (v_ArrVal_1599 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| .cse2) (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1598)) |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1599) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200|) 2147483647))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1598 Int) (v_ArrVal_1599 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| .cse2) (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1598)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1599) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200|) 2147483647))))) is different from false [2022-11-25 17:30:07,170 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (exists ((v_ArrVal_1599 Int)) (= (store .cse0 |c_~#cache~0.offset| v_ArrVal_1599) (select |c_#memory_int| |c_~#cache~0.base|))) (forall ((v_ArrVal_1598 Int) (v_ArrVal_1599 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| Int)) (or (< (select (select (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1598)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1599))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| .cse3))) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_68| Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1599 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_68| v_ArrVal_1596) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1599) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200|) 2147483647) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_68|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| (+ 28 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_1598 Int) (v_ArrVal_1599 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| .cse3) (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1598)) |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1599) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200|) 2147483647))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_ArrVal_1599 Int)) (= (store .cse0 0 v_ArrVal_1599) (select |c_#memory_int| 1))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (forall ((v_ArrVal_1598 Int) (v_ArrVal_1599 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| .cse3) (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1598)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1599) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200|) 2147483647))))) is different from false [2022-11-25 17:30:20,829 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_68| Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1599 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_68| v_ArrVal_1596) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1599) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200|) 2147483647) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_68|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| (+ 28 |c_~#cache~0.offset|)))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|)) is different from false [2022-11-25 17:30:23,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:30:36,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:30:38,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:30:40,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:30:40,594 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse2 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse0 (+ 28 |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_68| Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1599 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_68| v_ArrVal_1596) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1599) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200|) 2147483647) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_68|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| .cse0))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| (+ .cse1 |c_~#cache~0.offset|)) (< (select .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200|) 2147483647))) (forall ((v_ArrVal_1598 Int) (v_ArrVal_1599 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| (+ .cse1 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1598)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1599) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200|) 2147483647))) (forall ((v_ArrVal_1599 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| Int)) (or (< (select (store .cse2 |c_~#cache~0.offset| v_ArrVal_1599) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| .cse0))))) is different from false [2022-11-25 17:30:40,806 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (exists ((v_ArrVal_1599 Int)) (= (store .cse0 |c_~#cache~0.offset| v_ArrVal_1599) (select |c_#memory_int| |c_~#cache~0.base|))) (forall ((v_ArrVal_1598 Int) (v_ArrVal_1599 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| Int)) (or (< (select (select (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1598)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1599))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| .cse3))) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_68| Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1599 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_68| v_ArrVal_1596) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1599) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200|) 2147483647) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_68|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| (+ 28 |c_~#cache~0.offset|)))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_ArrVal_1599 Int)) (= (store .cse0 0 v_ArrVal_1599) (select |c_#memory_int| 1))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (forall ((v_ArrVal_1598 Int) (v_ArrVal_1599 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| .cse3) (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1598)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1599) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200|) 2147483647))))) is different from false [2022-11-25 17:30:54,350 WARN L233 SmtUtils]: Spent 13.14s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:30:56,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:31:00,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:31:03,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:31:13,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:31:16,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:31:29,556 WARN L233 SmtUtils]: Spent 10.92s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:31:31,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:31:36,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:31:40,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]