./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-14.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aec2cd5ae54508e6b09d164bd3878415d3b0f8002b89da4b1a1ed3f9475eb68f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:11:55,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:11:55,919 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:11:55,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:11:55,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:11:55,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:11:55,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:11:55,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:11:55,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:11:55,949 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:11:55,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:11:55,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:11:55,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:11:55,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:11:55,952 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:11:55,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:11:55,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:11:55,953 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:11:55,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:11:55,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:11:55,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:11:55,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:11:55,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:11:55,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:11:55,957 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:11:55,957 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:11:55,958 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:11:55,958 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:11:55,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:11:55,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:11:55,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:11:55,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:11:55,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:11:55,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:11:55,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:11:55,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:11:55,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:11:55,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:11:55,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:11:55,961 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:11:55,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:11:55,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:11:55,962 INFO L153 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_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/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_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aec2cd5ae54508e6b09d164bd3878415d3b0f8002b89da4b1a1ed3f9475eb68f [2023-11-29 01:11:56,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:11:56,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:11:56,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:11:56,186 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:11:56,186 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:11:56,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-14.i [2023-11-29 01:11:59,011 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:11:59,250 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:11:59,251 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-14.i [2023-11-29 01:11:59,265 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/data/1be40be57/78dbad5e67c6486b938fce04e709ef66/FLAG27bb4eaf0 [2023-11-29 01:11:59,278 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/data/1be40be57/78dbad5e67c6486b938fce04e709ef66 [2023-11-29 01:11:59,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:11:59,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:11:59,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:11:59,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:11:59,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:11:59,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:11:59" (1/1) ... [2023-11-29 01:11:59,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@233814d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:11:59, skipping insertion in model container [2023-11-29 01:11:59,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:11:59" (1/1) ... [2023-11-29 01:11:59,344 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:11:59,494 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-14.i[916,929] [2023-11-29 01:11:59,634 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:11:59,649 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:11:59,659 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-14.i[916,929] [2023-11-29 01:11:59,723 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:11:59,740 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:11:59,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:11:59 WrapperNode [2023-11-29 01:11:59,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:11:59,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:11:59,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:11:59,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:11:59,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:11:59" (1/1) ... [2023-11-29 01:11:59,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:11:59" (1/1) ... [2023-11-29 01:11:59,815 INFO L138 Inliner]: procedures = 26, calls = 66, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 430 [2023-11-29 01:11:59,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:11:59,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:11:59,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:11:59,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:11:59,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:11:59" (1/1) ... [2023-11-29 01:11:59,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:11:59" (1/1) ... [2023-11-29 01:11:59,832 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:11:59" (1/1) ... [2023-11-29 01:11:59,863 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 01:11:59,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:11:59" (1/1) ... [2023-11-29 01:11:59,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:11:59" (1/1) ... [2023-11-29 01:11:59,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:11:59" (1/1) ... [2023-11-29 01:11:59,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:11:59" (1/1) ... [2023-11-29 01:11:59,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:11:59" (1/1) ... [2023-11-29 01:11:59,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:11:59" (1/1) ... [2023-11-29 01:11:59,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:11:59,912 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:11:59,912 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:11:59,912 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:11:59,913 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:11:59" (1/1) ... [2023-11-29 01:11:59,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:11:59,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:59,970 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:59,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:11:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:11:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 01:11:59,997 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 01:11:59,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:11:59,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:11:59,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:12:00,090 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:12:00,093 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:12:00,712 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:12:00,745 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:12:00,745 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 01:12:00,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:12:00 BoogieIcfgContainer [2023-11-29 01:12:00,746 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:12:00,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:12:00,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:12:00,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:12:00,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:11:59" (1/3) ... [2023-11-29 01:12:00,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f232d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:12:00, skipping insertion in model container [2023-11-29 01:12:00,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:11:59" (2/3) ... [2023-11-29 01:12:00,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f232d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:12:00, skipping insertion in model container [2023-11-29 01:12:00,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:12:00" (3/3) ... [2023-11-29 01:12:00,754 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-14.i [2023-11-29 01:12:00,774 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:12:00,774 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:12:00,829 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:12:00,836 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=LoopHeads, 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;@70f5ae53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:12:00,836 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:12:00,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 112 states have (on average 1.5178571428571428) internal successors, (170), 113 states have internal predecessors, (170), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2023-11-29 01:12:00,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2023-11-29 01:12:00,878 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:12:00,879 INFO L195 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:12:00,879 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:12:00,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:12:00,886 INFO L85 PathProgramCache]: Analyzing trace with hash -446217125, now seen corresponding path program 1 times [2023-11-29 01:12:00,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:12:00,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650223813] [2023-11-29 01:12:00,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:00,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:12:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:01,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:12:01,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650223813] [2023-11-29 01:12:01,168 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-11-29 01:12:01,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354647350] [2023-11-29 01:12:01,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:01,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:12:01,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:12:01,179 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:12:01,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 01:12:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:01,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 01:12:01,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:12:01,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 5408 trivial. 0 not checked. [2023-11-29 01:12:01,535 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:12:01,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354647350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:12:01,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:12:01,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:12:01,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576514392] [2023-11-29 01:12:01,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:12:01,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 01:12:01,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:12:01,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 01:12:01,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:12:01,573 INFO L87 Difference]: Start difference. First operand has 168 states, 112 states have (on average 1.5178571428571428) internal successors, (170), 113 states have internal predecessors, (170), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) Second operand has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 2 states have call successors, (53) [2023-11-29 01:12:01,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:12:01,643 INFO L93 Difference]: Finished difference Result 333 states and 603 transitions. [2023-11-29 01:12:01,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 01:12:01,645 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 2 states have call successors, (53) Word has length 339 [2023-11-29 01:12:01,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:12:01,654 INFO L225 Difference]: With dead ends: 333 [2023-11-29 01:12:01,654 INFO L226 Difference]: Without dead ends: 166 [2023-11-29 01:12:01,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:12:01,663 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:12:01,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:12:01,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-11-29 01:12:01,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2023-11-29 01:12:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 111 states have (on average 1.4684684684684686) internal successors, (163), 111 states have internal predecessors, (163), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2023-11-29 01:12:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 269 transitions. [2023-11-29 01:12:01,721 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 269 transitions. Word has length 339 [2023-11-29 01:12:01,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:12:01,722 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 269 transitions. [2023-11-29 01:12:01,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 2 states have call successors, (53) [2023-11-29 01:12:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 269 transitions. [2023-11-29 01:12:01,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2023-11-29 01:12:01,732 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:12:01,733 INFO L195 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:12:01,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:12:01,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-29 01:12:01,934 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:12:01,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:12:01,935 INFO L85 PathProgramCache]: Analyzing trace with hash 514694229, now seen corresponding path program 1 times [2023-11-29 01:12:01,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:12:01,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171905513] [2023-11-29 01:12:01,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:01,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:12:02,017 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:12:02,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [945479290] [2023-11-29 01:12:02,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:02,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:12:02,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:12:02,020 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:12:02,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 01:12:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:02,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:12:02,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:12:02,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2023-11-29 01:12:02,354 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:12:02,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:12:02,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171905513] [2023-11-29 01:12:02,355 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:12:02,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945479290] [2023-11-29 01:12:02,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945479290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:12:02,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:12:02,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:12:02,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817836408] [2023-11-29 01:12:02,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:12:02,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:12:02,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:12:02,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:12:02,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:12:02,360 INFO L87 Difference]: Start difference. First operand 166 states and 269 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2023-11-29 01:12:02,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:12:02,479 INFO L93 Difference]: Finished difference Result 486 states and 787 transitions. [2023-11-29 01:12:02,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:12:02,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 339 [2023-11-29 01:12:02,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:12:02,487 INFO L225 Difference]: With dead ends: 486 [2023-11-29 01:12:02,487 INFO L226 Difference]: Without dead ends: 321 [2023-11-29 01:12:02,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:12:02,490 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 247 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:12:02,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 688 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:12:02,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-11-29 01:12:02,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 174. [2023-11-29 01:12:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 119 states have (on average 1.4705882352941178) internal successors, (175), 119 states have internal predecessors, (175), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2023-11-29 01:12:02,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 281 transitions. [2023-11-29 01:12:02,529 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 281 transitions. Word has length 339 [2023-11-29 01:12:02,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:12:02,532 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 281 transitions. [2023-11-29 01:12:02,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2023-11-29 01:12:02,533 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 281 transitions. [2023-11-29 01:12:02,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2023-11-29 01:12:02,538 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:12:02,538 INFO L195 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:12:02,545 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 01:12:02,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:12:02,739 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:12:02,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:12:02,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1434343207, now seen corresponding path program 1 times [2023-11-29 01:12:02,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:12:02,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392162096] [2023-11-29 01:12:02,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:02,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:12:02,818 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:12:02,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [822471355] [2023-11-29 01:12:02,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:02,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:12:02,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:12:02,821 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:12:02,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 01:12:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:03,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:12:03,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:12:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2023-11-29 01:12:03,137 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:12:03,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:12:03,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392162096] [2023-11-29 01:12:03,137 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:12:03,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822471355] [2023-11-29 01:12:03,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822471355] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:12:03,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:12:03,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:12:03,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629152014] [2023-11-29 01:12:03,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:12:03,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:12:03,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:12:03,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:12:03,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:12:03,141 INFO L87 Difference]: Start difference. First operand 174 states and 281 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2023-11-29 01:12:03,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:12:03,412 INFO L93 Difference]: Finished difference Result 517 states and 836 transitions. [2023-11-29 01:12:03,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:12:03,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 339 [2023-11-29 01:12:03,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:12:03,418 INFO L225 Difference]: With dead ends: 517 [2023-11-29 01:12:03,418 INFO L226 Difference]: Without dead ends: 344 [2023-11-29 01:12:03,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:12:03,421 INFO L413 NwaCegarLoop]: 434 mSDtfsCounter, 322 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:12:03,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 820 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:12:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2023-11-29 01:12:03,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 174. [2023-11-29 01:12:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 119 states have (on average 1.4621848739495797) internal successors, (174), 119 states have internal predecessors, (174), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2023-11-29 01:12:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 280 transitions. [2023-11-29 01:12:03,469 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 280 transitions. Word has length 339 [2023-11-29 01:12:03,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:12:03,470 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 280 transitions. [2023-11-29 01:12:03,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2023-11-29 01:12:03,471 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 280 transitions. [2023-11-29 01:12:03,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2023-11-29 01:12:03,474 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:12:03,474 INFO L195 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:12:03,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 01:12:03,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:12:03,675 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:12:03,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:12:03,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1293794597, now seen corresponding path program 1 times [2023-11-29 01:12:03,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:12:03,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853501336] [2023-11-29 01:12:03,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:03,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:12:03,735 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:12:03,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [698760105] [2023-11-29 01:12:03,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:03,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:12:03,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:12:03,737 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:12:03,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 01:12:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:04,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 01:12:04,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:12:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2023-11-29 01:12:04,455 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:12:04,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:12:04,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853501336] [2023-11-29 01:12:04,456 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:12:04,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698760105] [2023-11-29 01:12:04,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698760105] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:12:04,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:12:04,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:12:04,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644444616] [2023-11-29 01:12:04,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:12:04,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:12:04,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:12:04,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:12:04,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:12:04,459 INFO L87 Difference]: Start difference. First operand 174 states and 280 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2023-11-29 01:12:04,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:12:04,712 INFO L93 Difference]: Finished difference Result 521 states and 839 transitions. [2023-11-29 01:12:04,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:12:04,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 339 [2023-11-29 01:12:04,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:12:04,716 INFO L225 Difference]: With dead ends: 521 [2023-11-29 01:12:04,716 INFO L226 Difference]: Without dead ends: 348 [2023-11-29 01:12:04,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:12:04,718 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 188 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:12:04,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 776 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:12:04,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-11-29 01:12:04,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 327. [2023-11-29 01:12:04,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 218 states have (on average 1.4587155963302751) internal successors, (318), 218 states have internal predecessors, (318), 106 states have call successors, (106), 2 states have call predecessors, (106), 2 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2023-11-29 01:12:04,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 530 transitions. [2023-11-29 01:12:04,759 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 530 transitions. Word has length 339 [2023-11-29 01:12:04,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:12:04,760 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 530 transitions. [2023-11-29 01:12:04,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2023-11-29 01:12:04,761 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 530 transitions. [2023-11-29 01:12:04,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2023-11-29 01:12:04,764 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:12:04,764 INFO L195 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:12:04,770 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 01:12:04,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:12:04,967 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:12:04,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:12:04,967 INFO L85 PathProgramCache]: Analyzing trace with hash 189973246, now seen corresponding path program 1 times [2023-11-29 01:12:04,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:12:04,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260591051] [2023-11-29 01:12:04,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:04,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:12:05,011 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:12:05,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [401601699] [2023-11-29 01:12:05,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:05,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:12:05,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:12:05,012 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:12:05,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 01:12:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:05,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 01:12:05,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:12:06,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 1256 proven. 30 refuted. 0 times theorem prover too weak. 4226 trivial. 0 not checked. [2023-11-29 01:12:06,012 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:12:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 276 proven. 33 refuted. 0 times theorem prover too weak. 5203 trivial. 0 not checked. [2023-11-29 01:12:06,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:12:06,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260591051] [2023-11-29 01:12:06,593 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:12:06,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401601699] [2023-11-29 01:12:06,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401601699] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:12:06,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:12:06,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-11-29 01:12:06,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957593328] [2023-11-29 01:12:06,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:12:06,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 01:12:06,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:12:06,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 01:12:06,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2023-11-29 01:12:06,597 INFO L87 Difference]: Start difference. First operand 327 states and 530 transitions. Second operand has 18 states, 18 states have (on average 7.888888888888889) internal successors, (142), 18 states have internal predecessors, (142), 6 states have call successors, (106), 4 states have call predecessors, (106), 7 states have return successors, (106), 6 states have call predecessors, (106), 6 states have call successors, (106) [2023-11-29 01:12:07,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:12:07,399 INFO L93 Difference]: Finished difference Result 570 states and 911 transitions. [2023-11-29 01:12:07,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 01:12:07,400 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.888888888888889) internal successors, (142), 18 states have internal predecessors, (142), 6 states have call successors, (106), 4 states have call predecessors, (106), 7 states have return successors, (106), 6 states have call predecessors, (106), 6 states have call successors, (106) Word has length 342 [2023-11-29 01:12:07,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:12:07,403 INFO L225 Difference]: With dead ends: 570 [2023-11-29 01:12:07,403 INFO L226 Difference]: Without dead ends: 335 [2023-11-29 01:12:07,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 667 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=597, Unknown=0, NotChecked=0, Total=870 [2023-11-29 01:12:07,406 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 454 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:12:07,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 611 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:12:07,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-11-29 01:12:07,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 174. [2023-11-29 01:12:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 53 states have call successors, (53), 3 states have call predecessors, (53), 3 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2023-11-29 01:12:07,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 269 transitions. [2023-11-29 01:12:07,437 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 269 transitions. Word has length 342 [2023-11-29 01:12:07,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:12:07,438 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 269 transitions. [2023-11-29 01:12:07,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.888888888888889) internal successors, (142), 18 states have internal predecessors, (142), 6 states have call successors, (106), 4 states have call predecessors, (106), 7 states have return successors, (106), 6 states have call predecessors, (106), 6 states have call successors, (106) [2023-11-29 01:12:07,439 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 269 transitions. [2023-11-29 01:12:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2023-11-29 01:12:07,441 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:12:07,442 INFO L195 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:12:07,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-29 01:12:07,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:12:07,643 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:12:07,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:12:07,643 INFO L85 PathProgramCache]: Analyzing trace with hash 884359394, now seen corresponding path program 1 times [2023-11-29 01:12:07,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:12:07,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734318422] [2023-11-29 01:12:07,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:07,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:12:07,695 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:12:07,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1981527508] [2023-11-29 01:12:07,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:07,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:12:07,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:12:07,697 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:12:07,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 01:12:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:08,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 01:12:08,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:12:09,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2023-11-29 01:12:09,103 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:12:09,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:12:09,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734318422] [2023-11-29 01:12:09,104 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:12:09,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981527508] [2023-11-29 01:12:09,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981527508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:12:09,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:12:09,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:12:09,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778776476] [2023-11-29 01:12:09,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:12:09,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:12:09,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:12:09,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:12:09,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:12:09,107 INFO L87 Difference]: Start difference. First operand 174 states and 269 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2023-11-29 01:12:09,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:12:09,396 INFO L93 Difference]: Finished difference Result 586 states and 908 transitions. [2023-11-29 01:12:09,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:12:09,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 343 [2023-11-29 01:12:09,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:12:09,400 INFO L225 Difference]: With dead ends: 586 [2023-11-29 01:12:09,401 INFO L226 Difference]: Without dead ends: 413 [2023-11-29 01:12:09,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:12:09,402 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 266 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:12:09,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 848 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:12:09,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2023-11-29 01:12:09,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 345. [2023-11-29 01:12:09,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 232 states have (on average 1.3922413793103448) internal successors, (323), 232 states have internal predecessors, (323), 106 states have call successors, (106), 6 states have call predecessors, (106), 6 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2023-11-29 01:12:09,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 535 transitions. [2023-11-29 01:12:09,449 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 535 transitions. Word has length 343 [2023-11-29 01:12:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:12:09,450 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 535 transitions. [2023-11-29 01:12:09,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2023-11-29 01:12:09,451 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 535 transitions. [2023-11-29 01:12:09,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2023-11-29 01:12:09,453 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:12:09,453 INFO L195 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:12:09,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 01:12:09,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:12:09,654 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:12:09,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:12:09,655 INFO L85 PathProgramCache]: Analyzing trace with hash -961007772, now seen corresponding path program 1 times [2023-11-29 01:12:09,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:12:09,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708166730] [2023-11-29 01:12:09,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:09,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:12:09,701 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:12:09,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1345496344] [2023-11-29 01:12:09,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:09,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:12:09,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:12:09,703 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:12:09,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_920a6d76-9f17-42c6-bc8e-724cc27f6a35/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 01:12:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:10,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-29 01:12:10,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:12:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 2521 proven. 96 refuted. 0 times theorem prover too weak. 2895 trivial. 0 not checked. [2023-11-29 01:12:31,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:13:41,794 WARN L293 SmtUtils]: Spent 5.27s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:15:12,453 WARN L293 SmtUtils]: Spent 6.71s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:16:09,741 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:16:54,528 WARN L293 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:17:06,259 WARN L293 SmtUtils]: Spent 5.96s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:17:57,308 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:19:24,124 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse33 (mod c_~var_1_1~0 4294967296)) (.cse107 (mod c_~var_1_16~0 65536)) (.cse32 (mod c_~var_1_4~0 4294967296))) (let ((.cse8 (mod (div .cse32 5) 4294967296)) (.cse35 (+ c_~var_1_12~0 c_~var_1_11~0)) (.cse34 (+ c_~var_1_13~0 c_~var_1_15~0)) (.cse6 (= .cse33 (mod (+ c_~var_1_4~0 (* 4294967295 .cse107)) 4294967296))) (.cse91 (+ 256 c_~var_1_8~0)) (.cse39 (mod (+ (* 255 c_~var_1_12~0) c_~var_1_10~0) 256))) (let ((.cse42 (mod (+ (* 255 c_~var_1_11~0) c_~var_1_10~0) 256)) (.cse41 (= .cse91 .cse39)) (.cse45 (mod (+ (* 255 c_~var_1_13~0) 241 c_~var_1_11~0) 256)) (.cse38 (= (mod c_~var_1_22~0 65536) c_~var_1_29~0)) (.cse60 (< .cse107 (+ .cse32 1))) (.cse61 (and (not .cse6) (= .cse32 .cse33))) (.cse53 (= .cse33 .cse107)) (.cse58 (< .cse32 .cse107)) (.cse4 (= (* 2 .cse107) .cse33)) (.cse36 (= c_~var_1_14~0 c_~var_1_15~0)) (.cse30 (< .cse35 .cse34)) (.cse31 (= (+ c_~var_1_13~0 c_~var_1_14~0 1) 0)) (.cse93 (mod c_~var_1_61~0 4294967296)) (.cse92 (mod c_~var_1_30~0 4294967296)) (.cse10 (+ .cse8 1)) (.cse11 (* c_~var_1_61~0 .cse107))) (let ((.cse70 (forall ((~var_1_6~0 Int)) (let ((.cse114 (div .cse11 ~var_1_6~0))) (or (< (mod .cse114 4294967296) .cse10) (< .cse8 (mod (+ .cse114 4294967295) 4294967296)) (< ~var_1_6~0 0))))) (.cse69 (forall ((~var_1_6~0 Int)) (let ((.cse113 (div .cse11 ~var_1_6~0))) (or (< (mod .cse113 4294967296) .cse10) (< .cse8 (mod (+ .cse113 4294967295) 4294967296)) (< 0 (+ ~var_1_6~0 1)))))) (.cse56 (forall ((~var_1_6~0 Int)) (let ((.cse112 (div .cse11 ~var_1_6~0))) (or (= (mod .cse11 ~var_1_6~0) 0) (< (mod .cse112 4294967296) .cse10) (< .cse8 (mod (+ .cse112 4294967295) 4294967296)) (< ~var_1_6~0 0))))) (.cse55 (forall ((~var_1_6~0 Int)) (let ((.cse111 (div .cse11 ~var_1_6~0))) (or (< (mod (+ .cse111 1) 4294967296) .cse10) (= (mod .cse11 ~var_1_6~0) 0) (< .cse8 (mod (+ .cse111 4294967295) 4294967296)) (< .cse8 (mod .cse111 4294967296)) (< ~var_1_6~0 0))))) (.cse63 (forall ((~var_1_6~0 Int)) (let ((.cse110 (div .cse11 ~var_1_6~0))) (or (< (mod (+ .cse110 1) 4294967296) .cse10) (= (mod .cse11 ~var_1_6~0) 0) (< .cse8 (mod (+ .cse110 4294967295) 4294967296)) (< .cse8 (mod .cse110 4294967296)) (< 0 (+ ~var_1_6~0 1)))))) (.cse59 (forall ((~var_1_6~0 Int)) (let ((.cse109 (div .cse11 ~var_1_6~0))) (or (= (mod .cse11 ~var_1_6~0) 0) (< (mod .cse109 4294967296) .cse10) (< .cse8 (mod (+ .cse109 4294967295) 4294967296)) (< 0 (+ ~var_1_6~0 1)))))) (.cse68 (forall ((~var_1_6~0 Int)) (let ((.cse108 (div .cse11 ~var_1_6~0))) (or (< (mod .cse108 4294967296) .cse10) (< .cse8 (mod (+ .cse108 4294967295) 4294967296)) (not (= (mod .cse11 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))))) (.cse2 (and (<= .cse107 .cse32) .cse6)) (.cse71 (forall ((~var_1_6~0 Int)) (let ((.cse106 (div .cse11 ~var_1_6~0))) (or (< (mod .cse106 4294967296) .cse10) (< .cse8 (mod (+ .cse106 4294967295) 4294967296)) (not (= (mod .cse11 ~var_1_6~0) 0)) (< ~var_1_6~0 0))))) (.cse29 (< .cse93 .cse92)) (.cse48 (or .cse30 .cse31)) (.cse47 (< .cse34 (+ c_~var_1_12~0 1 c_~var_1_11~0))) (.cse49 (not .cse36)) (.cse7 (forall ((~var_1_6~0 Int)) (let ((.cse105 (div .cse11 ~var_1_6~0))) (or (< (mod .cse105 4294967296) .cse10) (< (mod (+ .cse105 4294967295) 4294967296) .cse10) (< ~var_1_6~0 0))))) (.cse5 (forall ((~var_1_6~0 Int)) (let ((.cse104 (div .cse11 ~var_1_6~0))) (or (< (mod .cse104 4294967296) .cse10) (< (mod (+ .cse104 4294967295) 4294967296) .cse10) (< 0 (+ ~var_1_6~0 1)))))) (.cse13 (< .cse11 0)) (.cse18 (< 0 (+ .cse11 1))) (.cse23 (forall ((~var_1_6~0 Int)) (let ((.cse103 (div .cse11 ~var_1_6~0))) (or (= (mod .cse11 ~var_1_6~0) 0) (< (mod .cse103 4294967296) .cse10) (< .cse8 (mod (+ .cse103 1) 4294967296)) (< ~var_1_6~0 0))))) (.cse25 (forall ((~var_1_6~0 Int)) (let ((.cse102 (div .cse11 ~var_1_6~0))) (or (= (mod .cse11 ~var_1_6~0) 0) (< .cse8 (mod .cse102 4294967296)) (< (mod (+ .cse102 4294967295) 4294967296) .cse10) (< .cse8 (mod (+ .cse102 1) 4294967296)) (< ~var_1_6~0 0))))) (.cse24 (forall ((~var_1_6~0 Int)) (let ((.cse101 (div .cse11 ~var_1_6~0))) (or (= (mod .cse11 ~var_1_6~0) 0) (< (mod .cse101 4294967296) .cse10) (< 0 (+ ~var_1_6~0 1)) (< .cse8 (mod (+ .cse101 1) 4294967296)))))) (.cse26 (forall ((~var_1_6~0 Int)) (let ((.cse100 (div .cse11 ~var_1_6~0))) (or (= (mod .cse11 ~var_1_6~0) 0) (< .cse8 (mod .cse100 4294967296)) (< (mod (+ .cse100 4294967295) 4294967296) .cse10) (< 0 (+ ~var_1_6~0 1)) (< .cse8 (mod (+ .cse100 1) 4294967296)))))) (.cse19 (forall ((~var_1_6~0 Int)) (let ((.cse99 (div .cse11 ~var_1_6~0))) (or (< (mod (+ .cse99 1) 4294967296) .cse10) (= (mod .cse11 ~var_1_6~0) 0) (< .cse8 (mod .cse99 4294967296)) (< (mod (+ .cse99 4294967295) 4294967296) .cse10) (< 0 (+ ~var_1_6~0 1)))))) (.cse20 (forall ((~var_1_6~0 Int)) (let ((.cse98 (div .cse11 ~var_1_6~0))) (or (< (mod (+ .cse98 1) 4294967296) .cse10) (= (mod .cse11 ~var_1_6~0) 0) (< (mod .cse98 4294967296) .cse10) (< (mod (+ .cse98 4294967295) 4294967296) .cse10) (< 0 (+ ~var_1_6~0 1)))))) (.cse22 (forall ((~var_1_6~0 Int)) (let ((.cse97 (div .cse11 ~var_1_6~0))) (or (< (mod (+ .cse97 1) 4294967296) .cse10) (= (mod .cse11 ~var_1_6~0) 0) (< .cse8 (mod .cse97 4294967296)) (< (mod (+ .cse97 4294967295) 4294967296) .cse10) (< ~var_1_6~0 0))))) (.cse21 (forall ((~var_1_6~0 Int)) (let ((.cse96 (div .cse11 ~var_1_6~0))) (or (< (mod (+ .cse96 1) 4294967296) .cse10) (= (mod .cse11 ~var_1_6~0) 0) (< (mod .cse96 4294967296) .cse10) (< (mod (+ .cse96 4294967295) 4294967296) .cse10) (< ~var_1_6~0 0))))) (.cse0 (not .cse4)) (.cse14 (forall ((~var_1_6~0 Int)) (let ((.cse95 (div .cse11 ~var_1_6~0))) (or (< (mod .cse95 4294967296) .cse10) (< (mod (+ .cse95 4294967295) 4294967296) .cse10) (not (= (mod .cse11 ~var_1_6~0) 0)) (< ~var_1_6~0 0))))) (.cse15 (forall ((~var_1_6~0 Int)) (let ((.cse94 (div .cse11 ~var_1_6~0))) (or (< (mod .cse94 4294967296) .cse10) (< (mod (+ .cse94 4294967295) 4294967296) .cse10) (not (= (mod .cse11 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))))) (.cse50 (and (or .cse60 .cse61) (or .cse53 .cse58))) (.cse72 (< .cse92 (+ .cse93 1))) (.cse44 (not .cse38)) (.cse46 (= .cse91 .cse45)) (.cse43 (+ c_~var_1_12~0 1)) (.cse40 (not .cse41)) (.cse37 (= .cse91 .cse42))) (and (or (let ((.cse16 (forall ((~var_1_6~0 Int)) (let ((.cse28 (div .cse11 ~var_1_6~0))) (or (< .cse8 (mod .cse28 4294967296)) (< (mod (+ .cse28 4294967295) 4294967296) .cse10) (not (= (mod .cse11 ~var_1_6~0) 0)) (< ~var_1_6~0 0))))) (.cse17 (forall ((~var_1_6~0 Int)) (let ((.cse27 (div .cse11 ~var_1_6~0))) (or (< .cse8 (mod .cse27 4294967296)) (< (mod (+ .cse27 4294967295) 4294967296) .cse10) (not (= (mod .cse11 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1))))))) (and (or (let ((.cse1 (forall ((~var_1_6~0 Int)) (let ((.cse12 (div .cse11 ~var_1_6~0))) (or (< .cse8 (mod .cse12 4294967296)) (< (mod (+ .cse12 4294967295) 4294967296) .cse10) (< ~var_1_6~0 0))))) (.cse3 (forall ((~var_1_6~0 Int)) (let ((.cse9 (div .cse11 ~var_1_6~0))) (or (< .cse8 (mod .cse9 4294967296)) (< (mod (+ .cse9 4294967295) 4294967296) .cse10) (< 0 (+ ~var_1_6~0 1))))))) (and (or .cse0 (and (or .cse1 .cse2) (or .cse3 .cse2))) (or .cse4 (and (or .cse5 .cse6) (or .cse7 .cse6))) (or (and (or .cse2 .cse5) (or .cse2 .cse7)) .cse0) (or .cse4 (and (or .cse1 .cse6) (or .cse3 .cse6))))) .cse13) (or (and (or .cse14 .cse6) (or .cse15 .cse6)) .cse4) (or .cse0 (and (or .cse2 .cse16) (or .cse2 .cse17))) (or .cse0 (and (or .cse14 .cse2) (or .cse15 .cse2))) (or .cse18 (and (or .cse4 (and (or .cse19 .cse6) (or .cse20 .cse6) (or .cse21 .cse6) (or .cse22 .cse6))) (or .cse0 (and (or .cse19 .cse2) (or .cse2 .cse21) (or .cse20 .cse2) (or .cse2 .cse22))) (or .cse0 (and (or .cse23 .cse2) (or .cse24 .cse2) (or .cse2 .cse25) (or .cse2 .cse26))) (or (and (or .cse23 .cse6) (or .cse26 .cse6) (or .cse25 .cse6) (or .cse24 .cse6)) .cse4))) (or (and (or .cse16 .cse6) (or .cse17 .cse6)) .cse4))) .cse29) (or (and (or .cse30 .cse31 (forall ((v_z_13 Int)) (or (< .cse32 (+ (mod (div .cse33 v_z_13) 4294967296) 1)) (< 4294967295 v_z_13) (< v_z_13 0)))) (or (forall ((v_z_12 Int)) (or (< v_z_12 0) (< 4294967295 v_z_12) (< (mod (div .cse33 v_z_12) 4294967296) .cse32))) (and (<= .cse34 .cse35) .cse31))) .cse36) (or .cse37 (and (or .cse38 (and (or (and (<= 128 .cse39) (<= c_~var_1_11~0 c_~var_1_12~0)) .cse40) (or .cse41 (and (or (and (<= .cse42 127) (= c_~var_1_8~0 .cse42)) (< c_~var_1_11~0 .cse43)) (or (< c_~var_1_12~0 c_~var_1_11~0) (and (= c_~var_1_8~0 .cse39) (<= .cse39 127))))))) (or .cse44 (and (or (< 127 .cse45) (= c_~var_1_8~0 .cse45)) (or (< .cse45 128) .cse46))))) (or (and (or .cse30 .cse31 (forall ((v_z_11 Int)) (or (< v_z_11 0) (< .cse32 (+ (mod (div .cse33 v_z_11) 4294967296) 1)) (< 4294967295 v_z_11)))) (or (and (or .cse47 (< c_~var_1_14~0 1)) .cse48) (forall ((v_z_10 Int)) (or (< v_z_10 0) (< 4294967295 v_z_10) (< (mod (div .cse33 v_z_10) 4294967296) .cse32))))) .cse49) (or (let ((.cse52 (and (or .cse13 .cse70) .cse71)) (.cse51 (and .cse68 (or .cse69 .cse13)))) (and (or (and (or .cse50 .cse51) (or .cse50 .cse52)) .cse4) (or .cse0 (and (or .cse53 .cse52) (or .cse51 .cse53))) (or .cse18 (and (or (forall ((~var_1_6~0 Int)) (let ((.cse54 (div .cse11 ~var_1_6~0))) (or (= (mod .cse11 ~var_1_6~0) 0) (< .cse8 (mod (+ .cse54 4294967295) 4294967296)) (< .cse8 (mod (+ .cse54 1) 4294967296))))) .cse4) (or .cse0 (and .cse55 .cse56)) (or (let ((.cse57 (forall ((~var_1_6~0 Int)) (let ((.cse65 (div .cse11 ~var_1_6~0))) (or (= (mod .cse11 ~var_1_6~0) 0) (< (mod .cse65 4294967296) .cse10) (< .cse8 (mod (+ .cse65 4294967295) 4294967296)))))) (.cse62 (forall ((~var_1_6~0 Int)) (let ((.cse64 (div .cse11 ~var_1_6~0))) (or (< (mod (+ .cse64 1) 4294967296) .cse10) (= (mod .cse11 ~var_1_6~0) 0) (< .cse8 (mod (+ .cse64 4294967295) 4294967296)) (< .cse8 (mod .cse64 4294967296))))))) (and (or .cse57 .cse53 .cse58) .cse59 (or .cse57 .cse60 .cse61) (or .cse62 .cse53 .cse58) (or .cse62 .cse60 .cse61) .cse63)) .cse4))) (or (and (forall ((~var_1_6~0 Int)) (let ((.cse66 (div .cse11 ~var_1_6~0))) (or (< .cse8 (mod (+ .cse66 4294967295) 4294967296)) (< .cse8 (mod .cse66 4294967296)) (not (= (mod .cse11 ~var_1_6~0) 0))))) (or .cse13 (forall ((~var_1_6~0 Int)) (let ((.cse67 (div .cse11 ~var_1_6~0))) (or (< .cse8 (mod (+ .cse67 4294967295) 4294967296)) (< .cse8 (mod .cse67 4294967296))))))) .cse4))) .cse72) (or (let ((.cse77 (forall ((~var_1_6~0 Int)) (let ((.cse84 (div .cse11 ~var_1_6~0))) (or (< .cse8 (mod (+ .cse84 4294967295) 4294967296)) (< .cse8 (mod .cse84 4294967296)) (not (= (mod .cse11 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))))) (.cse78 (forall ((~var_1_6~0 Int)) (let ((.cse83 (div .cse11 ~var_1_6~0))) (or (< .cse8 (mod (+ .cse83 4294967295) 4294967296)) (< .cse8 (mod .cse83 4294967296)) (not (= (mod .cse11 ~var_1_6~0) 0)) (< ~var_1_6~0 0)))))) (and (or (and (or .cse68 .cse6) (or .cse71 .cse6)) .cse4) (or (let ((.cse74 (forall ((~var_1_6~0 Int)) (let ((.cse76 (div .cse11 ~var_1_6~0))) (or (< .cse8 (mod (+ .cse76 4294967295) 4294967296)) (< .cse8 (mod .cse76 4294967296)) (< ~var_1_6~0 0))))) (.cse73 (forall ((~var_1_6~0 Int)) (let ((.cse75 (div .cse11 ~var_1_6~0))) (or (< .cse8 (mod (+ .cse75 4294967295) 4294967296)) (< .cse8 (mod .cse75 4294967296)) (< 0 (+ ~var_1_6~0 1))))))) (and (or (and (or .cse69 .cse6) (or .cse70 .cse6)) .cse4) (or .cse0 (and (or .cse2 .cse70) (or .cse69 .cse2))) (or .cse0 (and (or .cse73 .cse2) (or .cse74 .cse2))) (or (and (or .cse74 .cse6) (or .cse73 .cse6)) .cse4))) .cse13) (or .cse0 (and (or .cse77 .cse2) (or .cse78 .cse2))) (or (and (or .cse77 .cse6) (or .cse78 .cse6)) .cse4) (or .cse18 (let ((.cse80 (forall ((~var_1_6~0 Int)) (let ((.cse82 (div .cse11 ~var_1_6~0))) (or (= (mod .cse11 ~var_1_6~0) 0) (< .cse8 (mod (+ .cse82 4294967295) 4294967296)) (< 0 (+ ~var_1_6~0 1)) (< .cse8 (mod (+ .cse82 1) 4294967296)))))) (.cse79 (forall ((~var_1_6~0 Int)) (let ((.cse81 (div .cse11 ~var_1_6~0))) (or (= (mod .cse11 ~var_1_6~0) 0) (< .cse8 (mod (+ .cse81 4294967295) 4294967296)) (< .cse8 (mod (+ .cse81 1) 4294967296)) (< ~var_1_6~0 0)))))) (and (or .cse0 (and (or .cse79 .cse2) (or .cse80 .cse2))) (or (and (or .cse80 .cse6) (or .cse79 .cse6)) .cse4) (or (and (or .cse56 .cse6) (or .cse55 .cse6) (or .cse59 .cse6) (or .cse63 .cse6)) .cse4) (or .cse0 (and (or .cse56 .cse2) (or .cse55 .cse2) (or .cse2 .cse63) (or .cse59 .cse2)))))) (or .cse0 (and (or .cse68 .cse2) (or .cse2 .cse71))))) .cse29) (or (< c_~var_1_14~0 0) (< 65535 c_~var_1_14~0) (and (or (and (or .cse30 .cse31 (forall ((v_z_24 Int)) (or (< .cse32 (+ (mod (div .cse33 v_z_24) 4294967296) 1)) (< v_z_24 0) (< 4294967295 v_z_24)))) (or (forall ((v_z_23 Int)) (or (< v_z_23 0) (< (mod (div .cse33 v_z_23) 4294967296) .cse32) (< 4294967295 v_z_23))) (and .cse48 (or .cse47 (< c_~var_1_14~0 (+ c_~var_1_15~0 1)))))) .cse36) (or .cse49 (and (or .cse30 .cse31 (forall ((v_z_25 Int)) (or (< (mod (div .cse33 v_z_25) 4294967296) .cse32) (< v_z_25 0) (< 4294967295 v_z_25)))) (or .cse30 .cse31 (forall ((v_z_26 Int)) (or (< .cse32 (+ (mod (div .cse33 v_z_26) 4294967296) 1)) (< v_z_26 0) (< 4294967295 v_z_26)))))))) (or (and (or (and (or .cse0 (and (or .cse53 .cse5) (or .cse53 .cse7))) (or .cse4 (forall ((~var_1_6~0 Int)) (let ((.cse85 (div .cse11 ~var_1_6~0))) (or (< .cse8 (mod .cse85 4294967296)) (< (mod (+ .cse85 4294967295) 4294967296) .cse10))))) (or (and (or .cse50 .cse7) (or .cse50 .cse5)) .cse4)) .cse13) (or .cse18 (and (or (let ((.cse86 (forall ((~var_1_6~0 Int)) (let ((.cse89 (div .cse11 ~var_1_6~0))) (or (= (mod .cse11 ~var_1_6~0) 0) (< (mod .cse89 4294967296) .cse10) (< .cse8 (mod (+ .cse89 1) 4294967296)))))) (.cse87 (forall ((~var_1_6~0 Int)) (let ((.cse88 (div .cse11 ~var_1_6~0))) (or (= (mod .cse11 ~var_1_6~0) 0) (< .cse8 (mod .cse88 4294967296)) (< (mod (+ .cse88 4294967295) 4294967296) .cse10) (< .cse8 (mod (+ .cse88 1) 4294967296))))))) (and .cse23 (or .cse53 .cse58 .cse86) (or .cse60 .cse61 .cse87) .cse25 (or .cse60 .cse61 .cse86) (or .cse53 .cse58 .cse87))) .cse4) (or (and (or .cse50 .cse19) (or .cse50 .cse22) (or .cse50 .cse20) (or .cse50 .cse21)) .cse4) (or .cse0 (and .cse24 .cse26)) (or (and .cse19 .cse20 .cse22 .cse21) .cse0))) (or .cse0 (and (or .cse15 .cse53) (or .cse14 .cse53))) (or (forall ((~var_1_6~0 Int)) (let ((.cse90 (div .cse11 ~var_1_6~0))) (or (< .cse8 (mod .cse90 4294967296)) (< (mod (+ .cse90 4294967295) 4294967296) .cse10) (not (= (mod .cse11 ~var_1_6~0) 0))))) .cse4) (or (and (or .cse50 .cse14) (or .cse15 .cse50)) .cse4)) .cse72) (or (and (or .cse44 (and .cse46 (<= 128 .cse45))) (or .cse38 (and (or .cse41 (and (<= 128 .cse42) (<= .cse43 c_~var_1_11~0))) (or .cse40 (< 127 .cse39))))) (not .cse37))))))) is different from false [2023-11-29 01:20:33,903 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:20:52,867 WARN L293 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:24:03,470 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:24:14,905 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:24:30,856 WARN L293 SmtUtils]: Spent 5.45s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:24:52,630 WARN L293 SmtUtils]: Spent 5.48s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:25:09,443 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:25:39,465 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse53 (mod c_~var_1_4~0 4294967296))) (let ((.cse6 (mod (div .cse53 5) 4294967296)) (.cse56 (+ c_~var_1_12~0 c_~var_1_11~0)) (.cse55 (+ c_~var_1_13~0 c_~var_1_15~0)) (.cse54 (mod c_~var_1_1~0 4294967296)) (.cse115 (mod c_~var_1_16~0 65536)) (.cse92 (+ 256 c_~var_1_8~0)) (.cse60 (mod (+ (* 255 c_~var_1_12~0) c_~var_1_10~0) 256))) (let ((.cse63 (mod (+ (* 255 c_~var_1_11~0) c_~var_1_10~0) 256)) (.cse62 (= .cse92 .cse60)) (.cse66 (mod (+ (* 255 c_~var_1_13~0) 241 c_~var_1_11~0) 256)) (.cse59 (= (mod c_~var_1_22~0 65536) c_~var_1_29~0)) (.cse70 (= .cse54 .cse115)) (.cse71 (< .cse53 .cse115)) (.cse72 (< .cse115 (+ .cse53 1))) (.cse73 (= .cse53 .cse54)) (.cse5 (= (* 2 .cse115) .cse54)) (.cse57 (= c_~var_1_14~0 c_~var_1_15~0)) (.cse51 (< .cse56 .cse55)) (.cse52 (= (+ c_~var_1_13~0 c_~var_1_14~0 1) 0)) (.cse8 (+ .cse6 1)) (.cse9 (* c_~var_1_61~0 .cse115)) (.cse94 (mod c_~var_1_61~0 4294967296)) (.cse93 (mod c_~var_1_30~0 4294967296))) (let ((.cse10 (= .cse54 (mod (+ c_~var_1_4~0 (* 4294967295 .cse115)) 4294967296))) (.cse30 (< .cse94 .cse93)) (.cse36 (forall ((~var_1_6~0 Int)) (let ((.cse114 (div .cse9 ~var_1_6~0))) (or (< (mod (+ .cse114 1) 4294967296) .cse8) (= (mod .cse9 ~var_1_6~0) 0) (< .cse6 (mod (+ .cse114 4294967295) 4294967296)) (< .cse6 (mod .cse114 4294967296)) (< ~var_1_6~0 0))))) (.cse35 (forall ((~var_1_6~0 Int)) (let ((.cse113 (div .cse9 ~var_1_6~0))) (or (= (mod .cse9 ~var_1_6~0) 0) (< (mod .cse113 4294967296) .cse8) (< .cse6 (mod (+ .cse113 4294967295) 4294967296)) (< ~var_1_6~0 0))))) (.cse37 (forall ((~var_1_6~0 Int)) (let ((.cse112 (div .cse9 ~var_1_6~0))) (or (= (mod .cse9 ~var_1_6~0) 0) (< (mod .cse112 4294967296) .cse8) (< .cse6 (mod (+ .cse112 4294967295) 4294967296)) (< 0 (+ ~var_1_6~0 1)))))) (.cse38 (forall ((~var_1_6~0 Int)) (let ((.cse111 (div .cse9 ~var_1_6~0))) (or (< (mod (+ .cse111 1) 4294967296) .cse8) (= (mod .cse9 ~var_1_6~0) 0) (< .cse6 (mod (+ .cse111 4294967295) 4294967296)) (< .cse6 (mod .cse111 4294967296)) (< 0 (+ ~var_1_6~0 1)))))) (.cse49 (forall ((~var_1_6~0 Int)) (let ((.cse110 (div .cse9 ~var_1_6~0))) (or (< (mod .cse110 4294967296) .cse8) (< .cse6 (mod (+ .cse110 4294967295) 4294967296)) (not (= (mod .cse9 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))))) (.cse43 (forall ((~var_1_6~0 Int)) (let ((.cse109 (div .cse9 ~var_1_6~0))) (or (< (mod .cse109 4294967296) .cse8) (< .cse6 (mod (+ .cse109 4294967295) 4294967296)) (< 0 (+ ~var_1_6~0 1)))))) (.cse44 (forall ((~var_1_6~0 Int)) (let ((.cse108 (div .cse9 ~var_1_6~0))) (or (< (mod .cse108 4294967296) .cse8) (< .cse6 (mod (+ .cse108 4294967295) 4294967296)) (< ~var_1_6~0 0))))) (.cse50 (forall ((~var_1_6~0 Int)) (let ((.cse107 (div .cse9 ~var_1_6~0))) (or (< (mod .cse107 4294967296) .cse8) (< .cse6 (mod (+ .cse107 4294967295) 4294967296)) (not (= (mod .cse9 ~var_1_6~0) 0)) (< ~var_1_6~0 0))))) (.cse84 (or .cse51 .cse52)) (.cse83 (< .cse55 (+ c_~var_1_12~0 1 c_~var_1_11~0))) (.cse85 (not .cse57)) (.cse27 (forall ((~var_1_6~0 Int)) (let ((.cse106 (div .cse9 ~var_1_6~0))) (or (< (mod .cse106 4294967296) .cse8) (< (mod (+ .cse106 4294967295) 4294967296) .cse8) (not (= (mod .cse9 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))))) (.cse26 (forall ((~var_1_6~0 Int)) (let ((.cse105 (div .cse9 ~var_1_6~0))) (or (< (mod .cse105 4294967296) .cse8) (< (mod (+ .cse105 4294967295) 4294967296) .cse8) (not (= (mod .cse9 ~var_1_6~0) 0)) (< ~var_1_6~0 0))))) (.cse15 (< 0 (+ .cse9 1))) (.cse22 (forall ((~var_1_6~0 Int)) (let ((.cse104 (div .cse9 ~var_1_6~0))) (or (= (mod .cse9 ~var_1_6~0) 0) (< (mod .cse104 4294967296) .cse8) (< .cse6 (mod (+ .cse104 1) 4294967296)) (< ~var_1_6~0 0))))) (.cse24 (forall ((~var_1_6~0 Int)) (let ((.cse103 (div .cse9 ~var_1_6~0))) (or (= (mod .cse9 ~var_1_6~0) 0) (< .cse6 (mod .cse103 4294967296)) (< (mod (+ .cse103 4294967295) 4294967296) .cse8) (< .cse6 (mod (+ .cse103 1) 4294967296)) (< ~var_1_6~0 0))))) (.cse25 (forall ((~var_1_6~0 Int)) (let ((.cse102 (div .cse9 ~var_1_6~0))) (or (= (mod .cse9 ~var_1_6~0) 0) (< (mod .cse102 4294967296) .cse8) (< 0 (+ ~var_1_6~0 1)) (< .cse6 (mod (+ .cse102 1) 4294967296)))))) (.cse23 (forall ((~var_1_6~0 Int)) (let ((.cse101 (div .cse9 ~var_1_6~0))) (or (= (mod .cse9 ~var_1_6~0) 0) (< .cse6 (mod .cse101 4294967296)) (< (mod (+ .cse101 4294967295) 4294967296) .cse8) (< 0 (+ ~var_1_6~0 1)) (< .cse6 (mod (+ .cse101 1) 4294967296)))))) (.cse18 (forall ((~var_1_6~0 Int)) (let ((.cse100 (div .cse9 ~var_1_6~0))) (or (< (mod (+ .cse100 1) 4294967296) .cse8) (= (mod .cse9 ~var_1_6~0) 0) (< .cse6 (mod .cse100 4294967296)) (< (mod (+ .cse100 4294967295) 4294967296) .cse8) (< 0 (+ ~var_1_6~0 1)))))) (.cse19 (forall ((~var_1_6~0 Int)) (let ((.cse99 (div .cse9 ~var_1_6~0))) (or (< (mod (+ .cse99 1) 4294967296) .cse8) (= (mod .cse9 ~var_1_6~0) 0) (< (mod .cse99 4294967296) .cse8) (< (mod (+ .cse99 4294967295) 4294967296) .cse8) (< 0 (+ ~var_1_6~0 1)))))) (.cse21 (forall ((~var_1_6~0 Int)) (let ((.cse98 (div .cse9 ~var_1_6~0))) (or (< (mod (+ .cse98 1) 4294967296) .cse8) (= (mod .cse9 ~var_1_6~0) 0) (< .cse6 (mod .cse98 4294967296)) (< (mod (+ .cse98 4294967295) 4294967296) .cse8) (< ~var_1_6~0 0))))) (.cse20 (forall ((~var_1_6~0 Int)) (let ((.cse97 (div .cse9 ~var_1_6~0))) (or (< (mod (+ .cse97 1) 4294967296) .cse8) (= (mod .cse9 ~var_1_6~0) 0) (< (mod .cse97 4294967296) .cse8) (< (mod (+ .cse97 4294967295) 4294967296) .cse8) (< ~var_1_6~0 0))))) (.cse0 (not .cse5)) (.cse13 (forall ((~var_1_6~0 Int)) (let ((.cse96 (div .cse9 ~var_1_6~0))) (or (< (mod .cse96 4294967296) .cse8) (< (mod (+ .cse96 4294967295) 4294967296) .cse8) (< ~var_1_6~0 0))))) (.cse77 (and (or .cse70 .cse71) (or .cse72 .cse73))) (.cse12 (forall ((~var_1_6~0 Int)) (let ((.cse95 (div .cse9 ~var_1_6~0))) (or (< (mod .cse95 4294967296) .cse8) (< (mod (+ .cse95 4294967295) 4294967296) .cse8) (< 0 (+ ~var_1_6~0 1)))))) (.cse2 (< .cse9 0)) (.cse82 (< .cse93 (+ .cse94 1))) (.cse65 (not .cse59)) (.cse67 (= .cse92 .cse66)) (.cse64 (+ c_~var_1_12~0 1)) (.cse61 (not .cse62)) (.cse58 (= .cse92 .cse63))) (and (or (let ((.cse1 (and (or (forall ((~var_1_6~0 Int)) (let ((.cse28 (div .cse9 ~var_1_6~0))) (or (< .cse6 (mod .cse28 4294967296)) (< (mod (+ .cse28 4294967295) 4294967296) .cse8) (not (= (mod .cse9 ~var_1_6~0) 0)) (< ~var_1_6~0 0)))) .cse10) (or (forall ((~var_1_6~0 Int)) (let ((.cse29 (div .cse9 ~var_1_6~0))) (or (< .cse6 (mod .cse29 4294967296)) (< (mod (+ .cse29 4294967295) 4294967296) .cse8) (not (= (mod .cse9 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1))))) .cse10))) (.cse14 (and (or .cse26 .cse10) (or .cse27 .cse10)))) (and (or .cse0 .cse1) (or .cse2 (let ((.cse3 (and (or .cse12 .cse10) (or .cse13 .cse10))) (.cse4 (and (or (forall ((~var_1_6~0 Int)) (let ((.cse7 (div .cse9 ~var_1_6~0))) (or (< .cse6 (mod .cse7 4294967296)) (< (mod (+ .cse7 4294967295) 4294967296) .cse8) (< ~var_1_6~0 0)))) .cse10) (or (forall ((~var_1_6~0 Int)) (let ((.cse11 (div .cse9 ~var_1_6~0))) (or (< .cse6 (mod .cse11 4294967296)) (< (mod (+ .cse11 4294967295) 4294967296) .cse8) (< 0 (+ ~var_1_6~0 1))))) .cse10)))) (and (or .cse0 .cse3) (or .cse0 .cse4) (or .cse5 .cse3) (or .cse5 .cse4)))) (or .cse14 .cse5) (or .cse15 (let ((.cse17 (and (or .cse22 .cse10) (or .cse23 .cse10) (or .cse24 .cse10) (or .cse25 .cse10))) (.cse16 (and (or .cse18 .cse10) (or .cse19 .cse10) (or .cse20 .cse10) (or .cse21 .cse10)))) (and (or .cse5 .cse16) (or .cse0 .cse17) (or .cse17 .cse5) (or .cse0 .cse16)))) (or .cse1 .cse5) (or .cse0 .cse14))) .cse30) (or (let ((.cse31 (and (or .cse49 .cse10) (or .cse50 .cse10))) (.cse32 (and (or (forall ((~var_1_6~0 Int)) (let ((.cse47 (div .cse9 ~var_1_6~0))) (or (< .cse6 (mod (+ .cse47 4294967295) 4294967296)) (< .cse6 (mod .cse47 4294967296)) (not (= (mod .cse9 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1))))) .cse10) (or (forall ((~var_1_6~0 Int)) (let ((.cse48 (div .cse9 ~var_1_6~0))) (or (< .cse6 (mod (+ .cse48 4294967295) 4294967296)) (< .cse6 (mod .cse48 4294967296)) (not (= (mod .cse9 ~var_1_6~0) 0)) (< ~var_1_6~0 0)))) .cse10)))) (and (or .cse31 .cse5) (or .cse0 .cse31) (or .cse32 .cse5) (or .cse15 (let ((.cse33 (and (or (forall ((~var_1_6~0 Int)) (let ((.cse39 (div .cse9 ~var_1_6~0))) (or (= (mod .cse9 ~var_1_6~0) 0) (< .cse6 (mod (+ .cse39 4294967295) 4294967296)) (< 0 (+ ~var_1_6~0 1)) (< .cse6 (mod (+ .cse39 1) 4294967296))))) .cse10) (or (forall ((~var_1_6~0 Int)) (let ((.cse40 (div .cse9 ~var_1_6~0))) (or (= (mod .cse9 ~var_1_6~0) 0) (< .cse6 (mod (+ .cse40 4294967295) 4294967296)) (< .cse6 (mod (+ .cse40 1) 4294967296)) (< ~var_1_6~0 0)))) .cse10))) (.cse34 (and (or .cse35 .cse10) (or .cse36 .cse10) (or .cse37 .cse10) (or .cse38 .cse10)))) (and (or .cse0 .cse33) (or .cse33 .cse5) (or .cse34 .cse5) (or .cse0 .cse34)))) (or .cse0 .cse32) (or (let ((.cse42 (and (or (forall ((~var_1_6~0 Int)) (let ((.cse45 (div .cse9 ~var_1_6~0))) (or (< .cse6 (mod (+ .cse45 4294967295) 4294967296)) (< .cse6 (mod .cse45 4294967296)) (< ~var_1_6~0 0)))) .cse10) (or (forall ((~var_1_6~0 Int)) (let ((.cse46 (div .cse9 ~var_1_6~0))) (or (< .cse6 (mod (+ .cse46 4294967295) 4294967296)) (< .cse6 (mod .cse46 4294967296)) (< 0 (+ ~var_1_6~0 1))))) .cse10))) (.cse41 (and (or .cse43 .cse10) (or .cse44 .cse10)))) (and (or .cse41 .cse5) (or .cse42 .cse0) (or .cse42 .cse5) (or .cse0 .cse41))) .cse2))) .cse30) (or (and (or .cse51 .cse52 (forall ((v_z_13 Int)) (or (< .cse53 (+ (mod (div .cse54 v_z_13) 4294967296) 1)) (< 4294967295 v_z_13) (< v_z_13 0)))) (or (forall ((v_z_12 Int)) (or (< v_z_12 0) (< 4294967295 v_z_12) (< (mod (div .cse54 v_z_12) 4294967296) .cse53))) (and (<= .cse55 .cse56) .cse52))) .cse57) (or .cse58 (and (or .cse59 (and (or (and (<= 128 .cse60) (<= c_~var_1_11~0 c_~var_1_12~0)) .cse61) (or .cse62 (and (or (and (<= .cse63 127) (= c_~var_1_8~0 .cse63)) (< c_~var_1_11~0 .cse64)) (or (< c_~var_1_12~0 c_~var_1_11~0) (and (= c_~var_1_8~0 .cse60) (<= .cse60 127))))))) (or .cse65 (and (or (< 127 .cse66) (= c_~var_1_8~0 .cse66)) (or (< .cse66 128) .cse67))))) (or (let ((.cse78 (and (or .cse2 .cse44) .cse50)) (.cse79 (and .cse49 (or .cse43 .cse2)))) (and (or .cse15 (and (or (forall ((~var_1_6~0 Int)) (let ((.cse68 (div .cse9 ~var_1_6~0))) (or (= (mod .cse9 ~var_1_6~0) 0) (< .cse6 (mod (+ .cse68 4294967295) 4294967296)) (< .cse6 (mod (+ .cse68 1) 4294967296))))) .cse5) (or .cse0 (and .cse36 .cse35)) (or (let ((.cse69 (forall ((~var_1_6~0 Int)) (let ((.cse76 (div .cse9 ~var_1_6~0))) (or (= (mod .cse9 ~var_1_6~0) 0) (< (mod .cse76 4294967296) .cse8) (< .cse6 (mod (+ .cse76 4294967295) 4294967296)))))) (.cse74 (forall ((~var_1_6~0 Int)) (let ((.cse75 (div .cse9 ~var_1_6~0))) (or (< (mod (+ .cse75 1) 4294967296) .cse8) (= (mod .cse9 ~var_1_6~0) 0) (< .cse6 (mod (+ .cse75 4294967295) 4294967296)) (< .cse6 (mod .cse75 4294967296))))))) (and (or .cse69 .cse70 .cse71) .cse37 (or .cse69 .cse72 .cse73) (or .cse74 .cse70 .cse71) (or .cse74 .cse72 .cse73) .cse38)) .cse5))) (or (and (or .cse77 .cse78) (or .cse77 .cse79)) .cse5) (or .cse0 (and (or .cse70 .cse78) (or .cse79 .cse70))) (or (and (forall ((~var_1_6~0 Int)) (let ((.cse80 (div .cse9 ~var_1_6~0))) (or (< .cse6 (mod (+ .cse80 4294967295) 4294967296)) (< .cse6 (mod .cse80 4294967296)) (not (= (mod .cse9 ~var_1_6~0) 0))))) (or .cse2 (forall ((~var_1_6~0 Int)) (let ((.cse81 (div .cse9 ~var_1_6~0))) (or (< .cse6 (mod (+ .cse81 4294967295) 4294967296)) (< .cse6 (mod .cse81 4294967296))))))) .cse5))) .cse82) (or (and (or .cse51 .cse52 (forall ((v_z_11 Int)) (or (< v_z_11 0) (< .cse53 (+ (mod (div .cse54 v_z_11) 4294967296) 1)) (< 4294967295 v_z_11)))) (or (and (or .cse83 (< c_~var_1_14~0 1)) .cse84) (forall ((v_z_10 Int)) (or (< v_z_10 0) (< 4294967295 v_z_10) (< (mod (div .cse54 v_z_10) 4294967296) .cse53))))) .cse85) (or (< c_~var_1_14~0 0) (< 65535 c_~var_1_14~0) (and (or (and (or .cse51 .cse52 (forall ((v_z_24 Int)) (or (< .cse53 (+ (mod (div .cse54 v_z_24) 4294967296) 1)) (< v_z_24 0) (< 4294967295 v_z_24)))) (or (forall ((v_z_23 Int)) (or (< v_z_23 0) (< (mod (div .cse54 v_z_23) 4294967296) .cse53) (< 4294967295 v_z_23))) (and .cse84 (or .cse83 (< c_~var_1_14~0 (+ c_~var_1_15~0 1)))))) .cse57) (or .cse85 (and (or .cse51 .cse52 (forall ((v_z_25 Int)) (or (< (mod (div .cse54 v_z_25) 4294967296) .cse53) (< v_z_25 0) (< 4294967295 v_z_25)))) (or .cse51 .cse52 (forall ((v_z_26 Int)) (or (< .cse53 (+ (mod (div .cse54 v_z_26) 4294967296) 1)) (< v_z_26 0) (< 4294967295 v_z_26)))))))) (or (and (or (and (or .cse77 .cse26) (or .cse27 .cse77)) .cse5) (or .cse0 (and (or .cse27 .cse70) (or .cse26 .cse70))) (or .cse15 (and (or (and (or .cse77 .cse19) (or .cse77 .cse18) (or .cse77 .cse20) (or .cse77 .cse21)) .cse5) (or (let ((.cse86 (forall ((~var_1_6~0 Int)) (let ((.cse89 (div .cse9 ~var_1_6~0))) (or (= (mod .cse9 ~var_1_6~0) 0) (< (mod .cse89 4294967296) .cse8) (< .cse6 (mod (+ .cse89 1) 4294967296)))))) (.cse87 (forall ((~var_1_6~0 Int)) (let ((.cse88 (div .cse9 ~var_1_6~0))) (or (= (mod .cse9 ~var_1_6~0) 0) (< .cse6 (mod .cse88 4294967296)) (< (mod (+ .cse88 4294967295) 4294967296) .cse8) (< .cse6 (mod (+ .cse88 1) 4294967296))))))) (and (or .cse72 .cse73 .cse86) .cse22 (or .cse72 .cse73 .cse87) (or .cse70 .cse71 .cse86) .cse24 (or .cse70 .cse71 .cse87))) .cse5) (or .cse0 (and .cse25 .cse23)) (or (and .cse18 .cse19 .cse21 .cse20) .cse0))) (or (and (or .cse0 (and (or .cse70 .cse12) (or .cse70 .cse13))) (or (and (or .cse77 .cse13) (or .cse77 .cse12)) .cse5) (or .cse5 (forall ((~var_1_6~0 Int)) (let ((.cse90 (div .cse9 ~var_1_6~0))) (or (< .cse6 (mod .cse90 4294967296)) (< (mod (+ .cse90 4294967295) 4294967296) .cse8)))))) .cse2) (or (forall ((~var_1_6~0 Int)) (let ((.cse91 (div .cse9 ~var_1_6~0))) (or (< .cse6 (mod .cse91 4294967296)) (< (mod (+ .cse91 4294967295) 4294967296) .cse8) (not (= (mod .cse9 ~var_1_6~0) 0))))) .cse5)) .cse82) (or (and (or .cse65 (and .cse67 (<= 128 .cse66))) (or .cse59 (and (or .cse62 (and (<= 128 .cse63) (<= .cse64 c_~var_1_11~0))) (or .cse61 (< 127 .cse60))))) (not .cse58))))))) is different from true [2023-11-29 01:26:35,119 WARN L293 SmtUtils]: Spent 5.48s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)