./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/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_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8 --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-2329fc7 [2022-12-13 21:48:28,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:48:28,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:48:28,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:48:28,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:48:28,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:48:28,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:48:28,448 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:48:28,449 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:48:28,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:48:28,450 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:48:28,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:48:28,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:48:28,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:48:28,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:48:28,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:48:28,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:48:28,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:48:28,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:48:28,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:48:28,458 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:48:28,459 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:48:28,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:48:28,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:48:28,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:48:28,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:48:28,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:48:28,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:48:28,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:48:28,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:48:28,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:48:28,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:48:28,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:48:28,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:48:28,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:48:28,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:48:28,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:48:28,467 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:48:28,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:48:28,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:48:28,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:48:28,468 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-12-13 21:48:28,488 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:48:28,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:48:28,489 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:48:28,500 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:48:28,500 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:48:28,500 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:48:28,501 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:48:28,501 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:48:28,501 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:48:28,501 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:48:28,502 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:48:28,502 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 21:48:28,502 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:48:28,502 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:48:28,502 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:48:28,502 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 21:48:28,502 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:48:28,503 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 21:48:28,503 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 21:48:28,503 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:48:28,503 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:48:28,503 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:48:28,503 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 21:48:28,504 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:48:28,504 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:48:28,504 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:48:28,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:48:28,504 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:48:28,504 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:48:28,504 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 21:48:28,504 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:48:28,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:48:28,505 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:48:28,505 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 21:48:28,505 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:48:28,505 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:48:28,505 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:48:28,506 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_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/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_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8 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-12-13 21:48:28,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:48:28,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:48:28,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:48:28,688 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:48:28,689 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:48:28,690 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i [2022-12-13 21:48:31,227 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:48:31,420 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:48:31,420 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i [2022-12-13 21:48:31,430 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/data/3a48d1637/f32aefb4b9be461a8721444d586ba32b/FLAG18cb93e71 [2022-12-13 21:48:31,819 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/data/3a48d1637/f32aefb4b9be461a8721444d586ba32b [2022-12-13 21:48:31,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:48:31,826 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:48:31,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:48:31,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:48:31,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:48:31,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:48:31" (1/1) ... [2022-12-13 21:48:31,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22a3407d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:48:31, skipping insertion in model container [2022-12-13 21:48:31,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:48:31" (1/1) ... [2022-12-13 21:48:31,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:48:31,877 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:48:32,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:48:32,184 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:48:32,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:48:32,244 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:48:32,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:48:32 WrapperNode [2022-12-13 21:48:32,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:48:32,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:48:32,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:48:32,245 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:48:32,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:48:32" (1/1) ... [2022-12-13 21:48:32,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:48:32" (1/1) ... [2022-12-13 21:48:32,276 INFO L138 Inliner]: procedures = 262, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-12-13 21:48:32,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:48:32,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:48:32,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:48:32,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:48:32,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:48:32" (1/1) ... [2022-12-13 21:48:32,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:48:32" (1/1) ... [2022-12-13 21:48:32,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:48:32" (1/1) ... [2022-12-13 21:48:32,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:48:32" (1/1) ... [2022-12-13 21:48:32,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:48:32" (1/1) ... [2022-12-13 21:48:32,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:48:32" (1/1) ... [2022-12-13 21:48:32,295 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:48:32" (1/1) ... [2022-12-13 21:48:32,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:48:32" (1/1) ... [2022-12-13 21:48:32,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:48:32,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:48:32,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:48:32,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:48:32,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:48:32" (1/1) ... [2022-12-13 21:48:32,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:48:32,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:48:32,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:48:32,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:48:32,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 21:48:32,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 21:48:32,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 21:48:32,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 21:48:32,359 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 21:48:32,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:48:32,360 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-13 21:48:32,360 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-13 21:48:32,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:48:32,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:48:32,362 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 21:48:32,461 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:48:32,463 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:48:32,617 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:48:32,624 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:48:32,624 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 21:48:32,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:48:32 BoogieIcfgContainer [2022-12-13 21:48:32,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:48:32,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:48:32,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:48:32,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:48:32,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:48:31" (1/3) ... [2022-12-13 21:48:32,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b836624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:48:32, skipping insertion in model container [2022-12-13 21:48:32,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:48:32" (2/3) ... [2022-12-13 21:48:32,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b836624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:48:32, skipping insertion in model container [2022-12-13 21:48:32,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:48:32" (3/3) ... [2022-12-13 21:48:32,636 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_05-funloop_hard2.i [2022-12-13 21:48:32,644 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 21:48:32,653 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:48:32,653 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-12-13 21:48:32,653 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 21:48:32,698 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 21:48:32,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 110 transitions, 225 flow [2022-12-13 21:48:32,761 INFO L130 PetriNetUnfolder]: 6/109 cut-off events. [2022-12-13 21:48:32,761 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:48:32,765 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 200 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-12-13 21:48:32,765 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 110 transitions, 225 flow [2022-12-13 21:48:32,769 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 109 transitions, 221 flow [2022-12-13 21:48:32,771 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 21:48:32,779 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 109 transitions, 221 flow [2022-12-13 21:48:32,781 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 109 transitions, 221 flow [2022-12-13 21:48:32,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 109 transitions, 221 flow [2022-12-13 21:48:32,806 INFO L130 PetriNetUnfolder]: 6/109 cut-off events. [2022-12-13 21:48:32,806 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:48:32,807 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 200 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-12-13 21:48:32,810 INFO L119 LiptonReduction]: Number of co-enabled transitions 3072 [2022-12-13 21:48:34,432 INFO L134 LiptonReduction]: Checked pairs total: 4072 [2022-12-13 21:48:34,432 INFO L136 LiptonReduction]: Total number of compositions: 104 [2022-12-13 21:48:34,446 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:48:34,451 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;@56c0317f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:48:34,451 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-12-13 21:48:34,452 INFO L130 PetriNetUnfolder]: 1/2 cut-off events. [2022-12-13 21:48:34,452 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:48:34,452 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:48:34,453 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 21:48:34,453 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-12-13 21:48:34,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:48:34,456 INFO L85 PathProgramCache]: Analyzing trace with hash 13245, now seen corresponding path program 1 times [2022-12-13 21:48:34,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:48:34,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413815070] [2022-12-13 21:48:34,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:48:34,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:48:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:48:34,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:48:34,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:48:34,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413815070] [2022-12-13 21:48:34,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413815070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:48:34,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:48:34,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:48:34,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598428225] [2022-12-13 21:48:34,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:48:34,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:48:34,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:48:34,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:48:34,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:48:34,650 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 214 [2022-12-13 21:48:34,653 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-12-13 21:48:34,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:48:34,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 214 [2022-12-13 21:48:34,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:48:34,741 INFO L130 PetriNetUnfolder]: 152/304 cut-off events. [2022-12-13 21:48:34,741 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:48:34,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 304 events. 152/304 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1288 event pairs, 126 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 600. Up to 304 conditions per place. [2022-12-13 21:48:34,744 INFO L137 encePairwiseOnDemand]: 211/214 looper letters, 28 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2022-12-13 21:48:34,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 119 flow [2022-12-13 21:48:34,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:48:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:48:34,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2022-12-13 21:48:34,758 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5249221183800623 [2022-12-13 21:48:34,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2022-12-13 21:48:34,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2022-12-13 21:48:34,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:48:34,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2022-12-13 21:48:34,766 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-12-13 21:48:34,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:34,772 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:34,773 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 65 flow. Second operand 3 states and 337 transitions. [2022-12-13 21:48:34,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 119 flow [2022-12-13 21:48:34,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:48:34,778 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 62 flow [2022-12-13 21:48:34,780 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2022-12-13 21:48:34,783 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2022-12-13 21:48:34,784 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 62 flow [2022-12-13 21:48:34,784 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-12-13 21:48:34,784 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:48:34,784 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 21:48:34,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:48:34,785 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:48:34,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:48:34,785 INFO L85 PathProgramCache]: Analyzing trace with hash -622864177, now seen corresponding path program 1 times [2022-12-13 21:48:34,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:48:34,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236850409] [2022-12-13 21:48:34,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:48:34,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:48:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:48:34,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:48:34,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:48:34,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236850409] [2022-12-13 21:48:34,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236850409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:48:34,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:48:34,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:48:34,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009644593] [2022-12-13 21:48:34,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:48:34,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:48:34,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:48:34,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:48:34,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:48:34,860 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 214 [2022-12-13 21:48:34,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 62 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-12-13 21:48:34,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:48:34,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 214 [2022-12-13 21:48:34,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:48:34,933 INFO L130 PetriNetUnfolder]: 152/305 cut-off events. [2022-12-13 21:48:34,934 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:48:34,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 305 events. 152/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1287 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-12-13 21:48:34,936 INFO L137 encePairwiseOnDemand]: 211/214 looper letters, 28 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-13 21:48:34,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 124 flow [2022-12-13 21:48:34,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:48:34,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:48:34,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2022-12-13 21:48:34,938 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5249221183800623 [2022-12-13 21:48:34,939 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2022-12-13 21:48:34,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2022-12-13 21:48:34,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:48:34,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2022-12-13 21:48:34,940 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-12-13 21:48:34,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:34,943 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:34,943 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 62 flow. Second operand 3 states and 337 transitions. [2022-12-13 21:48:34,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 124 flow [2022-12-13 21:48:34,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 30 transitions, 123 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:48:34,944 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 73 flow [2022-12-13 21:48:34,945 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2022-12-13 21:48:34,945 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2022-12-13 21:48:34,945 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 73 flow [2022-12-13 21:48:34,946 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-12-13 21:48:34,946 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:48:34,946 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:48:34,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 21:48:34,946 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:48:34,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:48:34,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1933686377, now seen corresponding path program 1 times [2022-12-13 21:48:34,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:48:34,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331498329] [2022-12-13 21:48:34,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:48:34,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:48:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:48:35,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:48:35,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:48:35,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331498329] [2022-12-13 21:48:35,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331498329] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:48:35,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006026983] [2022-12-13 21:48:35,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:48:35,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:48:35,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:48:35,012 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:48:35,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 21:48:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:48:35,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:48:35,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:48:35,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:48:35,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:48:35,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:48:35,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006026983] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:48:35,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:48:35,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 21:48:35,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588935434] [2022-12-13 21:48:35,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:48:35,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:48:35,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:48:35,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:48:35,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:48:35,132 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 214 [2022-12-13 21:48:35,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 73 flow. Second operand has 7 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:35,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:48:35,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 214 [2022-12-13 21:48:35,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:48:35,224 INFO L130 PetriNetUnfolder]: 152/308 cut-off events. [2022-12-13 21:48:35,224 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:48:35,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 308 events. 152/308 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1289 event pairs, 126 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 623. Up to 305 conditions per place. [2022-12-13 21:48:35,226 INFO L137 encePairwiseOnDemand]: 211/214 looper letters, 28 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2022-12-13 21:48:35,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 151 flow [2022-12-13 21:48:35,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:48:35,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:48:35,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions. [2022-12-13 21:48:35,229 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 21:48:35,229 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 642 transitions. [2022-12-13 21:48:35,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 642 transitions. [2022-12-13 21:48:35,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:48:35,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 642 transitions. [2022-12-13 21:48:35,232 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-12-13 21:48:35,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:35,236 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:35,236 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 73 flow. Second operand 6 states and 642 transitions. [2022-12-13 21:48:35,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 151 flow [2022-12-13 21:48:35,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 147 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 21:48:35,237 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 105 flow [2022-12-13 21:48:35,238 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=105, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2022-12-13 21:48:35,238 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2022-12-13 21:48:35,238 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 105 flow [2022-12-13 21:48:35,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:35,239 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:48:35,239 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-12-13 21:48:35,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 21:48:35,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-13 21:48:35,440 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:48:35,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:48:35,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1755723057, now seen corresponding path program 2 times [2022-12-13 21:48:35,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:48:35,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215896682] [2022-12-13 21:48:35,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:48:35,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:48:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:48:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:48:35,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:48:35,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215896682] [2022-12-13 21:48:35,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215896682] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:48:35,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240330265] [2022-12-13 21:48:35,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 21:48:35,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:48:35,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:48:35,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:48:35,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 21:48:35,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 21:48:35,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:48:35,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 21:48:35,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:48:35,630 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-12-13 21:48:35,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:48:35,678 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-12-13 21:48:35,707 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 21:48:35,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:48:35,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240330265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:48:35,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:48:35,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2022-12-13 21:48:35,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003426294] [2022-12-13 21:48:35,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:48:35,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:48:35,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:48:35,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:48:35,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:48:35,764 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 214 [2022-12-13 21:48:35,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 105 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-12-13 21:48:35,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:48:35,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 214 [2022-12-13 21:48:35,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:48:35,900 INFO L130 PetriNetUnfolder]: 196/391 cut-off events. [2022-12-13 21:48:35,900 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 21:48:35,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 391 events. 196/391 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1730 event pairs, 48 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 798. Up to 317 conditions per place. [2022-12-13 21:48:35,902 INFO L137 encePairwiseOnDemand]: 205/214 looper letters, 49 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2022-12-13 21:48:35,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 263 flow [2022-12-13 21:48:35,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:48:35,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:48:35,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 450 transitions. [2022-12-13 21:48:35,904 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5257009345794392 [2022-12-13 21:48:35,904 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 450 transitions. [2022-12-13 21:48:35,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 450 transitions. [2022-12-13 21:48:35,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:48:35,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 450 transitions. [2022-12-13 21:48:35,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:35,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:35,908 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:35,908 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 105 flow. Second operand 4 states and 450 transitions. [2022-12-13 21:48:35,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 263 flow [2022-12-13 21:48:35,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 56 transitions, 249 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-13 21:48:35,910 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 145 flow [2022-12-13 21:48:35,910 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2022-12-13 21:48:35,911 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2022-12-13 21:48:35,911 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 145 flow [2022-12-13 21:48:35,911 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-12-13 21:48:35,912 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:48:35,912 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-12-13 21:48:35,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 21:48:36,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:48:36,113 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-12-13 21:48:36,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:48:36,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1755723896, now seen corresponding path program 1 times [2022-12-13 21:48:36,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:48:36,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292993551] [2022-12-13 21:48:36,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:48:36,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:48:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:48:36,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:48:36,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:48:36,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292993551] [2022-12-13 21:48:36,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292993551] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:48:36,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662607666] [2022-12-13 21:48:36,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:48:36,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:48:36,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:48:36,194 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:48:36,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 21:48:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:48:36,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 21:48:36,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:48:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:48:36,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:48:36,299 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:48:36,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662607666] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:48:36,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:48:36,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-13 21:48:36,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79335840] [2022-12-13 21:48:36,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:48:36,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 21:48:36,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:48:36,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 21:48:36,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-12-13 21:48:36,325 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 214 [2022-12-13 21:48:36,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 145 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-12-13 21:48:36,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:48:36,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 214 [2022-12-13 21:48:36,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:48:36,436 INFO L130 PetriNetUnfolder]: 196/397 cut-off events. [2022-12-13 21:48:36,436 INFO L131 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2022-12-13 21:48:36,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 397 events. 196/397 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1747 event pairs, 129 based on Foata normal form. 6/283 useless extension candidates. Maximal degree in co-relation 988. Up to 388 conditions per place. [2022-12-13 21:48:36,438 INFO L137 encePairwiseOnDemand]: 211/214 looper letters, 34 selfloop transitions, 11 changer transitions 0/45 dead transitions. [2022-12-13 21:48:36,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 271 flow [2022-12-13 21:48:36,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 21:48:36,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 21:48:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1257 transitions. [2022-12-13 21:48:36,444 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4894859813084112 [2022-12-13 21:48:36,444 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1257 transitions. [2022-12-13 21:48:36,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1257 transitions. [2022-12-13 21:48:36,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:48:36,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1257 transitions. [2022-12-13 21:48:36,446 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-12-13 21:48:36,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 214.0) internal successors, (2782), 13 states have internal predecessors, (2782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:36,449 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 214.0) internal successors, (2782), 13 states have internal predecessors, (2782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:36,449 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 145 flow. Second operand 12 states and 1257 transitions. [2022-12-13 21:48:36,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 271 flow [2022-12-13 21:48:36,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 271 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 21:48:36,450 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 229 flow [2022-12-13 21:48:36,451 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=229, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2022-12-13 21:48:36,451 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 29 predicate places. [2022-12-13 21:48:36,451 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 229 flow [2022-12-13 21:48:36,451 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-12-13 21:48:36,451 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:48:36,452 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-12-13 21:48:36,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 21:48:36,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:48:36,653 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:48:36,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:48:36,655 INFO L85 PathProgramCache]: Analyzing trace with hash -30420344, now seen corresponding path program 2 times [2022-12-13 21:48:36,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:48:36,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668220546] [2022-12-13 21:48:36,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:48:36,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:48:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:48:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:48:36,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:48:36,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668220546] [2022-12-13 21:48:36,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668220546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:48:36,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:48:36,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:48:36,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357890220] [2022-12-13 21:48:36,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:48:36,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:48:36,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:48:36,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:48:36,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:48:36,950 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 214 [2022-12-13 21:48:36,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 229 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-12-13 21:48:36,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:48:36,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 214 [2022-12-13 21:48:36,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:48:37,058 INFO L130 PetriNetUnfolder]: 186/377 cut-off events. [2022-12-13 21:48:37,058 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-12-13 21:48:37,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 986 conditions, 377 events. 186/377 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1603 event pairs, 56 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 963. Up to 315 conditions per place. [2022-12-13 21:48:37,060 INFO L137 encePairwiseOnDemand]: 207/214 looper letters, 50 selfloop transitions, 8 changer transitions 0/58 dead transitions. [2022-12-13 21:48:37,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 378 flow [2022-12-13 21:48:37,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:48:37,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:48:37,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 440 transitions. [2022-12-13 21:48:37,061 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.514018691588785 [2022-12-13 21:48:37,061 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 440 transitions. [2022-12-13 21:48:37,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 440 transitions. [2022-12-13 21:48:37,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:48:37,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 440 transitions. [2022-12-13 21:48:37,063 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-12-13 21:48:37,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:37,066 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:37,066 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 229 flow. Second operand 4 states and 440 transitions. [2022-12-13 21:48:37,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 378 flow [2022-12-13 21:48:37,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 330 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-12-13 21:48:37,072 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 219 flow [2022-12-13 21:48:37,072 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2022-12-13 21:48:37,073 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 29 predicate places. [2022-12-13 21:48:37,073 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 219 flow [2022-12-13 21:48:37,073 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-12-13 21:48:37,073 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:48:37,073 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:48:37,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 21:48:37,074 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:48:37,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:48:37,074 INFO L85 PathProgramCache]: Analyzing trace with hash 831565983, now seen corresponding path program 1 times [2022-12-13 21:48:37,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:48:37,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006855755] [2022-12-13 21:48:37,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:48:37,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:48:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:48:37,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-12-13 21:48:37,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:48:37,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006855755] [2022-12-13 21:48:37,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006855755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:48:37,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:48:37,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:48:37,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295739676] [2022-12-13 21:48:37,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:48:37,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:48:37,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:48:37,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:48:37,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:48:37,131 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 214 [2022-12-13 21:48:37,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 219 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-12-13 21:48:37,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:48:37,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 214 [2022-12-13 21:48:37,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:48:37,245 INFO L130 PetriNetUnfolder]: 264/534 cut-off events. [2022-12-13 21:48:37,245 INFO L131 PetriNetUnfolder]: For 184/184 co-relation queries the response was YES. [2022-12-13 21:48:37,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1451 conditions, 534 events. 264/534 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2518 event pairs, 98 based on Foata normal form. 20/431 useless extension candidates. Maximal degree in co-relation 1426. Up to 321 conditions per place. [2022-12-13 21:48:37,247 INFO L137 encePairwiseOnDemand]: 209/214 looper letters, 69 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2022-12-13 21:48:37,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 71 transitions, 451 flow [2022-12-13 21:48:37,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:48:37,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:48:37,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2022-12-13 21:48:37,248 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.559190031152648 [2022-12-13 21:48:37,248 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2022-12-13 21:48:37,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2022-12-13 21:48:37,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:48:37,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2022-12-13 21:48:37,249 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-12-13 21:48:37,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:37,250 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:37,250 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 219 flow. Second operand 3 states and 359 transitions. [2022-12-13 21:48:37,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 71 transitions, 451 flow [2022-12-13 21:48:37,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 71 transitions, 442 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:48:37,252 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 228 flow [2022-12-13 21:48:37,253 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2022-12-13 21:48:37,253 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 31 predicate places. [2022-12-13 21:48:37,253 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 228 flow [2022-12-13 21:48:37,254 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-12-13 21:48:37,254 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:48:37,254 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:48:37,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 21:48:37,254 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:48:37,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:48:37,255 INFO L85 PathProgramCache]: Analyzing trace with hash 830838404, now seen corresponding path program 1 times [2022-12-13 21:48:37,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:48:37,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667797624] [2022-12-13 21:48:37,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:48:37,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:48:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:48:37,289 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:48:37,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:48:37,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667797624] [2022-12-13 21:48:37,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667797624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:48:37,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:48:37,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:48:37,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478334653] [2022-12-13 21:48:37,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:48:37,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:48:37,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:48:37,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:48:37,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:48:37,298 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 214 [2022-12-13 21:48:37,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 228 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-12-13 21:48:37,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:48:37,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 214 [2022-12-13 21:48:37,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:48:37,397 INFO L130 PetriNetUnfolder]: 318/646 cut-off events. [2022-12-13 21:48:37,397 INFO L131 PetriNetUnfolder]: For 311/311 co-relation queries the response was YES. [2022-12-13 21:48:37,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1853 conditions, 646 events. 318/646 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2997 event pairs, 173 based on Foata normal form. 14/508 useless extension candidates. Maximal degree in co-relation 1827. Up to 493 conditions per place. [2022-12-13 21:48:37,400 INFO L137 encePairwiseOnDemand]: 209/214 looper letters, 63 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2022-12-13 21:48:37,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 421 flow [2022-12-13 21:48:37,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:48:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:48:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2022-12-13 21:48:37,401 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5467289719626168 [2022-12-13 21:48:37,401 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2022-12-13 21:48:37,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2022-12-13 21:48:37,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:48:37,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2022-12-13 21:48:37,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:37,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:37,403 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:37,403 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 228 flow. Second operand 3 states and 351 transitions. [2022-12-13 21:48:37,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 421 flow [2022-12-13 21:48:37,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 65 transitions, 415 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 21:48:37,405 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 226 flow [2022-12-13 21:48:37,405 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=210, 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=226, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2022-12-13 21:48:37,406 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 33 predicate places. [2022-12-13 21:48:37,406 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 226 flow [2022-12-13 21:48:37,406 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-12-13 21:48:37,406 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:48:37,406 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:48:37,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 21:48:37,406 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:48:37,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:48:37,407 INFO L85 PathProgramCache]: Analyzing trace with hash 343053798, now seen corresponding path program 1 times [2022-12-13 21:48:37,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:48:37,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848129577] [2022-12-13 21:48:37,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:48:37,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:48:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:48:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:48:37,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:48:37,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848129577] [2022-12-13 21:48:37,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848129577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:48:37,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:48:37,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:48:37,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570059140] [2022-12-13 21:48:37,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:48:37,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:48:37,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:48:37,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:48:37,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:48:37,799 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 214 [2022-12-13 21:48:37,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 226 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-12-13 21:48:37,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:48:37,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 214 [2022-12-13 21:48:37,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:48:38,059 INFO L130 PetriNetUnfolder]: 354/736 cut-off events. [2022-12-13 21:48:38,059 INFO L131 PetriNetUnfolder]: For 349/349 co-relation queries the response was YES. [2022-12-13 21:48:38,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2189 conditions, 736 events. 354/736 cut-off events. For 349/349 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3702 event pairs, 159 based on Foata normal form. 0/572 useless extension candidates. Maximal degree in co-relation 2162. Up to 587 conditions per place. [2022-12-13 21:48:38,064 INFO L137 encePairwiseOnDemand]: 204/214 looper letters, 66 selfloop transitions, 17 changer transitions 0/83 dead transitions. [2022-12-13 21:48:38,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 83 transitions, 532 flow [2022-12-13 21:48:38,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 21:48:38,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 21:48:38,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 807 transitions. [2022-12-13 21:48:38,067 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4713785046728972 [2022-12-13 21:48:38,067 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 807 transitions. [2022-12-13 21:48:38,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 807 transitions. [2022-12-13 21:48:38,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:48:38,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 807 transitions. [2022-12-13 21:48:38,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.875) internal successors, (807), 8 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:38,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 214.0) internal successors, (1926), 9 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:38,072 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 214.0) internal successors, (1926), 9 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:38,072 INFO L175 Difference]: Start difference. First operand has 65 places, 47 transitions, 226 flow. Second operand 8 states and 807 transitions. [2022-12-13 21:48:38,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 83 transitions, 532 flow [2022-12-13 21:48:38,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 525 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:48:38,076 INFO L231 Difference]: Finished difference. Result has 76 places, 58 transitions, 355 flow [2022-12-13 21:48:38,076 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=355, PETRI_PLACES=76, PETRI_TRANSITIONS=58} [2022-12-13 21:48:38,077 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2022-12-13 21:48:38,077 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 355 flow [2022-12-13 21:48:38,077 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-12-13 21:48:38,077 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:48:38,077 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:48:38,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 21:48:38,078 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:48:38,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:48:38,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1039056401, now seen corresponding path program 1 times [2022-12-13 21:48:38,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:48:38,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361259046] [2022-12-13 21:48:38,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:48:38,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:48:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:48:38,292 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:48:38,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:48:38,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361259046] [2022-12-13 21:48:38,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361259046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:48:38,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:48:38,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:48:38,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568448022] [2022-12-13 21:48:38,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:48:38,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:48:38,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:48:38,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:48:38,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:48:38,425 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 214 [2022-12-13 21:48:38,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 58 transitions, 355 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-12-13 21:48:38,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:48:38,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 214 [2022-12-13 21:48:38,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:48:38,765 INFO L130 PetriNetUnfolder]: 475/1004 cut-off events. [2022-12-13 21:48:38,765 INFO L131 PetriNetUnfolder]: For 1143/1143 co-relation queries the response was YES. [2022-12-13 21:48:38,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3385 conditions, 1004 events. 475/1004 cut-off events. For 1143/1143 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5684 event pairs, 103 based on Foata normal form. 23/833 useless extension candidates. Maximal degree in co-relation 3352. Up to 521 conditions per place. [2022-12-13 21:48:38,770 INFO L137 encePairwiseOnDemand]: 205/214 looper letters, 78 selfloop transitions, 26 changer transitions 0/104 dead transitions. [2022-12-13 21:48:38,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 104 transitions, 788 flow [2022-12-13 21:48:38,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 21:48:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 21:48:38,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1082 transitions. [2022-12-13 21:48:38,772 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45964316057774 [2022-12-13 21:48:38,772 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1082 transitions. [2022-12-13 21:48:38,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1082 transitions. [2022-12-13 21:48:38,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:48:38,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1082 transitions. [2022-12-13 21:48:38,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.36363636363636) internal successors, (1082), 11 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:38,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 214.0) internal successors, (2568), 12 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:38,776 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 214.0) internal successors, (2568), 12 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:38,776 INFO L175 Difference]: Start difference. First operand has 76 places, 58 transitions, 355 flow. Second operand 11 states and 1082 transitions. [2022-12-13 21:48:38,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 104 transitions, 788 flow [2022-12-13 21:48:38,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 104 transitions, 748 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 21:48:38,780 INFO L231 Difference]: Finished difference. Result has 88 places, 71 transitions, 519 flow [2022-12-13 21:48:38,780 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=519, PETRI_PLACES=88, PETRI_TRANSITIONS=71} [2022-12-13 21:48:38,781 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 56 predicate places. [2022-12-13 21:48:38,781 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 71 transitions, 519 flow [2022-12-13 21:48:38,781 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-12-13 21:48:38,781 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:48:38,781 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:48:38,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 21:48:38,781 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:48:38,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:48:38,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1038652782, now seen corresponding path program 2 times [2022-12-13 21:48:38,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:48:38,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954434094] [2022-12-13 21:48:38,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:48:38,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:48:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:48:39,016 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:48:39,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:48:39,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954434094] [2022-12-13 21:48:39,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954434094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:48:39,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:48:39,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:48:39,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416731644] [2022-12-13 21:48:39,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:48:39,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:48:39,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:48:39,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:48:39,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:48:39,143 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 214 [2022-12-13 21:48:39,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 71 transitions, 519 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-12-13 21:48:39,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:48:39,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 214 [2022-12-13 21:48:39,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:48:39,431 INFO L130 PetriNetUnfolder]: 494/1041 cut-off events. [2022-12-13 21:48:39,431 INFO L131 PetriNetUnfolder]: For 2358/2358 co-relation queries the response was YES. [2022-12-13 21:48:39,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3997 conditions, 1041 events. 494/1041 cut-off events. For 2358/2358 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5837 event pairs, 235 based on Foata normal form. 10/853 useless extension candidates. Maximal degree in co-relation 3959. Up to 902 conditions per place. [2022-12-13 21:48:39,437 INFO L137 encePairwiseOnDemand]: 204/214 looper letters, 76 selfloop transitions, 25 changer transitions 0/101 dead transitions. [2022-12-13 21:48:39,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 101 transitions, 856 flow [2022-12-13 21:48:39,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 21:48:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 21:48:39,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 994 transitions. [2022-12-13 21:48:39,439 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46448598130841123 [2022-12-13 21:48:39,439 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 994 transitions. [2022-12-13 21:48:39,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 994 transitions. [2022-12-13 21:48:39,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:48:39,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 994 transitions. [2022-12-13 21:48:39,441 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-12-13 21:48:39,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 214.0) internal successors, (2354), 11 states have internal predecessors, (2354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:39,443 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 214.0) internal successors, (2354), 11 states have internal predecessors, (2354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:39,443 INFO L175 Difference]: Start difference. First operand has 88 places, 71 transitions, 519 flow. Second operand 10 states and 994 transitions. [2022-12-13 21:48:39,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 101 transitions, 856 flow [2022-12-13 21:48:39,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 101 transitions, 816 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-13 21:48:39,448 INFO L231 Difference]: Finished difference. Result has 95 places, 77 transitions, 596 flow [2022-12-13 21:48:39,448 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=596, PETRI_PLACES=95, PETRI_TRANSITIONS=77} [2022-12-13 21:48:39,448 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 63 predicate places. [2022-12-13 21:48:39,448 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 77 transitions, 596 flow [2022-12-13 21:48:39,449 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-12-13 21:48:39,449 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:48:39,449 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:48:39,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 21:48:39,449 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:48:39,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:48:39,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1039142891, now seen corresponding path program 2 times [2022-12-13 21:48:39,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:48:39,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492415486] [2022-12-13 21:48:39,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:48:39,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:48:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:48:39,651 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:48:39,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:48:39,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492415486] [2022-12-13 21:48:39,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492415486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:48:39,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:48:39,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:48:39,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592842242] [2022-12-13 21:48:39,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:48:39,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:48:39,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:48:39,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:48:39,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:48:39,759 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 214 [2022-12-13 21:48:39,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 77 transitions, 596 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-12-13 21:48:39,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:48:39,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 214 [2022-12-13 21:48:39,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:48:40,144 INFO L130 PetriNetUnfolder]: 565/1179 cut-off events. [2022-12-13 21:48:40,144 INFO L131 PetriNetUnfolder]: For 3517/3517 co-relation queries the response was YES. [2022-12-13 21:48:40,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4719 conditions, 1179 events. 565/1179 cut-off events. For 3517/3517 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6664 event pairs, 55 based on Foata normal form. 17/994 useless extension candidates. Maximal degree in co-relation 4680. Up to 524 conditions per place. [2022-12-13 21:48:40,151 INFO L137 encePairwiseOnDemand]: 204/214 looper letters, 100 selfloop transitions, 40 changer transitions 0/140 dead transitions. [2022-12-13 21:48:40,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 140 transitions, 1218 flow [2022-12-13 21:48:40,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 21:48:40,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 21:48:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1106 transitions. [2022-12-13 21:48:40,153 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46983857264231094 [2022-12-13 21:48:40,153 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1106 transitions. [2022-12-13 21:48:40,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1106 transitions. [2022-12-13 21:48:40,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:48:40,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1106 transitions. [2022-12-13 21:48:40,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 100.54545454545455) internal successors, (1106), 11 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:40,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 214.0) internal successors, (2568), 12 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:40,157 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 214.0) internal successors, (2568), 12 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:40,157 INFO L175 Difference]: Start difference. First operand has 95 places, 77 transitions, 596 flow. Second operand 11 states and 1106 transitions. [2022-12-13 21:48:40,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 140 transitions, 1218 flow [2022-12-13 21:48:40,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 140 transitions, 1165 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-12-13 21:48:40,164 INFO L231 Difference]: Finished difference. Result has 102 places, 88 transitions, 800 flow [2022-12-13 21:48:40,164 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=800, PETRI_PLACES=102, PETRI_TRANSITIONS=88} [2022-12-13 21:48:40,164 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 70 predicate places. [2022-12-13 21:48:40,164 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 88 transitions, 800 flow [2022-12-13 21:48:40,165 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-12-13 21:48:40,165 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:48:40,165 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:48:40,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 21:48:40,165 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:48:40,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:48:40,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1039142892, now seen corresponding path program 3 times [2022-12-13 21:48:40,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:48:40,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937991275] [2022-12-13 21:48:40,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:48:40,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:48:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:48:40,365 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:48:40,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:48:40,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937991275] [2022-12-13 21:48:40,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937991275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:48:40,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:48:40,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:48:40,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882665486] [2022-12-13 21:48:40,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:48:40,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:48:40,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:48:40,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:48:40,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:48:40,474 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 214 [2022-12-13 21:48:40,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 88 transitions, 800 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-12-13 21:48:40,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:48:40,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 214 [2022-12-13 21:48:40,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:48:40,826 INFO L130 PetriNetUnfolder]: 536/1130 cut-off events. [2022-12-13 21:48:40,826 INFO L131 PetriNetUnfolder]: For 5216/5216 co-relation queries the response was YES. [2022-12-13 21:48:40,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5005 conditions, 1130 events. 536/1130 cut-off events. For 5216/5216 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6410 event pairs, 183 based on Foata normal form. 26/981 useless extension candidates. Maximal degree in co-relation 4962. Up to 897 conditions per place. [2022-12-13 21:48:40,832 INFO L137 encePairwiseOnDemand]: 204/214 looper letters, 90 selfloop transitions, 39 changer transitions 0/129 dead transitions. [2022-12-13 21:48:40,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 129 transitions, 1266 flow [2022-12-13 21:48:40,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 21:48:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 21:48:40,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1101 transitions. [2022-12-13 21:48:40,834 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.467714528462192 [2022-12-13 21:48:40,834 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1101 transitions. [2022-12-13 21:48:40,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1101 transitions. [2022-12-13 21:48:40,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:48:40,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1101 transitions. [2022-12-13 21:48:40,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 100.0909090909091) internal successors, (1101), 11 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:40,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 214.0) internal successors, (2568), 12 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:40,838 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 214.0) internal successors, (2568), 12 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:40,838 INFO L175 Difference]: Start difference. First operand has 102 places, 88 transitions, 800 flow. Second operand 11 states and 1101 transitions. [2022-12-13 21:48:40,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 129 transitions, 1266 flow [2022-12-13 21:48:40,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 129 transitions, 1204 flow, removed 12 selfloop flow, removed 7 redundant places. [2022-12-13 21:48:40,847 INFO L231 Difference]: Finished difference. Result has 107 places, 91 transitions, 892 flow [2022-12-13 21:48:40,847 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=892, PETRI_PLACES=107, PETRI_TRANSITIONS=91} [2022-12-13 21:48:40,847 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 75 predicate places. [2022-12-13 21:48:40,847 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 91 transitions, 892 flow [2022-12-13 21:48:40,848 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-12-13 21:48:40,848 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:48:40,848 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:48:40,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 21:48:40,848 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-12-13 21:48:40,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:48:40,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1038729560, now seen corresponding path program 1 times [2022-12-13 21:48:40,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:48:40,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551142862] [2022-12-13 21:48:40,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:48:40,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:48:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:48:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:48:41,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:48:41,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551142862] [2022-12-13 21:48:41,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551142862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:48:41,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:48:41,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:48:41,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800256625] [2022-12-13 21:48:41,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:48:41,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:48:41,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:48:41,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:48:41,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:48:41,167 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 214 [2022-12-13 21:48:41,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 91 transitions, 892 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-12-13 21:48:41,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:48:41,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 214 [2022-12-13 21:48:41,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:48:41,437 INFO L130 PetriNetUnfolder]: 554/1180 cut-off events. [2022-12-13 21:48:41,437 INFO L131 PetriNetUnfolder]: For 6136/6136 co-relation queries the response was YES. [2022-12-13 21:48:41,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5448 conditions, 1180 events. 554/1180 cut-off events. For 6136/6136 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6840 event pairs, 234 based on Foata normal form. 0/1001 useless extension candidates. Maximal degree in co-relation 5403. Up to 1022 conditions per place. [2022-12-13 21:48:41,444 INFO L137 encePairwiseOnDemand]: 205/214 looper letters, 99 selfloop transitions, 29 changer transitions 0/128 dead transitions. [2022-12-13 21:48:41,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 128 transitions, 1486 flow [2022-12-13 21:48:41,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 21:48:41,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 21:48:41,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 802 transitions. [2022-12-13 21:48:41,446 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46845794392523366 [2022-12-13 21:48:41,446 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 802 transitions. [2022-12-13 21:48:41,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 802 transitions. [2022-12-13 21:48:41,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:48:41,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 802 transitions. [2022-12-13 21:48:41,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.25) internal successors, (802), 8 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:41,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 214.0) internal successors, (1926), 9 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:41,449 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 214.0) internal successors, (1926), 9 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:41,449 INFO L175 Difference]: Start difference. First operand has 107 places, 91 transitions, 892 flow. Second operand 8 states and 802 transitions. [2022-12-13 21:48:41,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 128 transitions, 1486 flow [2022-12-13 21:48:41,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 128 transitions, 1432 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-12-13 21:48:41,461 INFO L231 Difference]: Finished difference. Result has 111 places, 105 transitions, 1145 flow [2022-12-13 21:48:41,461 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1145, PETRI_PLACES=111, PETRI_TRANSITIONS=105} [2022-12-13 21:48:41,461 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 79 predicate places. [2022-12-13 21:48:41,462 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 105 transitions, 1145 flow [2022-12-13 21:48:41,462 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-12-13 21:48:41,462 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:48:41,462 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:48:41,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 21:48:41,462 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:48:41,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:48:41,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1038729570, now seen corresponding path program 1 times [2022-12-13 21:48:41,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:48:41,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621844456] [2022-12-13 21:48:41,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:48:41,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:48:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:48:41,646 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:48:41,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:48:41,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621844456] [2022-12-13 21:48:41,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621844456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:48:41,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:48:41,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:48:41,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057906752] [2022-12-13 21:48:41,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:48:41,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:48:41,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:48:41,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:48:41,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:48:41,734 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 214 [2022-12-13 21:48:41,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 105 transitions, 1145 flow. Second operand has 7 states, 7 states have (on average 97.57142857142857) internal successors, (683), 7 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:41,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:48:41,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 214 [2022-12-13 21:48:41,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:48:42,042 INFO L130 PetriNetUnfolder]: 593/1248 cut-off events. [2022-12-13 21:48:42,042 INFO L131 PetriNetUnfolder]: For 7720/7720 co-relation queries the response was YES. [2022-12-13 21:48:42,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6271 conditions, 1248 events. 593/1248 cut-off events. For 7720/7720 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7261 event pairs, 272 based on Foata normal form. 21/1137 useless extension candidates. Maximal degree in co-relation 6221. Up to 1025 conditions per place. [2022-12-13 21:48:42,049 INFO L137 encePairwiseOnDemand]: 207/214 looper letters, 113 selfloop transitions, 28 changer transitions 0/141 dead transitions. [2022-12-13 21:48:42,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 141 transitions, 1800 flow [2022-12-13 21:48:42,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:48:42,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 21:48:42,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 737 transitions. [2022-12-13 21:48:42,051 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49198931909212285 [2022-12-13 21:48:42,051 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 737 transitions. [2022-12-13 21:48:42,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 737 transitions. [2022-12-13 21:48:42,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:48:42,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 737 transitions. [2022-12-13 21:48:42,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.28571428571429) internal successors, (737), 7 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:42,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:42,055 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:42,055 INFO L175 Difference]: Start difference. First operand has 111 places, 105 transitions, 1145 flow. Second operand 7 states and 737 transitions. [2022-12-13 21:48:42,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 141 transitions, 1800 flow [2022-12-13 21:48:42,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 141 transitions, 1760 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 21:48:42,072 INFO L231 Difference]: Finished difference. Result has 117 places, 112 transitions, 1309 flow [2022-12-13 21:48:42,073 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1309, PETRI_PLACES=117, PETRI_TRANSITIONS=112} [2022-12-13 21:48:42,073 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 85 predicate places. [2022-12-13 21:48:42,073 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 112 transitions, 1309 flow [2022-12-13 21:48:42,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.57142857142857) internal successors, (683), 7 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:42,073 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:48:42,073 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:48:42,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 21:48:42,074 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-12-13 21:48:42,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:48:42,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1045217240, now seen corresponding path program 2 times [2022-12-13 21:48:42,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:48:42,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626811085] [2022-12-13 21:48:42,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:48:42,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:48:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:48:42,269 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:48:42,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:48:42,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626811085] [2022-12-13 21:48:42,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626811085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:48:42,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:48:42,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:48:42,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745855103] [2022-12-13 21:48:42,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:48:42,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:48:42,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:48:42,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:48:42,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:48:42,381 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 214 [2022-12-13 21:48:42,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 112 transitions, 1309 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-12-13 21:48:42,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:48:42,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 214 [2022-12-13 21:48:42,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:48:42,747 INFO L130 PetriNetUnfolder]: 581/1230 cut-off events. [2022-12-13 21:48:42,747 INFO L131 PetriNetUnfolder]: For 8704/8704 co-relation queries the response was YES. [2022-12-13 21:48:42,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6386 conditions, 1230 events. 581/1230 cut-off events. For 8704/8704 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7252 event pairs, 212 based on Foata normal form. 12/1110 useless extension candidates. Maximal degree in co-relation 6333. Up to 1021 conditions per place. [2022-12-13 21:48:42,755 INFO L137 encePairwiseOnDemand]: 206/214 looper letters, 108 selfloop transitions, 41 changer transitions 0/149 dead transitions. [2022-12-13 21:48:42,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 149 transitions, 1883 flow [2022-12-13 21:48:42,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 21:48:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 21:48:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1089 transitions. [2022-12-13 21:48:42,757 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46261682242990654 [2022-12-13 21:48:42,757 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1089 transitions. [2022-12-13 21:48:42,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1089 transitions. [2022-12-13 21:48:42,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:48:42,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1089 transitions. [2022-12-13 21:48:42,759 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-12-13 21:48:42,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 214.0) internal successors, (2568), 12 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:42,761 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 214.0) internal successors, (2568), 12 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:42,761 INFO L175 Difference]: Start difference. First operand has 117 places, 112 transitions, 1309 flow. Second operand 11 states and 1089 transitions. [2022-12-13 21:48:42,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 149 transitions, 1883 flow [2022-12-13 21:48:42,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 149 transitions, 1849 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-13 21:48:42,777 INFO L231 Difference]: Finished difference. Result has 129 places, 119 transitions, 1491 flow [2022-12-13 21:48:42,777 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1491, PETRI_PLACES=129, PETRI_TRANSITIONS=119} [2022-12-13 21:48:42,777 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 97 predicate places. [2022-12-13 21:48:42,777 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 119 transitions, 1491 flow [2022-12-13 21:48:42,777 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-12-13 21:48:42,777 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:48:42,778 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:48:42,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 21:48:42,778 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:48:42,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:48:42,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1045217250, now seen corresponding path program 2 times [2022-12-13 21:48:42,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:48:42,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796092758] [2022-12-13 21:48:42,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:48:42,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:48:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:48:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:48:42,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:48:42,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796092758] [2022-12-13 21:48:42,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796092758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:48:42,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:48:42,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:48:42,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755215055] [2022-12-13 21:48:42,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:48:42,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:48:42,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:48:42,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:48:42,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:48:43,023 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 214 [2022-12-13 21:48:43,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 119 transitions, 1491 flow. Second operand has 7 states, 7 states have (on average 97.57142857142857) internal successors, (683), 7 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:43,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:48:43,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 214 [2022-12-13 21:48:43,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:48:43,399 INFO L130 PetriNetUnfolder]: 602/1263 cut-off events. [2022-12-13 21:48:43,399 INFO L131 PetriNetUnfolder]: For 10439/10439 co-relation queries the response was YES. [2022-12-13 21:48:43,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7062 conditions, 1263 events. 602/1263 cut-off events. For 10439/10439 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7371 event pairs, 228 based on Foata normal form. 15/1142 useless extension candidates. Maximal degree in co-relation 7003. Up to 980 conditions per place. [2022-12-13 21:48:43,407 INFO L137 encePairwiseOnDemand]: 207/214 looper letters, 116 selfloop transitions, 39 changer transitions 0/155 dead transitions. [2022-12-13 21:48:43,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 155 transitions, 2135 flow [2022-12-13 21:48:43,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 21:48:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 21:48:43,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 940 transitions. [2022-12-13 21:48:43,408 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48805815160955346 [2022-12-13 21:48:43,408 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 940 transitions. [2022-12-13 21:48:43,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 940 transitions. [2022-12-13 21:48:43,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:48:43,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 940 transitions. [2022-12-13 21:48:43,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 104.44444444444444) internal successors, (940), 9 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:43,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 214.0) internal successors, (2140), 10 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:43,412 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 214.0) internal successors, (2140), 10 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:43,412 INFO L175 Difference]: Start difference. First operand has 129 places, 119 transitions, 1491 flow. Second operand 9 states and 940 transitions. [2022-12-13 21:48:43,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 155 transitions, 2135 flow [2022-12-13 21:48:43,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 155 transitions, 2034 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 21:48:43,430 INFO L231 Difference]: Finished difference. Result has 134 places, 122 transitions, 1557 flow [2022-12-13 21:48:43,430 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1557, PETRI_PLACES=134, PETRI_TRANSITIONS=122} [2022-12-13 21:48:43,431 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 102 predicate places. [2022-12-13 21:48:43,431 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 122 transitions, 1557 flow [2022-12-13 21:48:43,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.57142857142857) internal successors, (683), 7 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:43,431 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:48:43,431 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:48:43,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 21:48:43,431 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:48:43,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:48:43,432 INFO L85 PathProgramCache]: Analyzing trace with hash -428186058, now seen corresponding path program 1 times [2022-12-13 21:48:43,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:48:43,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313317988] [2022-12-13 21:48:43,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:48:43,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:48:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:48:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:48:43,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:48:43,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313317988] [2022-12-13 21:48:43,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313317988] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:48:43,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364325657] [2022-12-13 21:48:43,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:48:43,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:48:43,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:48:43,608 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:48:43,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 21:48:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:48:43,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 21:48:43,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:48:43,699 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-12-13 21:48:43,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:48:43,755 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-12-13 21:48:43,809 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-12-13 21:48:47,804 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:48:47,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:48:51,992 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_526 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_527 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_40| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39| (+ 28 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_40|)) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_40| v_ArrVal_526) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| v_ArrVal_527) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39|) 2147483650)))) is different from false [2022-12-13 21:48:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:48:52,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364325657] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:48:52,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:48:52,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-13 21:48:52,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136556165] [2022-12-13 21:48:52,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:48:52,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 21:48:52,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:48:52,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 21:48:52,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=238, Unknown=6, NotChecked=34, Total=380 [2022-12-13 21:48:52,211 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 214 [2022-12-13 21:48:52,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 122 transitions, 1557 flow. Second operand has 20 states, 20 states have (on average 74.55) internal successors, (1491), 20 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:48:52,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:48:52,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 214 [2022-12-13 21:48:52,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:48:53,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:48:54,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:48:56,196 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-12-13 21:48:57,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:48:58,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:49:00,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:49:01,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:49:02,939 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 [0] [2022-12-13 21:49:04,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:49:07,112 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-12-13 21:49:08,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:49:11,438 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-12-13 21:49:12,872 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-12-13 21:49:14,343 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-12-13 21:49:17,785 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-12-13 21:49:19,506 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-12-13 21:49:21,017 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-12-13 21:49:22,476 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-12-13 21:49:29,494 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-12-13 21:49:31,518 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-12-13 21:49:32,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:49:34,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:49:39,319 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-12-13 21:49:47,760 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-12-13 21:50:00,042 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-12-13 21:50:02,047 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-12-13 21:50:04,051 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-12-13 21:50:06,056 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-12-13 21:50:08,062 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-12-13 21:50:16,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-12-13 21:50:18,392 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-12-13 21:50:20,405 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-12-13 21:50:22,420 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-12-13 21:50:34,512 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-12-13 21:50:50,599 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-12-13 21:50:52,614 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-12-13 21:50:54,621 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-12-13 21:50:56,654 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-12-13 21:50:58,825 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-12-13 21:51:00,830 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-12-13 21:51:02,835 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-12-13 21:51:04,841 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-12-13 21:51:06,856 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-12-13 21:51:08,877 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-12-13 21:51:10,883 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-12-13 21:51:12,888 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-12-13 21:51:14,910 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-12-13 21:51:16,931 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-12-13 21:51:18,937 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-12-13 21:51:21,035 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-12-13 21:51:23,046 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-12-13 21:51:25,064 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-12-13 21:51:27,081 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-12-13 21:51:29,088 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-12-13 21:51:31,104 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-12-13 21:51:33,115 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-12-13 21:51:35,121 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-12-13 21:51:37,127 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-12-13 21:51:39,195 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-12-13 21:51:41,216 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-12-13 21:51:42,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:51:44,392 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-12-13 21:51:46,397 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-12-13 21:51:48,408 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-12-13 21:51:50,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-12-13 21:51:52,471 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-12-13 21:51:52,735 INFO L130 PetriNetUnfolder]: 785/1613 cut-off events. [2022-12-13 21:51:52,735 INFO L131 PetriNetUnfolder]: For 16509/16509 co-relation queries the response was YES. [2022-12-13 21:51:52,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9213 conditions, 1613 events. 785/1613 cut-off events. For 16509/16509 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9918 event pairs, 84 based on Foata normal form. 75/1514 useless extension candidates. Maximal degree in co-relation 9152. Up to 356 conditions per place. [2022-12-13 21:51:52,744 INFO L137 encePairwiseOnDemand]: 202/214 looper letters, 231 selfloop transitions, 98 changer transitions 0/329 dead transitions. [2022-12-13 21:51:52,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 329 transitions, 4134 flow [2022-12-13 21:51:52,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 21:51:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 21:51:52,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1992 transitions. [2022-12-13 21:51:52,746 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3878504672897196 [2022-12-13 21:51:52,746 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 1992 transitions. [2022-12-13 21:51:52,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 1992 transitions. [2022-12-13 21:51:52,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:51:52,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1992 transitions. [2022-12-13 21:51:52,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 83.0) internal successors, (1992), 24 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:51:52,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 214.0) internal successors, (5350), 25 states have internal predecessors, (5350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:51:52,753 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 214.0) internal successors, (5350), 25 states have internal predecessors, (5350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:51:52,753 INFO L175 Difference]: Start difference. First operand has 134 places, 122 transitions, 1557 flow. Second operand 24 states and 1992 transitions. [2022-12-13 21:51:52,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 329 transitions, 4134 flow [2022-12-13 21:51:52,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 329 transitions, 4021 flow, removed 34 selfloop flow, removed 6 redundant places. [2022-12-13 21:51:52,780 INFO L231 Difference]: Finished difference. Result has 161 places, 153 transitions, 2186 flow [2022-12-13 21:51:52,780 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2186, PETRI_PLACES=161, PETRI_TRANSITIONS=153} [2022-12-13 21:51:52,781 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 129 predicate places. [2022-12-13 21:51:52,781 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 153 transitions, 2186 flow [2022-12-13 21:51:52,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 74.55) internal successors, (1491), 20 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:51:52,781 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:51:52,781 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:51:52,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 21:51:52,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 21:51:52,983 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-12-13 21:51:52,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:51:52,984 INFO L85 PathProgramCache]: Analyzing trace with hash 271007628, now seen corresponding path program 1 times [2022-12-13 21:51:52,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:51:52,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033517564] [2022-12-13 21:51:52,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:51:52,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:51:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:51:53,207 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:51:53,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:51:53,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033517564] [2022-12-13 21:51:53,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033517564] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:51:53,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144480366] [2022-12-13 21:51:53,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:51:53,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:51:53,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:51:53,209 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:51:53,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 21:51:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:51:53,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 21:51:53,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:51:53,294 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-12-13 21:51:53,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:51:53,354 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-12-13 21:51:53,403 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-12-13 21:51:58,432 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:51:58,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:52:02,617 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_598 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (v_ArrVal_596 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_596) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_598) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| 28)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_41|)))) is different from false [2022-12-13 21:52:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:52:02,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144480366] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:52:02,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:52:02,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-13 21:52:02,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090846285] [2022-12-13 21:52:02,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:52:02,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 21:52:02,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:02,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 21:52:02,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=216, Unknown=6, NotChecked=32, Total=342 [2022-12-13 21:52:02,832 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 214 [2022-12-13 21:52:02,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 153 transitions, 2186 flow. Second operand has 19 states, 19 states have (on average 81.63157894736842) internal successors, (1551), 19 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:52:02,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:52:02,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 214 [2022-12-13 21:52:02,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:52:04,303 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-12-13 21:52:06,045 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-12-13 21:52:07,733 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-12-13 21:52:09,288 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-12-13 21:52:10,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:52:12,257 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-12-13 21:52:13,964 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-12-13 21:52:15,692 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-12-13 21:52:17,329 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-12-13 21:52:20,716 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-12-13 21:52:22,382 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-12-13 21:52:24,063 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-12-13 21:52:25,838 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-12-13 21:52:27,482 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-12-13 21:52:31,466 INFO L130 PetriNetUnfolder]: 756/1554 cut-off events. [2022-12-13 21:52:31,466 INFO L131 PetriNetUnfolder]: For 18386/18386 co-relation queries the response was YES. [2022-12-13 21:52:31,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9647 conditions, 1554 events. 756/1554 cut-off events. For 18386/18386 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9419 event pairs, 253 based on Foata normal form. 29/1435 useless extension candidates. Maximal degree in co-relation 9575. Up to 1068 conditions per place. [2022-12-13 21:52:31,480 INFO L137 encePairwiseOnDemand]: 206/214 looper letters, 163 selfloop transitions, 63 changer transitions 0/226 dead transitions. [2022-12-13 21:52:31,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 226 transitions, 3502 flow [2022-12-13 21:52:31,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 21:52:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 21:52:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 977 transitions. [2022-12-13 21:52:31,482 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41503823279524216 [2022-12-13 21:52:31,482 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 977 transitions. [2022-12-13 21:52:31,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 977 transitions. [2022-12-13 21:52:31,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:52:31,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 977 transitions. [2022-12-13 21:52:31,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 88.81818181818181) internal successors, (977), 11 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:52:31,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 214.0) internal successors, (2568), 12 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:52:31,486 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 214.0) internal successors, (2568), 12 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:52:31,486 INFO L175 Difference]: Start difference. First operand has 161 places, 153 transitions, 2186 flow. Second operand 11 states and 977 transitions. [2022-12-13 21:52:31,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 226 transitions, 3502 flow [2022-12-13 21:52:31,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 226 transitions, 3219 flow, removed 109 selfloop flow, removed 8 redundant places. [2022-12-13 21:52:31,524 INFO L231 Difference]: Finished difference. Result has 169 places, 165 transitions, 2428 flow [2022-12-13 21:52:31,524 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=1941, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2428, PETRI_PLACES=169, PETRI_TRANSITIONS=165} [2022-12-13 21:52:31,524 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 137 predicate places. [2022-12-13 21:52:31,524 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 165 transitions, 2428 flow [2022-12-13 21:52:31,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 81.63157894736842) internal successors, (1551), 19 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:52:31,525 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:52:31,525 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 21:52:31,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 21:52:31,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:52:31,727 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:52:31,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:31,728 INFO L85 PathProgramCache]: Analyzing trace with hash 830076593, now seen corresponding path program 1 times [2022-12-13 21:52:31,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:31,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688131030] [2022-12-13 21:52:31,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:31,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:31,781 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:52:31,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:52:31,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688131030] [2022-12-13 21:52:31,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688131030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:52:31,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:52:31,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:52:31,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999377084] [2022-12-13 21:52:31,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:52:31,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:52:31,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:31,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:52:31,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:52:31,794 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 214 [2022-12-13 21:52:31,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 165 transitions, 2428 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-12-13 21:52:31,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:52:31,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 214 [2022-12-13 21:52:31,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:52:32,102 INFO L130 PetriNetUnfolder]: 734/1506 cut-off events. [2022-12-13 21:52:32,102 INFO L131 PetriNetUnfolder]: For 18713/18713 co-relation queries the response was YES. [2022-12-13 21:52:32,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9563 conditions, 1506 events. 734/1506 cut-off events. For 18713/18713 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9000 event pairs, 337 based on Foata normal form. 0/1447 useless extension candidates. Maximal degree in co-relation 9487. Up to 1475 conditions per place. [2022-12-13 21:52:32,111 INFO L137 encePairwiseOnDemand]: 212/214 looper letters, 177 selfloop transitions, 2 changer transitions 0/179 dead transitions. [2022-12-13 21:52:32,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 179 transitions, 2946 flow [2022-12-13 21:52:32,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:52:32,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:52:32,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2022-12-13 21:52:32,112 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5311526479750779 [2022-12-13 21:52:32,112 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2022-12-13 21:52:32,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2022-12-13 21:52:32,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:52:32,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2022-12-13 21:52:32,113 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-12-13 21:52:32,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:52:32,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:52:32,113 INFO L175 Difference]: Start difference. First operand has 169 places, 165 transitions, 2428 flow. Second operand 3 states and 341 transitions. [2022-12-13 21:52:32,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 179 transitions, 2946 flow [2022-12-13 21:52:32,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 179 transitions, 2855 flow, removed 34 selfloop flow, removed 2 redundant places. [2022-12-13 21:52:32,158 INFO L231 Difference]: Finished difference. Result has 168 places, 164 transitions, 2346 flow [2022-12-13 21:52:32,158 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=2342, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2346, PETRI_PLACES=168, PETRI_TRANSITIONS=164} [2022-12-13 21:52:32,159 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 136 predicate places. [2022-12-13 21:52:32,159 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 164 transitions, 2346 flow [2022-12-13 21:52:32,159 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-12-13 21:52:32,159 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:52:32,159 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 21:52:32,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 21:52:32,159 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:52:32,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:32,159 INFO L85 PathProgramCache]: Analyzing trace with hash 830076594, now seen corresponding path program 1 times [2022-12-13 21:52:32,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:32,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966532526] [2022-12-13 21:52:32,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:32,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:32,188 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-13 21:52:32,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:52:32,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966532526] [2022-12-13 21:52:32,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966532526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:52:32,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:52:32,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:52:32,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661688585] [2022-12-13 21:52:32,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:52:32,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:52:32,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:32,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:52:32,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:52:32,198 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 214 [2022-12-13 21:52:32,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 164 transitions, 2346 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-12-13 21:52:32,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:52:32,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 214 [2022-12-13 21:52:32,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:52:32,498 INFO L130 PetriNetUnfolder]: 712/1458 cut-off events. [2022-12-13 21:52:32,498 INFO L131 PetriNetUnfolder]: For 17556/17556 co-relation queries the response was YES. [2022-12-13 21:52:32,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9264 conditions, 1458 events. 712/1458 cut-off events. For 17556/17556 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8666 event pairs, 237 based on Foata normal form. 26/1427 useless extension candidates. Maximal degree in co-relation 9188. Up to 840 conditions per place. [2022-12-13 21:52:32,506 INFO L137 encePairwiseOnDemand]: 210/214 looper letters, 174 selfloop transitions, 12 changer transitions 0/186 dead transitions. [2022-12-13 21:52:32,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 186 transitions, 2978 flow [2022-12-13 21:52:32,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:52:32,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:52:32,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2022-12-13 21:52:32,507 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5280373831775701 [2022-12-13 21:52:32,507 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2022-12-13 21:52:32,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2022-12-13 21:52:32,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:52:32,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2022-12-13 21:52:32,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:52:32,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:52:32,509 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:52:32,509 INFO L175 Difference]: Start difference. First operand has 168 places, 164 transitions, 2346 flow. Second operand 3 states and 339 transitions. [2022-12-13 21:52:32,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 186 transitions, 2978 flow [2022-12-13 21:52:32,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 186 transitions, 2976 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:52:32,553 INFO L231 Difference]: Finished difference. Result has 168 places, 163 transitions, 2364 flow [2022-12-13 21:52:32,553 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=2340, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2364, PETRI_PLACES=168, PETRI_TRANSITIONS=163} [2022-12-13 21:52:32,553 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 136 predicate places. [2022-12-13 21:52:32,553 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 163 transitions, 2364 flow [2022-12-13 21:52:32,553 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-12-13 21:52:32,553 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:52:32,554 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 21:52:32,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 21:52:32,554 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:52:32,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:32,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1554734371, now seen corresponding path program 1 times [2022-12-13 21:52:32,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:32,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116113228] [2022-12-13 21:52:32,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:32,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-13 21:52:32,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:52:32,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116113228] [2022-12-13 21:52:32,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116113228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:52:32,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:52:32,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:52:32,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352268707] [2022-12-13 21:52:32,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:52:32,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:52:32,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:32,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:52:32,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:52:32,590 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 214 [2022-12-13 21:52:32,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 163 transitions, 2364 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-12-13 21:52:32,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:52:32,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 214 [2022-12-13 21:52:32,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:52:32,893 INFO L130 PetriNetUnfolder]: 653/1342 cut-off events. [2022-12-13 21:52:32,893 INFO L131 PetriNetUnfolder]: For 17094/17094 co-relation queries the response was YES. [2022-12-13 21:52:32,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8820 conditions, 1342 events. 653/1342 cut-off events. For 17094/17094 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7806 event pairs, 212 based on Foata normal form. 0/1342 useless extension candidates. Maximal degree in co-relation 8744. Up to 1006 conditions per place. [2022-12-13 21:52:32,901 INFO L137 encePairwiseOnDemand]: 210/214 looper letters, 192 selfloop transitions, 11 changer transitions 0/203 dead transitions. [2022-12-13 21:52:32,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 203 transitions, 3226 flow [2022-12-13 21:52:32,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:52:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:52:32,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2022-12-13 21:52:32,903 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5358255451713395 [2022-12-13 21:52:32,903 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 344 transitions. [2022-12-13 21:52:32,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 344 transitions. [2022-12-13 21:52:32,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:52:32,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 344 transitions. [2022-12-13 21:52:32,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:52:32,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:52:32,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:52:32,905 INFO L175 Difference]: Start difference. First operand has 168 places, 163 transitions, 2364 flow. Second operand 3 states and 344 transitions. [2022-12-13 21:52:32,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 203 transitions, 3226 flow [2022-12-13 21:52:32,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 203 transitions, 3205 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:52:32,945 INFO L231 Difference]: Finished difference. Result has 169 places, 163 transitions, 2391 flow [2022-12-13 21:52:32,946 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=2348, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2391, PETRI_PLACES=169, PETRI_TRANSITIONS=163} [2022-12-13 21:52:32,946 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 137 predicate places. [2022-12-13 21:52:32,946 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 163 transitions, 2391 flow [2022-12-13 21:52:32,946 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-12-13 21:52:32,946 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:52:32,946 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 21:52:32,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 21:52:32,946 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:52:32,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:32,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1554734372, now seen corresponding path program 1 times [2022-12-13 21:52:32,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:32,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048488330] [2022-12-13 21:52:32,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:32,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:32,977 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:52:32,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:52:32,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048488330] [2022-12-13 21:52:32,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048488330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:52:32,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:52:32,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:52:32,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008073678] [2022-12-13 21:52:32,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:52:32,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:52:32,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:32,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:52:32,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:52:32,987 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 214 [2022-12-13 21:52:32,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 163 transitions, 2391 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:52:32,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:52:32,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 214 [2022-12-13 21:52:32,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:52:33,237 INFO L130 PetriNetUnfolder]: 594/1226 cut-off events. [2022-12-13 21:52:33,238 INFO L131 PetriNetUnfolder]: For 16919/16919 co-relation queries the response was YES. [2022-12-13 21:52:33,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8486 conditions, 1226 events. 594/1226 cut-off events. For 16919/16919 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6886 event pairs, 246 based on Foata normal form. 57/1283 useless extension candidates. Maximal degree in co-relation 8409. Up to 1189 conditions per place. [2022-12-13 21:52:33,245 INFO L137 encePairwiseOnDemand]: 212/214 looper letters, 180 selfloop transitions, 1 changer transitions 0/181 dead transitions. [2022-12-13 21:52:33,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 181 transitions, 2923 flow [2022-12-13 21:52:33,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:52:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:52:33,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2022-12-13 21:52:33,246 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5358255451713395 [2022-12-13 21:52:33,247 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 344 transitions. [2022-12-13 21:52:33,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 344 transitions. [2022-12-13 21:52:33,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:52:33,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 344 transitions. [2022-12-13 21:52:33,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:52:33,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:52:33,248 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:52:33,248 INFO L175 Difference]: Start difference. First operand has 169 places, 163 transitions, 2391 flow. Second operand 3 states and 344 transitions. [2022-12-13 21:52:33,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 181 transitions, 2923 flow [2022-12-13 21:52:33,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 181 transitions, 2910 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 21:52:33,287 INFO L231 Difference]: Finished difference. Result has 169 places, 162 transitions, 2376 flow [2022-12-13 21:52:33,287 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=2374, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2376, PETRI_PLACES=169, PETRI_TRANSITIONS=162} [2022-12-13 21:52:33,287 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 137 predicate places. [2022-12-13 21:52:33,288 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 162 transitions, 2376 flow [2022-12-13 21:52:33,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:52:33,288 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:52:33,288 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:52:33,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 21:52:33,288 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:52:33,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:33,288 INFO L85 PathProgramCache]: Analyzing trace with hash 907730730, now seen corresponding path program 1 times [2022-12-13 21:52:33,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:33,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635303640] [2022-12-13 21:52:33,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:33,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:33,771 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:52:33,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:52:33,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635303640] [2022-12-13 21:52:33,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635303640] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:52:33,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277756953] [2022-12-13 21:52:33,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:33,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:52:33,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:52:33,773 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:52:33,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 21:52:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:33,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 21:52:33,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:52:33,858 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-12-13 21:52:33,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:52:33,936 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-12-13 21:52:34,071 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-12-13 21:52:34,210 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-12-13 21:52:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:52:34,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:52:47,231 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:52:47,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277756953] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:52:47,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:52:47,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2022-12-13 21:52:47,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203713084] [2022-12-13 21:52:47,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:52:47,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 21:52:47,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:47,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 21:52:47,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=900, Unknown=8, NotChecked=0, Total=1122 [2022-12-13 21:52:49,296 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-12-13 21:52:51,324 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-12-13 21:52:53,346 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-12-13 21:52:55,382 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-12-13 21:52:57,430 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-12-13 21:52:59,476 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-12-13 21:53:01,550 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-12-13 21:53:03,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-12-13 21:53:05,725 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-12-13 21:53:07,780 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-12-13 21:53:09,685 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-12-13 21:53:11,691 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-12-13 21:53:13,705 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-12-13 21:53:15,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-12-13 21:53:17,811 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-12-13 21:53:18,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:53:21,053 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-12-13 21:53:23,069 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-12-13 21:53:25,234 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-12-13 21:53:27,311 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-12-13 21:53:30,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-12-13 21:53:32,155 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-12-13 21:53:34,266 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-12-13 21:53:36,407 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-12-13 21:53:38,421 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-12-13 21:53:40,461 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-12-13 21:53:42,487 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-12-13 21:53:42,505 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 214 [2022-12-13 21:53:42,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 162 transitions, 2376 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-12-13 21:53:42,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:42,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 214 [2022-12-13 21:53:42,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:45,982 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_825 Int) (v_ArrVal_824 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (or (< (+ (select .cse0 |c_~#cache~0.offset|) 1) v_ArrVal_824) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| .cse1) (< (select (store (store .cse0 |c_~#cache~0.offset| v_ArrVal_824) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| v_ArrVal_825) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) 2147483647)))) (= ((as const (Array Int Int)) 0) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (forall ((v_ArrVal_822 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_825 Int) (v_ArrVal_824 Int)) (let ((.cse3 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_822) |c_~#cache~0.base|))) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< (+ (select .cse3 |c_~#cache~0.offset|) 1) v_ArrVal_824) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| .cse1) (< (select (store (store .cse3 |c_~#cache~0.offset| v_ArrVal_824) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| v_ArrVal_825) |c_~#cache~0.offset|) 2147483647)))) (<= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) is different from false [2022-12-13 21:53:51,642 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0)) (.cse4 (@diff .cse3 .cse0))) (and (= .cse0 (store .cse1 .cse2 0)) (= .cse0 (store .cse3 .cse4 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (or (= .cse0 .cse3) (<= (+ 28 .cse4) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (<= (select .cse1 .cse2) 1) (forall ((v_ArrVal_822 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_825 Int) (v_ArrVal_824 Int)) (let ((.cse5 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_822) |c_~#cache~0.base|))) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< (+ (select .cse5 |c_~#cache~0.offset|) 1) v_ArrVal_824) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset|)) (< (select (store (store .cse5 |c_~#cache~0.offset| v_ArrVal_824) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| v_ArrVal_825) |c_~#cache~0.offset|) 2147483647)))) (<= (select .cse3 .cse4) 1)))) is different from false [2022-12-13 21:53:54,274 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 [0, 1] [2022-12-13 21:54:00,201 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-12-13 21:54:00,766 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|))) (and (= |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) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_825 Int) (v_ArrVal_824 Int)) (or (< (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_824)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| v_ArrVal_825) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) 2147483647) (not (<= v_ArrVal_824 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 1))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (<= .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_824 Int)) (let ((.cse1 ((as const (Array Int Int)) 0))) (and (= (store .cse1 |c_~#cache~0.offset| v_ArrVal_824) (select |c_#memory_int| |c_~#cache~0.base|)) (<= v_ArrVal_824 (+ (select .cse1 |c_~#cache~0.offset|) 1))))) (forall ((v_ArrVal_822 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_825 Int) (v_ArrVal_824 Int)) (let ((.cse2 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_822) |c_~#cache~0.base|))) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< (+ (select .cse2 |c_~#cache~0.offset|) 1) v_ArrVal_824) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| .cse0) (< (select (store (store .cse2 |c_~#cache~0.offset| v_ArrVal_824) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| v_ArrVal_825) |c_~#cache~0.offset|) 2147483647)))))) is different from false [2022-12-13 21:54:08,284 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-12-13 21:54:10,381 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-12-13 21:54:12,839 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-12-13 21:54:14,924 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-12-13 21:54:16,425 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 [1] [2022-12-13 21:54:23,325 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-12-13 21:54:25,676 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-12-13 21:54:34,521 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0)) (.cse5 (+ 28 |c_~#cache~0.offset|)) (.cse4 (@diff .cse3 .cse0))) (and (= .cse0 (store .cse1 .cse2 0)) (= .cse0 (store .cse3 .cse4 0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_825 Int) (v_ArrVal_824 Int)) (or (< (+ (select .cse3 |c_~#cache~0.offset|) 1) v_ArrVal_824) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| .cse5) (< (select (store (store .cse3 |c_~#cache~0.offset| v_ArrVal_824) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| v_ArrVal_825) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) 2147483647))) (or (= .cse0 .cse1) (and (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse2)) (<= (select .cse1 .cse2) 1))) (or (= .cse0 .cse3) (<= (+ 28 .cse4) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (forall ((v_ArrVal_822 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_825 Int) (v_ArrVal_824 Int)) (let ((.cse6 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_822) |c_~#cache~0.base|))) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< (+ (select .cse6 |c_~#cache~0.offset|) 1) v_ArrVal_824) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| .cse5) (< (select (store (store .cse6 |c_~#cache~0.offset| v_ArrVal_824) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| v_ArrVal_825) |c_~#cache~0.offset|) 2147483647)))) (<= (select .cse3 .cse4) 1)))) is different from false [2022-12-13 21:54:36,593 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-12-13 21:54:38,624 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 [0, 1] [2022-12-13 21:54:42,754 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 [1] [2022-12-13 21:54:47,797 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-12-13 21:54:59,254 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-12-13 21:55:01,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-12-13 21:55:10,230 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-12-13 21:55:13,617 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-12-13 21:55:16,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-12-13 21:55:18,227 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-12-13 21:55:20,243 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-12-13 21:55:22,249 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-12-13 21:55:28,710 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-12-13 21:55:29,852 INFO L130 PetriNetUnfolder]: 1105/2240 cut-off events. [2022-12-13 21:55:29,852 INFO L131 PetriNetUnfolder]: For 38557/38557 co-relation queries the response was YES. [2022-12-13 21:55:29,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16624 conditions, 2240 events. 1105/2240 cut-off events. For 38557/38557 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13892 event pairs, 191 based on Foata normal form. 90/2330 useless extension candidates. Maximal degree in co-relation 16546. Up to 1288 conditions per place. [2022-12-13 21:55:29,883 INFO L137 encePairwiseOnDemand]: 201/214 looper letters, 266 selfloop transitions, 348 changer transitions 0/614 dead transitions. [2022-12-13 21:55:29,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 614 transitions, 10513 flow [2022-12-13 21:55:29,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-12-13 21:55:29,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2022-12-13 21:55:29,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 5381 transitions. [2022-12-13 21:55:29,888 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3143107476635514 [2022-12-13 21:55:29,888 INFO L72 ComplementDD]: Start complementDD. Operand 80 states and 5381 transitions. [2022-12-13 21:55:29,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 5381 transitions. [2022-12-13 21:55:29,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:55:29,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 80 states and 5381 transitions. [2022-12-13 21:55:29,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 81 states, 80 states have (on average 67.2625) internal successors, (5381), 80 states have internal predecessors, (5381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:55:29,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 81 states, 81 states have (on average 214.0) internal successors, (17334), 81 states have internal predecessors, (17334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:55:29,905 INFO L81 ComplementDD]: Finished complementDD. Result has 81 states, 81 states have (on average 214.0) internal successors, (17334), 81 states have internal predecessors, (17334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:55:29,905 INFO L175 Difference]: Start difference. First operand has 169 places, 162 transitions, 2376 flow. Second operand 80 states and 5381 transitions. [2022-12-13 21:55:29,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 614 transitions, 10513 flow [2022-12-13 21:55:29,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 614 transitions, 10508 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:55:29,995 INFO L231 Difference]: Finished difference. Result has 281 places, 464 transitions, 9088 flow [2022-12-13 21:55:29,995 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=2375, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=80, PETRI_FLOW=9088, PETRI_PLACES=281, PETRI_TRANSITIONS=464} [2022-12-13 21:55:29,995 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 249 predicate places. [2022-12-13 21:55:29,995 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 464 transitions, 9088 flow [2022-12-13 21:55:29,996 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-12-13 21:55:29,996 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:55:29,996 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:55:30,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 21:55:30,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:55:30,197 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:55:30,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:55:30,197 INFO L85 PathProgramCache]: Analyzing trace with hash 19401052, now seen corresponding path program 1 times [2022-12-13 21:55:30,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:55:30,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886079377] [2022-12-13 21:55:30,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:55:30,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:55:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:55:30,675 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:55:30,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:55:30,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886079377] [2022-12-13 21:55:30,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886079377] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:55:30,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338406612] [2022-12-13 21:55:30,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:55:30,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:55:30,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:55:30,677 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:55:30,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 21:55:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:55:30,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 21:55:30,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:55:30,769 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-12-13 21:55:30,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:55:30,900 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-12-13 21:55:31,073 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-12-13 21:55:31,251 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-12-13 21:55:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:55:31,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:55:35,296 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:55:35,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338406612] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:55:35,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:55:35,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2022-12-13 21:55:35,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097540759] [2022-12-13 21:55:35,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:55:35,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 21:55:35,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:55:35,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 21:55:35,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=750, Unknown=3, NotChecked=0, Total=930 [2022-12-13 21:55:37,283 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 214 [2022-12-13 21:55:37,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 464 transitions, 9088 flow. Second operand has 31 states, 31 states have (on average 70.45161290322581) internal successors, (2184), 31 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:55:37,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:55:37,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 214 [2022-12-13 21:55:37,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:55:38,736 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((as const (Array Int Int)) 0)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_902 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42| Int) (v_ArrVal_906 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_902) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_906) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42| (+ 28 |c_~#cache~0.offset|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)))) (exists ((v_ArrVal_906 Int)) (= .cse0 (store .cse1 0 v_ArrVal_906))) (<= 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) (exists ((v_ArrVal_903 Int)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store .cse1 |c_~#cache~0.offset| v_ArrVal_903))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42| Int) (v_ArrVal_906 Int) (v_ArrVal_903 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_903)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_906) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2022-12-13 21:55:40,881 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((as const (Array Int Int)) 0)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_902 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42| Int) (v_ArrVal_906 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_902) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_906) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42| (+ 28 |c_~#cache~0.offset|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)))) (exists ((v_ArrVal_906 Int)) (= .cse0 (store .cse1 0 v_ArrVal_906))) (<= 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) (exists ((v_ArrVal_903 Int)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store .cse1 |c_~#cache~0.offset| v_ArrVal_903))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42| Int) (v_ArrVal_906 Int) (v_ArrVal_903 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_903)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_906) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2022-12-13 21:55:42,331 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_902 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42| Int) (v_ArrVal_906 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_902) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_906) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42| (+ 28 |c_~#cache~0.offset|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)))) (exists ((v_ArrVal_906 Int)) (= .cse0 (store .cse1 0 v_ArrVal_906))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42| Int) (v_ArrVal_906 Int) (v_ArrVal_903 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_903)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_906) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_42| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_906 Int)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store .cse1 |c_~#cache~0.offset| v_ArrVal_906))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2022-12-13 21:55:46,111 INFO L130 PetriNetUnfolder]: 1655/3321 cut-off events. [2022-12-13 21:55:46,111 INFO L131 PetriNetUnfolder]: For 90471/90471 co-relation queries the response was YES. [2022-12-13 21:55:46,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30284 conditions, 3321 events. 1655/3321 cut-off events. For 90471/90471 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 22599 event pairs, 228 based on Foata normal form. 56/3377 useless extension candidates. Maximal degree in co-relation 30171. Up to 1988 conditions per place. [2022-12-13 21:55:46,142 INFO L137 encePairwiseOnDemand]: 195/214 looper letters, 447 selfloop transitions, 398 changer transitions 0/845 dead transitions. [2022-12-13 21:55:46,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 845 transitions, 17373 flow [2022-12-13 21:55:46,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 21:55:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-13 21:55:46,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 2974 transitions. [2022-12-13 21:55:46,146 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.35633836568416005 [2022-12-13 21:55:46,146 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 2974 transitions. [2022-12-13 21:55:46,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 2974 transitions. [2022-12-13 21:55:46,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:55:46,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 2974 transitions. [2022-12-13 21:55:46,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 76.25641025641026) internal successors, (2974), 39 states have internal predecessors, (2974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:55:46,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 214.0) internal successors, (8560), 40 states have internal predecessors, (8560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:55:46,155 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 214.0) internal successors, (8560), 40 states have internal predecessors, (8560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:55:46,155 INFO L175 Difference]: Start difference. First operand has 281 places, 464 transitions, 9088 flow. Second operand 39 states and 2974 transitions. [2022-12-13 21:55:46,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 845 transitions, 17373 flow [2022-12-13 21:55:46,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 845 transitions, 16797 flow, removed 239 selfloop flow, removed 7 redundant places. [2022-12-13 21:55:46,441 INFO L231 Difference]: Finished difference. Result has 335 places, 725 transitions, 15112 flow [2022-12-13 21:55:46,441 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=8695, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=15112, PETRI_PLACES=335, PETRI_TRANSITIONS=725} [2022-12-13 21:55:46,441 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 303 predicate places. [2022-12-13 21:55:46,441 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 725 transitions, 15112 flow [2022-12-13 21:55:46,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 70.45161290322581) internal successors, (2184), 31 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:55:46,442 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:55:46,442 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:55:46,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 21:55:46,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:55:46,643 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:55:46,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:55:46,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1964359332, now seen corresponding path program 2 times [2022-12-13 21:55:46,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:55:46,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458983087] [2022-12-13 21:55:46,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:55:46,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:55:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:55:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:55:47,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:55:47,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458983087] [2022-12-13 21:55:47,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458983087] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:55:47,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693480967] [2022-12-13 21:55:47,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 21:55:47,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:55:47,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:55:47,203 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:55:47,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 21:55:47,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 21:55:47,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:55:47,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 21:55:47,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:55:47,299 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-12-13 21:55:47,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:55:47,429 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-12-13 21:55:47,694 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-12-13 21:55:47,814 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-12-13 21:55:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:55:47,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:55:48,515 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_44| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_986 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_44| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_982) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_986) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_44|) 2147483647) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_44|)))) is different from false [2022-12-13 21:55:48,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-12-13 21:55:48,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693480967] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:55:48,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:55:48,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2022-12-13 21:55:48,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475553344] [2022-12-13 21:55:48,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:55:48,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 21:55:48,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:55:48,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 21:55:48,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=713, Unknown=1, NotChecked=56, Total=930 [2022-12-13 21:55:48,876 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 214 [2022-12-13 21:55:48,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 725 transitions, 15112 flow. Second operand has 31 states, 31 states have (on average 64.45161290322581) internal successors, (1998), 31 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:55:48,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:55:48,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 214 [2022-12-13 21:55:48,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:56:11,838 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 [0, 1] [2022-12-13 21:56:13,898 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-12-13 21:56:24,577 INFO L130 PetriNetUnfolder]: 2729/5390 cut-off events. [2022-12-13 21:56:24,577 INFO L131 PetriNetUnfolder]: For 177864/177864 co-relation queries the response was YES. [2022-12-13 21:56:24,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52460 conditions, 5390 events. 2729/5390 cut-off events. For 177864/177864 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 39822 event pairs, 362 based on Foata normal form. 173/5563 useless extension candidates. Maximal degree in co-relation 52324. Up to 2580 conditions per place. [2022-12-13 21:56:24,638 INFO L137 encePairwiseOnDemand]: 195/214 looper letters, 718 selfloop transitions, 845 changer transitions 0/1563 dead transitions. [2022-12-13 21:56:24,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 1563 transitions, 32590 flow [2022-12-13 21:56:24,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-12-13 21:56:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2022-12-13 21:56:24,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 7068 transitions. [2022-12-13 21:56:24,648 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3238042880703683 [2022-12-13 21:56:24,648 INFO L72 ComplementDD]: Start complementDD. Operand 102 states and 7068 transitions. [2022-12-13 21:56:24,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 7068 transitions. [2022-12-13 21:56:24,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:56:24,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 102 states and 7068 transitions. [2022-12-13 21:56:24,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 103 states, 102 states have (on average 69.29411764705883) internal successors, (7068), 102 states have internal predecessors, (7068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:56:24,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 103 states, 103 states have (on average 214.0) internal successors, (22042), 103 states have internal predecessors, (22042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:56:24,672 INFO L81 ComplementDD]: Finished complementDD. Result has 103 states, 103 states have (on average 214.0) internal successors, (22042), 103 states have internal predecessors, (22042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:56:24,672 INFO L175 Difference]: Start difference. First operand has 335 places, 725 transitions, 15112 flow. Second operand 102 states and 7068 transitions. [2022-12-13 21:56:24,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 1563 transitions, 32590 flow [2022-12-13 21:56:25,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 1563 transitions, 31369 flow, removed 588 selfloop flow, removed 3 redundant places. [2022-12-13 21:56:25,526 INFO L231 Difference]: Finished difference. Result has 508 places, 1249 transitions, 27328 flow [2022-12-13 21:56:25,527 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=14410, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=388, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=102, PETRI_FLOW=27328, PETRI_PLACES=508, PETRI_TRANSITIONS=1249} [2022-12-13 21:56:25,527 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 476 predicate places. [2022-12-13 21:56:25,527 INFO L495 AbstractCegarLoop]: Abstraction has has 508 places, 1249 transitions, 27328 flow [2022-12-13 21:56:25,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 64.45161290322581) internal successors, (1998), 31 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:56:25,528 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:56:25,528 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:56:25,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 21:56:25,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:56:25,729 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:56:25,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:56:25,730 INFO L85 PathProgramCache]: Analyzing trace with hash -62222422, now seen corresponding path program 1 times [2022-12-13 21:56:25,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:56:25,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188633317] [2022-12-13 21:56:25,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:56:25,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:56:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:56:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:56:25,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:56:25,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188633317] [2022-12-13 21:56:25,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188633317] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:56:25,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247094192] [2022-12-13 21:56:25,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:56:25,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:56:25,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:56:25,813 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:56:25,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 21:56:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:56:25,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:56:25,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:56:25,906 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:56:25,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:56:25,927 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:56:25,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247094192] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:56:25,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:56:25,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 21:56:25,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986492708] [2022-12-13 21:56:25,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:56:25,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:56:25,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:56:25,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:56:25,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:56:25,954 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 214 [2022-12-13 21:56:25,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 1249 transitions, 27328 flow. Second operand has 7 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:56:25,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:56:25,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 214 [2022-12-13 21:56:25,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:56:29,259 INFO L130 PetriNetUnfolder]: 2865/5842 cut-off events. [2022-12-13 21:56:29,259 INFO L131 PetriNetUnfolder]: For 314572/314572 co-relation queries the response was YES. [2022-12-13 21:56:29,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68116 conditions, 5842 events. 2865/5842 cut-off events. For 314572/314572 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 42308 event pairs, 572 based on Foata normal form. 326/6168 useless extension candidates. Maximal degree in co-relation 67905. Up to 1762 conditions per place. [2022-12-13 21:56:29,354 INFO L137 encePairwiseOnDemand]: 210/214 looper letters, 1475 selfloop transitions, 89 changer transitions 0/1564 dead transitions. [2022-12-13 21:56:29,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 1564 transitions, 36854 flow [2022-12-13 21:56:29,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:56:29,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:56:29,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 676 transitions. [2022-12-13 21:56:29,356 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5264797507788161 [2022-12-13 21:56:29,356 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 676 transitions. [2022-12-13 21:56:29,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 676 transitions. [2022-12-13 21:56:29,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:56:29,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 676 transitions. [2022-12-13 21:56:29,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:56:29,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:56:29,360 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:56:29,360 INFO L175 Difference]: Start difference. First operand has 508 places, 1249 transitions, 27328 flow. Second operand 6 states and 676 transitions. [2022-12-13 21:56:29,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 1564 transitions, 36854 flow [2022-12-13 21:56:31,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 1564 transitions, 32467 flow, removed 1104 selfloop flow, removed 33 redundant places. [2022-12-13 21:56:31,684 INFO L231 Difference]: Finished difference. Result has 483 places, 1219 transitions, 23634 flow [2022-12-13 21:56:31,684 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=22810, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=23634, PETRI_PLACES=483, PETRI_TRANSITIONS=1219} [2022-12-13 21:56:31,685 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 451 predicate places. [2022-12-13 21:56:31,685 INFO L495 AbstractCegarLoop]: Abstraction has has 483 places, 1219 transitions, 23634 flow [2022-12-13 21:56:31,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:56:31,685 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:56:31,685 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:56:31,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 21:56:31,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:56:31,886 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:56:31,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:56:31,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1939709462, now seen corresponding path program 3 times [2022-12-13 21:56:31,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:56:31,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203336523] [2022-12-13 21:56:31,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:56:31,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:56:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:56:32,289 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:56:32,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:56:32,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203336523] [2022-12-13 21:56:32,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203336523] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:56:32,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068984692] [2022-12-13 21:56:32,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 21:56:32,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:56:32,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:56:32,290 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:56:32,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 21:56:32,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 21:56:32,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:56:32,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 21:56:32,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:56:32,370 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-12-13 21:56:32,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:56:32,482 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-12-13 21:56:32,715 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-12-13 21:56:32,826 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-12-13 21:56:32,897 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:56:32,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:56:33,665 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:56:33,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068984692] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:56:33,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:56:33,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 28 [2022-12-13 21:56:33,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366403574] [2022-12-13 21:56:33,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:56:33,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 21:56:33,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:56:33,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 21:56:33,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=707, Unknown=6, NotChecked=0, Total=870 [2022-12-13 21:56:35,831 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 214 [2022-12-13 21:56:35,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 1219 transitions, 23634 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-12-13 21:56:35,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:56:35,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 214 [2022-12-13 21:56:35,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:56:36,877 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse5 ((as const (Array Int Int)) 0))) (let ((.cse3 (@diff .cse2 .cse5))) (let ((.cse6 (store .cse2 .cse3 0))) (let ((.cse0 (@diff .cse6 .cse5)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse4 (+ 28 |c_~#cache~0.offset|))) (and (or (<= (+ .cse0 28) .cse1) (<= (select .cse2 .cse0) 1)) (= |c_ULTIMATE.start_main_~i~2#1| 0) (or (<= (+ 28 .cse3) .cse1) (<= (select .cse2 .cse3) 1)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1136 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (v_ArrVal_1139 Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1136) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1139) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| .cse4))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (= .cse5 (store .cse6 .cse0 0)) (exists ((v_ArrVal_1138 Int)) (= .cse2 (store .cse5 .cse1 v_ArrVal_1138))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1139 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| .cse4) (< (select (store .cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1139) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647)))))))) is different from false [2022-12-13 21:56:39,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:56:48,971 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-12-13 21:56:57,580 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-12-13 21:56:58,002 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#cache~0.base|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1136 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (v_ArrVal_1139 Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1136) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1139) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| .cse0))) (<= 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) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1138 Int) (v_ArrVal_1139 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< (select (select (let ((.cse1 (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_1138)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1139))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1138 Int)) (= .cse2 (store ((as const (Array Int Int)) 0) |c_~#cache~0.offset| v_ArrVal_1138))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1139 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| .cse0) (< (select (store .cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1139) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647))))) is different from false [2022-12-13 21:57:00,134 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-12-13 21:57:09,589 WARN L233 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 80 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 21:57:09,621 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse1 (+ 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse0 |c_~#cache~0.offset|)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1136 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (v_ArrVal_1139 Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1136) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1139) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| .cse1))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1138 Int) (v_ArrVal_1139 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| (+ .cse0 28 |c_~#cache~0.offset|)) (< (select (select (let ((.cse3 (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_1138)))) (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_1139))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1139 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| .cse1) (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1139) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1139 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| .cse1) (< (select (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_1139)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647))))) is different from false [2022-12-13 21:57:18,104 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse3 (select |c_#memory_int| |c_~#cache~0.base|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1136 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (v_ArrVal_1139 Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1136) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1139) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| .cse0))) (<= 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) (<= (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1138 Int) (v_ArrVal_1139 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1138)))) (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_1139))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1138 Int)) (= .cse3 (store ((as const (Array Int Int)) 0) |c_~#cache~0.offset| v_ArrVal_1138))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1139 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| .cse0) (< (select (store .cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1139) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647))))) is different from false [2022-12-13 21:57:24,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:57:28,720 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse6 ((as const (Array Int Int)) 0))) (let ((.cse3 (@diff .cse2 .cse6))) (let ((.cse7 (store .cse2 .cse3 0))) (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse0 (@diff .cse7 .cse6)) (.cse4 (+ 28 |c_~#cache~0.offset|)) (.cse5 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (or (<= (+ .cse0 28) .cse1) (<= (select .cse2 .cse0) 1)) (or (<= (+ 28 .cse3) .cse1) (<= (select .cse2 .cse3) 1)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1136 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (v_ArrVal_1139 Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1136) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1139) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| .cse4))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1139 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| .cse1) (< (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1139)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647))) (= .cse6 (store .cse7 .cse0 0)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1139 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| .cse4) (< (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1139)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647)))))))) is different from false [2022-12-13 21:57:30,872 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-12-13 21:57:33,274 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-12-13 21:57:43,807 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1136 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (v_ArrVal_1139 Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1136) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1139) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| (+ 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|) (exists ((v_ArrVal_1139 Int)) (= .cse0 (store .cse1 0 v_ArrVal_1139))) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1138 Int) (v_ArrVal_1139 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1138)))) (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_1139))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1138 Int)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store .cse1 |c_~#cache~0.offset| v_ArrVal_1138))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2022-12-13 21:58:05,571 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse4 ((as const (Array Int Int)) 0))) (let ((.cse3 (@diff .cse2 .cse4))) (let ((.cse5 (store .cse2 .cse3 0))) (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse0 (@diff .cse5 .cse4))) (and (or (<= (+ .cse0 28) .cse1) (<= (select .cse2 .cse0) 1)) (or (<= (+ 28 .cse3) .cse1) (<= (select .cse2 .cse3) 1)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1136 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (v_ArrVal_1139 Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1136) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1139) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| (+ 28 |c_~#cache~0.offset|)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1139 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| .cse1) (< (select (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_1139)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647))) (= .cse4 (store .cse5 .cse0 0))))))) is different from false [2022-12-13 21:58:10,044 INFO L130 PetriNetUnfolder]: 3382/6944 cut-off events. [2022-12-13 21:58:10,044 INFO L131 PetriNetUnfolder]: For 302383/302383 co-relation queries the response was YES. [2022-12-13 21:58:10,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74406 conditions, 6944 events. 3382/6944 cut-off events. For 302383/302383 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 52693 event pairs, 609 based on Foata normal form. 64/7008 useless extension candidates. Maximal degree in co-relation 74219. Up to 4896 conditions per place. [2022-12-13 21:58:10,127 INFO L137 encePairwiseOnDemand]: 198/214 looper letters, 905 selfloop transitions, 861 changer transitions 0/1766 dead transitions. [2022-12-13 21:58:10,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 1766 transitions, 38204 flow [2022-12-13 21:58:10,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-12-13 21:58:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2022-12-13 21:58:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 5715 transitions. [2022-12-13 21:58:10,134 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.31418361737218253 [2022-12-13 21:58:10,134 INFO L72 ComplementDD]: Start complementDD. Operand 85 states and 5715 transitions. [2022-12-13 21:58:10,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 5715 transitions. [2022-12-13 21:58:10,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:58:10,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 85 states and 5715 transitions. [2022-12-13 21:58:10,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 86 states, 85 states have (on average 67.23529411764706) internal successors, (5715), 85 states have internal predecessors, (5715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:58:10,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 86 states, 86 states have (on average 214.0) internal successors, (18404), 86 states have internal predecessors, (18404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:58:10,150 INFO L81 ComplementDD]: Finished complementDD. Result has 86 states, 86 states have (on average 214.0) internal successors, (18404), 86 states have internal predecessors, (18404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:58:10,150 INFO L175 Difference]: Start difference. First operand has 483 places, 1219 transitions, 23634 flow. Second operand 85 states and 5715 transitions. [2022-12-13 21:58:10,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 1766 transitions, 38204 flow [2022-12-13 21:58:12,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 1766 transitions, 38121 flow, removed 15 selfloop flow, removed 1 redundant places. [2022-12-13 21:58:12,061 INFO L231 Difference]: Finished difference. Result has 603 places, 1597 transitions, 35040 flow [2022-12-13 21:58:12,062 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=23572, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=525, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=35040, PETRI_PLACES=603, PETRI_TRANSITIONS=1597} [2022-12-13 21:58:12,062 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 571 predicate places. [2022-12-13 21:58:12,062 INFO L495 AbstractCegarLoop]: Abstraction has has 603 places, 1597 transitions, 35040 flow [2022-12-13 21:58:12,062 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-12-13 21:58:12,062 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:58:12,062 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:58:12,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 21:58:12,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 21:58:12,264 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 21:58:12,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:58:12,265 INFO L85 PathProgramCache]: Analyzing trace with hash 617960130, now seen corresponding path program 2 times [2022-12-13 21:58:12,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:58:12,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639636094] [2022-12-13 21:58:12,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:58:12,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:58:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:58:12,790 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:58:12,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:58:12,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639636094] [2022-12-13 21:58:12,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639636094] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:58:12,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125563549] [2022-12-13 21:58:12,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 21:58:12,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:58:12,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:58:12,792 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:58:12,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 21:58:12,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 21:58:12,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:58:12,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 21:58:12,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:58:12,920 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-12-13 21:58:13,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:58:13,019 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-12-13 21:58:13,151 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-12-13 21:58:13,391 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-12-13 21:58:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:58:13,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:58:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:58:25,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125563549] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:58:25,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:58:25,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2022-12-13 21:58:25,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224545172] [2022-12-13 21:58:25,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:58:25,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 21:58:25,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:58:25,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 21:58:25,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=920, Unknown=8, NotChecked=0, Total=1122 [2022-12-13 21:58:27,565 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-12-13 21:58:29,598 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-12-13 21:58:31,629 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-12-13 21:58:33,677 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-12-13 21:58:35,842 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-12-13 21:58:38,036 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-12-13 21:58:40,087 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-12-13 21:58:42,198 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-12-13 21:58:44,358 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-12-13 21:58:46,405 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-12-13 21:58:48,609 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-12-13 21:58:50,772 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-12-13 21:58:52,790 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-12-13 21:58:54,807 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-12-13 21:58:57,626 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-12-13 21:58:59,116 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-12-13 21:59:01,257 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-12-13 21:59:02,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 21:59:04,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-12-13 21:59:06,534 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-12-13 21:59:08,593 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-12-13 21:59:10,731 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-12-13 21:59:13,377 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-12-13 21:59:14,313 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 214 [2022-12-13 21:59:14,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 1597 transitions, 35040 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-12-13 21:59:14,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:59:14,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 214 [2022-12-13 21:59:14,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:59:15,869 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (forall ((v_ArrVal_1216 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int) (v_ArrVal_1219 Int) (v_ArrVal_1218 Int)) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_1216) |c_~#cache~0.base|))) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_46|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ 28 |c_~#cache~0.offset|)) (< (select (store (store .cse0 |c_~#cache~0.offset| v_ArrVal_1218) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1219) |c_~#cache~0.offset|) 2147483647) (< (+ (select .cse0 |c_~#cache~0.offset|) 1) v_ArrVal_1218)))) (= |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|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1218 Int)) (and (<= v_ArrVal_1218 (+ (select .cse1 |c_~#cache~0.offset|) 1)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store .cse1 |c_~#cache~0.offset| v_ArrVal_1218)))) (= .cse1 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (<= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) is different from false [2022-12-13 21:59:17,185 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1216 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int) (v_ArrVal_1219 Int) (v_ArrVal_1218 Int)) (let ((.cse1 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_1216) |c_~#cache~0.base|))) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_46|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| .cse0) (< (select (store (store .cse1 |c_~#cache~0.offset| v_ArrVal_1218) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1219) |c_~#cache~0.offset|) 2147483647) (< (+ (select .cse1 |c_~#cache~0.offset|) 1) v_ArrVal_1218)))) (= |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) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1219 Int) (v_ArrVal_1218 Int)) (or (not (<= v_ArrVal_1218 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 1))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (* |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_1218)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1219) |c_~#cache~0.offset|) 2147483647))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (<= .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1218 Int)) (let ((.cse2 ((as const (Array Int Int)) 0))) (and (<= v_ArrVal_1218 (+ (select .cse2 |c_~#cache~0.offset|) 1)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store .cse2 |c_~#cache~0.offset| v_ArrVal_1218))))))) is different from false [2022-12-13 21:59:21,905 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-12-13 21:59:27,773 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-12-13 21:59:29,806 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-12-13 21:59:31,809 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-12-13 21:59:34,315 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-12-13 21:59:47,035 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-12-13 21:59:49,130 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-12-13 21:59:58,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-12-13 22:00:00,618 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-12-13 22:00:11,194 INFO L130 PetriNetUnfolder]: 3985/8158 cut-off events. [2022-12-13 22:00:11,194 INFO L131 PetriNetUnfolder]: For 476579/476579 co-relation queries the response was YES. [2022-12-13 22:00:11,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99018 conditions, 8158 events. 3985/8158 cut-off events. For 476579/476579 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 64064 event pairs, 701 based on Foata normal form. 75/8233 useless extension candidates. Maximal degree in co-relation 98792. Up to 4870 conditions per place. [2022-12-13 22:00:11,357 INFO L137 encePairwiseOnDemand]: 201/214 looper letters, 908 selfloop transitions, 1253 changer transitions 0/2161 dead transitions. [2022-12-13 22:00:11,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 665 places, 2161 transitions, 53000 flow [2022-12-13 22:00:11,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-12-13 22:00:11,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2022-12-13 22:00:11,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 4271 transitions. [2022-12-13 22:00:11,362 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.31679276071799434 [2022-12-13 22:00:11,362 INFO L72 ComplementDD]: Start complementDD. Operand 63 states and 4271 transitions. [2022-12-13 22:00:11,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 4271 transitions. [2022-12-13 22:00:11,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:00:11,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 63 states and 4271 transitions. [2022-12-13 22:00:11,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 64 states, 63 states have (on average 67.7936507936508) internal successors, (4271), 63 states have internal predecessors, (4271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:00:11,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 64 states, 64 states have (on average 214.0) internal successors, (13696), 64 states have internal predecessors, (13696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:00:11,375 INFO L81 ComplementDD]: Finished complementDD. Result has 64 states, 64 states have (on average 214.0) internal successors, (13696), 64 states have internal predecessors, (13696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:00:11,375 INFO L175 Difference]: Start difference. First operand has 603 places, 1597 transitions, 35040 flow. Second operand 63 states and 4271 transitions. [2022-12-13 22:00:11,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 665 places, 2161 transitions, 53000 flow [2022-12-13 22:00:15,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 2161 transitions, 51280 flow, removed 782 selfloop flow, removed 17 redundant places. [2022-12-13 22:00:15,280 INFO L231 Difference]: Finished difference. Result has 677 places, 1953 transitions, 46981 flow [2022-12-13 22:00:15,281 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=33616, PETRI_DIFFERENCE_MINUEND_PLACES=586, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=921, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=46981, PETRI_PLACES=677, PETRI_TRANSITIONS=1953} [2022-12-13 22:00:15,281 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 645 predicate places. [2022-12-13 22:00:15,281 INFO L495 AbstractCegarLoop]: Abstraction has has 677 places, 1953 transitions, 46981 flow [2022-12-13 22:00:15,282 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-12-13 22:00:15,282 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:00:15,282 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:00:15,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 22:00:15,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 22:00:15,483 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-12-13 22:00:15,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:00:15,484 INFO L85 PathProgramCache]: Analyzing trace with hash -844107470, now seen corresponding path program 4 times [2022-12-13 22:00:15,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:00:15,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639656188] [2022-12-13 22:00:15,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:00:15,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:00:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:00:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 22:00:15,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:00:15,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639656188] [2022-12-13 22:00:15,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639656188] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:00:15,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278741594] [2022-12-13 22:00:15,887 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 22:00:15,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:00:15,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:00:15,887 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:00:15,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 22:00:15,964 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 22:00:15,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:00:15,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 22:00:15,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:00:15,974 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-12-13 22:00:16,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:00:16,094 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-12-13 22:00:16,298 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-12-13 22:00:16,409 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-12-13 22:00:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 22:00:16,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:00:22,521 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 22:00:22,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278741594] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:00:22,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:00:22,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2022-12-13 22:00:22,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64787154] [2022-12-13 22:00:22,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:00:22,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 22:00:22,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:00:22,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 22:00:22,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=740, Unknown=10, NotChecked=0, Total=930 [2022-12-13 22:00:24,929 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-12-13 22:00:25,447 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 214 [2022-12-13 22:00:25,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 677 places, 1953 transitions, 46981 flow. Second operand has 31 states, 31 states have (on average 70.45161290322581) internal successors, (2184), 31 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:00:25,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:00:25,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 214 [2022-12-13 22:00:25,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:00:26,436 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (v_ArrVal_1299 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_1296 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_1296) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1299) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| .cse0) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_47|)))) (forall ((v_ArrVal_1299 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int)) (or (< (select (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_1299)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| .cse0))))) is different from false [2022-12-13 22:00:31,841 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 (+ 28 |c_~#cache~0.offset|))) (and (exists ((v_ArrVal_1297 Int)) (= .cse0 (store ((as const (Array Int Int)) 0) |c_~#cache~0.offset| v_ArrVal_1297))) (forall ((v_ArrVal_1299 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| .cse1) (< (select (store .cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1299) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647))) (<= 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) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1297 Int) (v_ArrVal_1299 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int)) (or (< (select (select (let ((.cse2 (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_1297)))) (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_1299))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (v_ArrVal_1299 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_1296 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_1296) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1299) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| .cse1) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_47|)))))) is different from false [2022-12-13 22:00:39,436 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (= |c_ULTIMATE.start_main_~i~2#1| 0) (forall ((v_ArrVal_1299 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| .cse0) (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1299) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (v_ArrVal_1299 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_1296 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_1296) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1299) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| .cse0) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_47|)))))) is different from false [2022-12-13 22:00:44,859 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (v_ArrVal_1299 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_1296 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_1296) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1299) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| (+ 28 |c_~#cache~0.offset|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_47|))))) is different from false [2022-12-13 22:00:59,777 INFO L130 PetriNetUnfolder]: 4437/9133 cut-off events. [2022-12-13 22:00:59,777 INFO L131 PetriNetUnfolder]: For 666041/666041 co-relation queries the response was YES. [2022-12-13 22:00:59,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119227 conditions, 9133 events. 4437/9133 cut-off events. For 666041/666041 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 73849 event pairs, 687 based on Foata normal form. 97/9230 useless extension candidates. Maximal degree in co-relation 118976. Up to 6007 conditions per place. [2022-12-13 22:00:59,940 INFO L137 encePairwiseOnDemand]: 197/214 looper letters, 1175 selfloop transitions, 1288 changer transitions 0/2463 dead transitions. [2022-12-13 22:00:59,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 743 places, 2463 transitions, 64081 flow [2022-12-13 22:00:59,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-12-13 22:00:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2022-12-13 22:00:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 4955 transitions. [2022-12-13 22:00:59,948 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3455851583205468 [2022-12-13 22:00:59,949 INFO L72 ComplementDD]: Start complementDD. Operand 67 states and 4955 transitions. [2022-12-13 22:00:59,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 4955 transitions. [2022-12-13 22:00:59,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:00:59,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 67 states and 4955 transitions. [2022-12-13 22:00:59,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 68 states, 67 states have (on average 73.95522388059702) internal successors, (4955), 67 states have internal predecessors, (4955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:00:59,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 68 states, 68 states have (on average 214.0) internal successors, (14552), 68 states have internal predecessors, (14552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:00:59,966 INFO L81 ComplementDD]: Finished complementDD. Result has 68 states, 68 states have (on average 214.0) internal successors, (14552), 68 states have internal predecessors, (14552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:00:59,966 INFO L175 Difference]: Start difference. First operand has 677 places, 1953 transitions, 46981 flow. Second operand 67 states and 4955 transitions. [2022-12-13 22:00:59,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 743 places, 2463 transitions, 64081 flow [2022-12-13 22:01:05,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 718 places, 2463 transitions, 62552 flow, removed 583 selfloop flow, removed 25 redundant places. [2022-12-13 22:01:05,900 INFO L231 Difference]: Finished difference. Result has 751 places, 2275 transitions, 58128 flow [2022-12-13 22:01:05,901 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=45826, PETRI_DIFFERENCE_MINUEND_PLACES=652, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1951, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=998, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=894, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=58128, PETRI_PLACES=751, PETRI_TRANSITIONS=2275} [2022-12-13 22:01:05,901 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 719 predicate places. [2022-12-13 22:01:05,901 INFO L495 AbstractCegarLoop]: Abstraction has has 751 places, 2275 transitions, 58128 flow [2022-12-13 22:01:05,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 70.45161290322581) internal successors, (2184), 31 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:01:05,902 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:01:05,902 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:01:05,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 22:01:06,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:01:06,103 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 22:01:06,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:01:06,104 INFO L85 PathProgramCache]: Analyzing trace with hash 40733364, now seen corresponding path program 5 times [2022-12-13 22:01:06,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:01:06,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897422970] [2022-12-13 22:01:06,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:01:06,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:01:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:01:06,544 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 22:01:06,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:01:06,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897422970] [2022-12-13 22:01:06,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897422970] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:01:06,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471809629] [2022-12-13 22:01:06,545 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 22:01:06,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:01:06,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:01:06,546 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:01:06,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 22:01:06,731 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-12-13 22:01:06,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:01:06,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 22:01:06,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:01:06,809 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 13 treesize of output 9 [2022-12-13 22:01:06,834 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-13 22:01:06,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:01:06,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471809629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:01:06,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 22:01:06,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 14 [2022-12-13 22:01:06,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438903756] [2022-12-13 22:01:06,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:01:06,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:01:06,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:01:06,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:01:06,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-12-13 22:01:06,941 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 214 [2022-12-13 22:01:06,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 751 places, 2275 transitions, 58128 flow. Second operand has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:01:06,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:01:06,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 214 [2022-12-13 22:01:06,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:01:14,685 INFO L130 PetriNetUnfolder]: 4301/8874 cut-off events. [2022-12-13 22:01:14,686 INFO L131 PetriNetUnfolder]: For 725193/725193 co-relation queries the response was YES. [2022-12-13 22:01:14,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124485 conditions, 8874 events. 4301/8874 cut-off events. For 725193/725193 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 71824 event pairs, 920 based on Foata normal form. 6/8880 useless extension candidates. Maximal degree in co-relation 124219. Up to 6232 conditions per place. [2022-12-13 22:01:14,834 INFO L137 encePairwiseOnDemand]: 207/214 looper letters, 2030 selfloop transitions, 144 changer transitions 0/2174 dead transitions. [2022-12-13 22:01:14,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 734 places, 2174 transitions, 59860 flow [2022-12-13 22:01:14,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 22:01:14,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 22:01:14,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 712 transitions. [2022-12-13 22:01:14,836 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4753004005340454 [2022-12-13 22:01:14,836 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 712 transitions. [2022-12-13 22:01:14,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 712 transitions. [2022-12-13 22:01:14,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:01:14,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 712 transitions. [2022-12-13 22:01:14,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.71428571428571) internal successors, (712), 7 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:01:14,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:01:14,838 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:01:14,838 INFO L175 Difference]: Start difference. First operand has 751 places, 2275 transitions, 58128 flow. Second operand 7 states and 712 transitions. [2022-12-13 22:01:14,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 734 places, 2174 transitions, 59860 flow [2022-12-13 22:01:21,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 2174 transitions, 57888 flow, removed 868 selfloop flow, removed 33 redundant places. [2022-12-13 22:01:21,891 INFO L231 Difference]: Finished difference. Result has 703 places, 2026 transitions, 49515 flow [2022-12-13 22:01:21,892 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=48927, PETRI_DIFFERENCE_MINUEND_PLACES=695, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2015, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1876, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=49515, PETRI_PLACES=703, PETRI_TRANSITIONS=2026} [2022-12-13 22:01:21,892 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 671 predicate places. [2022-12-13 22:01:21,892 INFO L495 AbstractCegarLoop]: Abstraction has has 703 places, 2026 transitions, 49515 flow [2022-12-13 22:01:21,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:01:21,892 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:01:21,892 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:01:21,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 22:01:22,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-13 22:01:22,094 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 22:01:22,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:01:22,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1384644310, now seen corresponding path program 6 times [2022-12-13 22:01:22,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:01:22,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557265690] [2022-12-13 22:01:22,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:01:22,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:01:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:01:22,614 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 22:01:22,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:01:22,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557265690] [2022-12-13 22:01:22,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557265690] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:01:22,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347951004] [2022-12-13 22:01:22,615 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 22:01:22,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:01:22,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:01:22,616 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:01:22,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 22:01:22,710 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 22:01:22,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:01:22,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 22:01:22,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:01:22,719 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-12-13 22:01:22,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:01:22,828 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-12-13 22:01:22,999 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-12-13 22:01:23,147 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-12-13 22:01:23,237 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 22:01:23,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:01:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 22:01:28,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347951004] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:01:28,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:01:28,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-13 22:01:28,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122341592] [2022-12-13 22:01:28,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:01:28,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 22:01:28,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:01:28,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 22:01:28,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=801, Unknown=3, NotChecked=0, Total=992 [2022-12-13 22:01:30,319 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-12-13 22:01:32,887 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 214 [2022-12-13 22:01:32,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 2026 transitions, 49515 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-12-13 22:01:32,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:01:32,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 214 [2022-12-13 22:01:32,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:01:36,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:01:39,312 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-12-13 22:01:46,252 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-12-13 22:01:48,943 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-12-13 22:01:50,709 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((v_ArrVal_1453 Int) (v_ArrVal_1456 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| .cse0) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1453)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1456) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52|) 2147483647))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (forall ((v_ArrVal_1453 Int) (v_ArrVal_1456 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| .cse0) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1453)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1456) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52|) 2147483647))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (exists ((v_ArrVal_1453 Int)) (= (store ((as const (Array Int Int)) 0) |c_~#cache~0.offset| v_ArrVal_1453) (select |c_#memory_int| |c_~#cache~0.base|))) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1456 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_48|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1452) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1456) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52|) 2147483647))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|))) is different from false [2022-12-13 22:01:52,390 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse2 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_1453 Int) (v_ArrVal_1456 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| .cse0) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1453)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1456) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52|) 2147483647))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (forall ((v_ArrVal_1453 Int) (v_ArrVal_1456 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| .cse0) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1453)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1456) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52|) 2147483647))) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1456 Int)) (= (store .cse2 0 v_ArrVal_1456) .cse1)) (exists ((v_ArrVal_1456 Int)) (= (store .cse2 |c_~#cache~0.offset| v_ArrVal_1456) (select |c_#memory_int| |c_~#cache~0.base|))) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1456 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_48|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1452) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1456) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52|) 2147483647))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2022-12-13 22:01:53,024 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (.cse2 ((as const (Array Int Int)) 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_1453 Int) (v_ArrVal_1456 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| .cse0) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1453)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1456) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52|) 2147483647))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (forall ((v_ArrVal_1453 Int) (v_ArrVal_1456 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| .cse0) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1453)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1456) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52|) 2147483647))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (exists ((v_ArrVal_1453 Int)) (= (store .cse2 |c_~#cache~0.offset| v_ArrVal_1453) (select |c_#memory_int| |c_~#cache~0.base|))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1456 Int)) (= (store .cse2 0 v_ArrVal_1456) .cse1)) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1456 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_48|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1452) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1456) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52|) 2147483647))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2022-12-13 22:02:13,233 INFO L130 PetriNetUnfolder]: 5297/10869 cut-off events. [2022-12-13 22:02:13,233 INFO L131 PetriNetUnfolder]: For 897459/897459 co-relation queries the response was YES. [2022-12-13 22:02:13,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147436 conditions, 10869 events. 5297/10869 cut-off events. For 897459/897459 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 90858 event pairs, 774 based on Foata normal form. 144/11013 useless extension candidates. Maximal degree in co-relation 147184. Up to 6508 conditions per place. [2022-12-13 22:02:13,446 INFO L137 encePairwiseOnDemand]: 198/214 looper letters, 1342 selfloop transitions, 1293 changer transitions 0/2635 dead transitions. [2022-12-13 22:02:13,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 764 places, 2635 transitions, 70115 flow [2022-12-13 22:02:13,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-12-13 22:02:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2022-12-13 22:02:13,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 4717 transitions. [2022-12-13 22:02:13,451 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.35551703346397345 [2022-12-13 22:02:13,451 INFO L72 ComplementDD]: Start complementDD. Operand 62 states and 4717 transitions. [2022-12-13 22:02:13,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 4717 transitions. [2022-12-13 22:02:13,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:02:13,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 62 states and 4717 transitions. [2022-12-13 22:02:13,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 63 states, 62 states have (on average 76.08064516129032) internal successors, (4717), 62 states have internal predecessors, (4717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:02:13,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 63 states, 63 states have (on average 214.0) internal successors, (13482), 63 states have internal predecessors, (13482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:02:13,462 INFO L81 ComplementDD]: Finished complementDD. Result has 63 states, 63 states have (on average 214.0) internal successors, (13482), 63 states have internal predecessors, (13482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:02:13,462 INFO L175 Difference]: Start difference. First operand has 703 places, 2026 transitions, 49515 flow. Second operand 62 states and 4717 transitions. [2022-12-13 22:02:13,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 764 places, 2635 transitions, 70115 flow [2022-12-13 22:02:20,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 759 places, 2635 transitions, 69924 flow, removed 34 selfloop flow, removed 5 redundant places. [2022-12-13 22:02:20,979 INFO L231 Difference]: Finished difference. Result has 795 places, 2416 transitions, 63135 flow [2022-12-13 22:02:20,980 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=49370, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2026, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=974, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1028, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=63135, PETRI_PLACES=795, PETRI_TRANSITIONS=2416} [2022-12-13 22:02:20,980 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 763 predicate places. [2022-12-13 22:02:20,981 INFO L495 AbstractCegarLoop]: Abstraction has has 795 places, 2416 transitions, 63135 flow [2022-12-13 22:02:20,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-12-13 22:02:20,981 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:02:20,981 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:02:20,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 22:02:21,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:02:21,183 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 22:02:21,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:02:21,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1777316650, now seen corresponding path program 7 times [2022-12-13 22:02:21,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:02:21,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917263851] [2022-12-13 22:02:21,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:02:21,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:02:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:02:21,582 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 22:02:21,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:02:21,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917263851] [2022-12-13 22:02:21,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917263851] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:02:21,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239588618] [2022-12-13 22:02:21,583 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 22:02:21,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:02:21,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:02:21,584 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:02:21,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 22:02:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:02:21,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 22:02:21,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:02:21,675 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-12-13 22:02:21,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:02:21,783 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-12-13 22:02:21,906 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-12-13 22:02:22,066 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-12-13 22:02:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 22:02:22,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:02:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 22:02:24,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239588618] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:02:24,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:02:24,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 28 [2022-12-13 22:02:24,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996993145] [2022-12-13 22:02:24,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:02:24,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 22:02:24,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:02:24,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 22:02:24,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=702, Unknown=4, NotChecked=0, Total=870 [2022-12-13 22:02:26,098 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 214 [2022-12-13 22:02:26,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 795 places, 2416 transitions, 63135 flow. Second operand has 30 states, 30 states have (on average 70.5) internal successors, (2115), 30 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:02:26,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:02:26,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 214 [2022-12-13 22:02:26,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:02:27,256 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1534 Int) (v_ArrVal_1535 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1534)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1535) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647))) (exists ((v_ArrVal_1534 Int)) (= (store .cse1 |c_~#cache~0.offset| v_ArrVal_1534) (select |c_#memory_int| |c_~#cache~0.base|))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_49| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1535 Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_49| v_ArrVal_1532) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1535) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| (+ 28 |c_~#cache~0.offset|)))) (exists ((v_ArrVal_1534 Int)) (= .cse0 (store .cse1 0 v_ArrVal_1534))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2022-12-13 22:02:31,023 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1534 Int) (v_ArrVal_1535 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1534)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1535) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647))) (exists ((v_ArrVal_1534 Int)) (= (store .cse1 |c_~#cache~0.offset| v_ArrVal_1534) (select |c_#memory_int| |c_~#cache~0.base|))) (<= 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) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_49| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1535 Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_49| v_ArrVal_1532) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1535) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54|) 2147483647) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_54| (+ 28 |c_~#cache~0.offset|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (exists ((v_ArrVal_1534 Int)) (= .cse0 (store .cse1 0 v_ArrVal_1534))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2022-12-13 22:02:45,192 INFO L130 PetriNetUnfolder]: 5629/11591 cut-off events. [2022-12-13 22:02:45,192 INFO L131 PetriNetUnfolder]: For 1152676/1152676 co-relation queries the response was YES. [2022-12-13 22:02:45,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178762 conditions, 11591 events. 5629/11591 cut-off events. For 1152676/1152676 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 98352 event pairs, 922 based on Foata normal form. 53/11644 useless extension candidates. Maximal degree in co-relation 178476. Up to 7733 conditions per place. [2022-12-13 22:02:45,436 INFO L137 encePairwiseOnDemand]: 198/214 looper letters, 1444 selfloop transitions, 1325 changer transitions 0/2769 dead transitions. [2022-12-13 22:02:45,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 835 places, 2769 transitions, 78671 flow [2022-12-13 22:02:45,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-13 22:02:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-12-13 22:02:45,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 3082 transitions. [2022-12-13 22:02:45,445 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3512651014360611 [2022-12-13 22:02:45,445 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 3082 transitions. [2022-12-13 22:02:45,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 3082 transitions. [2022-12-13 22:02:45,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:02:45,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 3082 transitions. [2022-12-13 22:02:45,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 75.17073170731707) internal successors, (3082), 41 states have internal predecessors, (3082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:02:45,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 214.0) internal successors, (8988), 42 states have internal predecessors, (8988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:02:45,452 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 214.0) internal successors, (8988), 42 states have internal predecessors, (8988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:02:45,452 INFO L175 Difference]: Start difference. First operand has 795 places, 2416 transitions, 63135 flow. Second operand 41 states and 3082 transitions. [2022-12-13 22:02:45,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 835 places, 2769 transitions, 78671 flow [2022-12-13 22:02:57,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 821 places, 2769 transitions, 75528 flow, removed 1447 selfloop flow, removed 14 redundant places. [2022-12-13 22:02:57,575 INFO L231 Difference]: Finished difference. Result has 846 places, 2619 transitions, 70419 flow [2022-12-13 22:02:57,576 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=60689, PETRI_DIFFERENCE_MINUEND_PLACES=781, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=70419, PETRI_PLACES=846, PETRI_TRANSITIONS=2619} [2022-12-13 22:02:57,577 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 814 predicate places. [2022-12-13 22:02:57,577 INFO L495 AbstractCegarLoop]: Abstraction has has 846 places, 2619 transitions, 70419 flow [2022-12-13 22:02:57,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 70.5) internal successors, (2115), 30 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:02:57,577 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:02:57,577 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:02:57,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 22:02:57,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:02:57,778 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-12-13 22:02:57,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:02:57,779 INFO L85 PathProgramCache]: Analyzing trace with hash 19430812, now seen corresponding path program 8 times [2022-12-13 22:02:57,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:02:57,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991803203] [2022-12-13 22:02:57,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:02:57,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:02:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:02:58,142 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 22:02:58,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:02:58,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991803203] [2022-12-13 22:02:58,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991803203] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:02:58,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58093471] [2022-12-13 22:02:58,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 22:02:58,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:02:58,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:02:58,144 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:02:58,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd42562b-e257-49da-a920-2867b23efd72/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 22:02:58,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 22:02:58,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:02:58,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 22:02:58,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:02:58,259 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-12-13 22:02:58,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:02:58,364 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-12-13 22:02:58,515 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-12-13 22:02:58,715 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-12-13 22:02:58,748 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 22:02:58,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:02:59,279 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1612 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_50| Int) (v_ArrVal_1615 Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_50|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_50| v_ArrVal_1612) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1615) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_56| (+ 28 |c_~#cache~0.offset|)))) is different from false [2022-12-13 22:02:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 22:02:59,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58093471] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:02:59,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:02:59,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2022-12-13 22:02:59,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900981129] [2022-12-13 22:02:59,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:02:59,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 22:02:59,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:02:59,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 22:02:59,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=725, Unknown=1, NotChecked=56, Total=930 [2022-12-13 22:02:59,476 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 214 [2022-12-13 22:02:59,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 846 places, 2619 transitions, 70419 flow. Second operand has 31 states, 31 states have (on average 70.45161290322581) internal successors, (2184), 31 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:02:59,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:02:59,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 214 [2022-12-13 22:02:59,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand