./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1 --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 707a62cdbfecf08d6cd7391f672114e8110bcee31b0927d7d5b0c17b9e69700b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 14:58:19,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 14:58:20,049 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 14:58:20,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 14:58:20,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 14:58:20,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 14:58:20,080 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 14:58:20,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 14:58:20,081 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 14:58:20,081 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 14:58:20,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 14:58:20,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 14:58:20,081 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 14:58:20,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 14:58:20,082 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 14:58:20,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 14:58:20,082 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 14:58:20,082 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 14:58:20,082 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 14:58:20,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 14:58:20,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 14:58:20,082 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 14:58:20,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 14:58:20,082 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 14:58:20,083 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 14:58:20,083 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 14:58:20,083 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 14:58:20,083 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 14:58:20,083 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 14:58:20,083 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:58:20,083 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:58:20,083 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:58:20,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:58:20,083 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 14:58:20,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:58:20,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:58:20,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:58:20,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:58:20,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 14:58:20,084 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 14:58:20,084 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 14:58:20,084 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 14:58:20,084 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 14:58:20,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 14:58:20,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 14:58:20,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 14:58:20,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 14:58:20,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 14:58:20,085 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1 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 -> 707a62cdbfecf08d6cd7391f672114e8110bcee31b0927d7d5b0c17b9e69700b [2024-12-02 14:58:20,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 14:58:20,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 14:58:20,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 14:58:20,366 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 14:58:20,366 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 14:58:20,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i [2024-12-02 14:58:23,193 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/data/d1fd04169/a40a4a2c4ae64e3eb2ab1f1aacaac18d/FLAG926e51f36 [2024-12-02 14:58:23,501 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 14:58:23,502 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i [2024-12-02 14:58:23,518 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/data/d1fd04169/a40a4a2c4ae64e3eb2ab1f1aacaac18d/FLAG926e51f36 [2024-12-02 14:58:23,535 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/data/d1fd04169/a40a4a2c4ae64e3eb2ab1f1aacaac18d [2024-12-02 14:58:23,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 14:58:23,540 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 14:58:23,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 14:58:23,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 14:58:23,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 14:58:23,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:58:23" (1/1) ... [2024-12-02 14:58:23,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@732a6963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:23, skipping insertion in model container [2024-12-02 14:58:23,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:58:23" (1/1) ... [2024-12-02 14:58:23,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 14:58:23,753 WARN L250 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_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i[916,929] [2024-12-02 14:58:23,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:58:23,945 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 14:58:23,957 WARN L250 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_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i[916,929] [2024-12-02 14:58:24,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:58:24,063 INFO L204 MainTranslator]: Completed translation [2024-12-02 14:58:24,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:24 WrapperNode [2024-12-02 14:58:24,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 14:58:24,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 14:58:24,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 14:58:24,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 14:58:24,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:24" (1/1) ... [2024-12-02 14:58:24,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:24" (1/1) ... [2024-12-02 14:58:24,166 INFO L138 Inliner]: procedures = 26, calls = 123, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 805 [2024-12-02 14:58:24,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 14:58:24,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 14:58:24,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 14:58:24,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 14:58:24,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:24" (1/1) ... [2024-12-02 14:58:24,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:24" (1/1) ... [2024-12-02 14:58:24,186 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:24" (1/1) ... [2024-12-02 14:58:24,216 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]. [2024-12-02 14:58:24,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:24" (1/1) ... [2024-12-02 14:58:24,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:24" (1/1) ... [2024-12-02 14:58:24,258 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:24" (1/1) ... [2024-12-02 14:58:24,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:24" (1/1) ... [2024-12-02 14:58:24,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:24" (1/1) ... [2024-12-02 14:58:24,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:24" (1/1) ... [2024-12-02 14:58:24,279 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:24" (1/1) ... [2024-12-02 14:58:24,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 14:58:24,291 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 14:58:24,291 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 14:58:24,291 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 14:58:24,292 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:24" (1/1) ... [2024-12-02 14:58:24,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:58:24,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:58:24,323 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 14:58:24,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 14:58:24,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 14:58:24,354 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-12-02 14:58:24,354 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-12-02 14:58:24,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 14:58:24,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 14:58:24,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 14:58:24,494 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 14:58:24,496 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 14:58:25,670 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-12-02 14:58:25,671 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 14:58:25,690 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 14:58:25,690 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-02 14:58:25,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:58:25 BoogieIcfgContainer [2024-12-02 14:58:25,690 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 14:58:25,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 14:58:25,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 14:58:25,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 14:58:25,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:58:23" (1/3) ... [2024-12-02 14:58:25,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6878a156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:58:25, skipping insertion in model container [2024-12-02 14:58:25,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:24" (2/3) ... [2024-12-02 14:58:25,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6878a156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:58:25, skipping insertion in model container [2024-12-02 14:58:25,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:58:25" (3/3) ... [2024-12-02 14:58:25,701 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-44.i [2024-12-02 14:58:25,719 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 14:58:25,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-44.i that has 2 procedures, 334 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 14:58:25,803 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 14:58:25,817 INFO L333 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, 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;@2285e346, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 14:58:25,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 14:58:25,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 221 states have (on average 1.5701357466063348) internal successors, (347), 222 states have internal predecessors, (347), 110 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2024-12-02 14:58:25,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2024-12-02 14:58:25,869 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:25,871 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:58:25,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:25,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:25,877 INFO L85 PathProgramCache]: Analyzing trace with hash -253850497, now seen corresponding path program 1 times [2024-12-02 14:58:25,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:25,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802793173] [2024-12-02 14:58:25,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:25,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:26,644 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 218 refuted. 0 times theorem prover too weak. 23762 trivial. 0 not checked. [2024-12-02 14:58:26,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:26,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802793173] [2024-12-02 14:58:26,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802793173] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:58:26,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283218799] [2024-12-02 14:58:26,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:26,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:58:26,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:58:26,651 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:58:26,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 14:58:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:27,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 1606 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-12-02 14:58:27,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:58:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 23762 trivial. 0 not checked. [2024-12-02 14:58:27,241 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:58:27,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283218799] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:27,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 14:58:27,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-12-02 14:58:27,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798218655] [2024-12-02 14:58:27,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:27,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-02 14:58:27,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:27,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-02 14:58:27,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 14:58:27,271 INFO L87 Difference]: Start difference. First operand has 334 states, 221 states have (on average 1.5701357466063348) internal successors, (347), 222 states have internal predecessors, (347), 110 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) Second operand has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (110), 2 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 2 states have call successors, (110) [2024-12-02 14:58:27,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:27,346 INFO L93 Difference]: Finished difference Result 661 states and 1238 transitions. [2024-12-02 14:58:27,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-02 14:58:27,349 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (110), 2 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 2 states have call successors, (110) Word has length 705 [2024-12-02 14:58:27,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:27,360 INFO L225 Difference]: With dead ends: 661 [2024-12-02 14:58:27,360 INFO L226 Difference]: Without dead ends: 330 [2024-12-02 14:58:27,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 706 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 14:58:27,368 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:27,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:58:27,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-12-02 14:58:27,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2024-12-02 14:58:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 218 states have (on average 1.5504587155963303) internal successors, (338), 218 states have internal predecessors, (338), 110 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2024-12-02 14:58:27,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 558 transitions. [2024-12-02 14:58:27,456 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 558 transitions. Word has length 705 [2024-12-02 14:58:27,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:27,457 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 558 transitions. [2024-12-02 14:58:27,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (110), 2 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 2 states have call successors, (110) [2024-12-02 14:58:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 558 transitions. [2024-12-02 14:58:27,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2024-12-02 14:58:27,477 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:27,478 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:58:27,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 14:58:27,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-12-02 14:58:27,679 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:27,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:27,680 INFO L85 PathProgramCache]: Analyzing trace with hash 12451270, now seen corresponding path program 1 times [2024-12-02 14:58:27,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:27,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558129491] [2024-12-02 14:58:27,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:27,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2024-12-02 14:58:29,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:29,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558129491] [2024-12-02 14:58:29,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558129491] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:58:29,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972404755] [2024-12-02 14:58:29,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:29,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:58:29,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:58:29,356 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:58:29,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 14:58:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:29,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 1610 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-12-02 14:58:29,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:58:29,966 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2024-12-02 14:58:29,966 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:58:29,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972404755] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:29,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 14:58:29,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-12-02 14:58:29,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368189199] [2024-12-02 14:58:29,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:29,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:58:29,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:29,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:58:29,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:58:29,971 INFO L87 Difference]: Start difference. First operand 330 states and 558 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-12-02 14:58:30,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:30,073 INFO L93 Difference]: Finished difference Result 829 states and 1406 transitions. [2024-12-02 14:58:30,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:58:30,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 706 [2024-12-02 14:58:30,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:30,081 INFO L225 Difference]: With dead ends: 829 [2024-12-02 14:58:30,082 INFO L226 Difference]: Without dead ends: 502 [2024-12-02 14:58:30,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 707 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:58:30,084 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 281 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:30,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1240 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:58:30,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-12-02 14:58:30,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 499. [2024-12-02 14:58:30,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 353 states have (on average 1.5920679886685551) internal successors, (562), 354 states have internal predecessors, (562), 143 states have call successors, (143), 2 states have call predecessors, (143), 2 states have return successors, (143), 142 states have call predecessors, (143), 143 states have call successors, (143) [2024-12-02 14:58:30,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 848 transitions. [2024-12-02 14:58:30,156 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 848 transitions. Word has length 706 [2024-12-02 14:58:30,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:30,158 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 848 transitions. [2024-12-02 14:58:30,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-12-02 14:58:30,158 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 848 transitions. [2024-12-02 14:58:30,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2024-12-02 14:58:30,166 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:30,166 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:58:30,178 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 14:58:30,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-12-02 14:58:30,367 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:30,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:30,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1920909060, now seen corresponding path program 1 times [2024-12-02 14:58:30,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:30,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736712082] [2024-12-02 14:58:30,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:30,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2024-12-02 14:58:31,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:31,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736712082] [2024-12-02 14:58:31,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736712082] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:58:31,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552458477] [2024-12-02 14:58:31,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:31,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:58:31,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:58:31,220 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:58:31,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 14:58:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:31,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 1608 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 14:58:31,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:58:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2024-12-02 14:58:31,793 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:58:31,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552458477] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:31,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 14:58:31,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-12-02 14:58:31,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588949108] [2024-12-02 14:58:31,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:31,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:58:31,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:31,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:58:31,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-02 14:58:31,796 INFO L87 Difference]: Start difference. First operand 499 states and 848 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-12-02 14:58:31,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:31,999 INFO L93 Difference]: Finished difference Result 1499 states and 2550 transitions. [2024-12-02 14:58:32,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:58:32,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 706 [2024-12-02 14:58:32,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:32,012 INFO L225 Difference]: With dead ends: 1499 [2024-12-02 14:58:32,012 INFO L226 Difference]: Without dead ends: 1003 [2024-12-02 14:58:32,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 706 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-12-02 14:58:32,015 INFO L435 NwaCegarLoop]: 1006 mSDtfsCounter, 535 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 2534 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:32,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 2534 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:58:32,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2024-12-02 14:58:32,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 641. [2024-12-02 14:58:32,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 495 states have (on average 1.6404040404040403) internal successors, (812), 496 states have internal predecessors, (812), 143 states have call successors, (143), 2 states have call predecessors, (143), 2 states have return successors, (143), 142 states have call predecessors, (143), 143 states have call successors, (143) [2024-12-02 14:58:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1098 transitions. [2024-12-02 14:58:32,115 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1098 transitions. Word has length 706 [2024-12-02 14:58:32,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:32,116 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 1098 transitions. [2024-12-02 14:58:32,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-12-02 14:58:32,117 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1098 transitions. [2024-12-02 14:58:32,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2024-12-02 14:58:32,125 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:32,125 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:58:32,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 14:58:32,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:58:32,326 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:32,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:32,326 INFO L85 PathProgramCache]: Analyzing trace with hash -37665726, now seen corresponding path program 1 times [2024-12-02 14:58:32,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:32,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475094283] [2024-12-02 14:58:32,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:32,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:32,707 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2024-12-02 14:58:32,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:32,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475094283] [2024-12-02 14:58:32,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475094283] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:32,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:58:32,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:58:32,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445180799] [2024-12-02 14:58:32,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:32,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:58:32,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:32,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:58:32,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:58:32,710 INFO L87 Difference]: Start difference. First operand 641 states and 1098 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-12-02 14:58:32,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:32,796 INFO L93 Difference]: Finished difference Result 1647 states and 2809 transitions. [2024-12-02 14:58:32,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:58:32,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 706 [2024-12-02 14:58:32,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:32,805 INFO L225 Difference]: With dead ends: 1647 [2024-12-02 14:58:32,806 INFO L226 Difference]: Without dead ends: 1009 [2024-12-02 14:58:32,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:58:32,809 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 347 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:32,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1141 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:58:32,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2024-12-02 14:58:32,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1006. [2024-12-02 14:58:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 737 states have (on average 1.6010854816824966) internal successors, (1180), 740 states have internal predecessors, (1180), 264 states have call successors, (264), 4 states have call predecessors, (264), 4 states have return successors, (264), 261 states have call predecessors, (264), 264 states have call successors, (264) [2024-12-02 14:58:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1708 transitions. [2024-12-02 14:58:32,900 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1708 transitions. Word has length 706 [2024-12-02 14:58:32,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:32,902 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1708 transitions. [2024-12-02 14:58:32,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-12-02 14:58:32,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1708 transitions. [2024-12-02 14:58:32,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2024-12-02 14:58:32,910 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:32,910 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:58:32,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 14:58:32,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:32,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:32,911 INFO L85 PathProgramCache]: Analyzing trace with hash -390754108, now seen corresponding path program 1 times [2024-12-02 14:58:32,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:32,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053334899] [2024-12-02 14:58:32,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:32,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:33,387 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2024-12-02 14:58:33,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:33,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053334899] [2024-12-02 14:58:33,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053334899] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:33,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:58:33,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:58:33,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718285697] [2024-12-02 14:58:33,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:33,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:58:33,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:33,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:58:33,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:58:33,391 INFO L87 Difference]: Start difference. First operand 1006 states and 1708 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-12-02 14:58:33,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:33,488 INFO L93 Difference]: Finished difference Result 2016 states and 3418 transitions. [2024-12-02 14:58:33,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:58:33,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 706 [2024-12-02 14:58:33,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:33,499 INFO L225 Difference]: With dead ends: 2016 [2024-12-02 14:58:33,499 INFO L226 Difference]: Without dead ends: 1013 [2024-12-02 14:58:33,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:58:33,503 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 327 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:33,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1360 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:58:33,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2024-12-02 14:58:33,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 755. [2024-12-02 14:58:33,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 608 states have (on average 1.662828947368421) internal successors, (1011), 609 states have internal predecessors, (1011), 143 states have call successors, (143), 3 states have call predecessors, (143), 3 states have return successors, (143), 142 states have call predecessors, (143), 143 states have call successors, (143) [2024-12-02 14:58:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1297 transitions. [2024-12-02 14:58:33,574 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1297 transitions. Word has length 706 [2024-12-02 14:58:33,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:33,575 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 1297 transitions. [2024-12-02 14:58:33,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-12-02 14:58:33,575 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1297 transitions. [2024-12-02 14:58:33,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2024-12-02 14:58:33,583 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:33,583 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:58:33,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 14:58:33,583 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:33,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:33,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2079697850, now seen corresponding path program 1 times [2024-12-02 14:58:33,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:33,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367040329] [2024-12-02 14:58:33,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:33,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:34,101 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2024-12-02 14:58:34,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:34,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367040329] [2024-12-02 14:58:34,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367040329] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:34,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:58:34,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:58:34,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273373488] [2024-12-02 14:58:34,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:34,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:58:34,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:34,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:58:34,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:58:34,104 INFO L87 Difference]: Start difference. First operand 755 states and 1297 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-12-02 14:58:34,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:34,600 INFO L93 Difference]: Finished difference Result 2008 states and 3442 transitions. [2024-12-02 14:58:34,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:58:34,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 706 [2024-12-02 14:58:34,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:34,608 INFO L225 Difference]: With dead ends: 2008 [2024-12-02 14:58:34,608 INFO L226 Difference]: Without dead ends: 1256 [2024-12-02 14:58:34,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:58:34,611 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 839 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:34,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 1814 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 14:58:34,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2024-12-02 14:58:34,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1249. [2024-12-02 14:58:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1019 states have (on average 1.6653581943081452) internal successors, (1697), 1023 states have internal predecessors, (1697), 222 states have call successors, (222), 7 states have call predecessors, (222), 7 states have return successors, (222), 218 states have call predecessors, (222), 222 states have call successors, (222) [2024-12-02 14:58:34,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 2141 transitions. [2024-12-02 14:58:34,665 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 2141 transitions. Word has length 706 [2024-12-02 14:58:34,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:34,666 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 2141 transitions. [2024-12-02 14:58:34,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-12-02 14:58:34,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 2141 transitions. [2024-12-02 14:58:34,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2024-12-02 14:58:34,672 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:34,672 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:58:34,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 14:58:34,673 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:34,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:34,673 INFO L85 PathProgramCache]: Analyzing trace with hash -208786095, now seen corresponding path program 1 times [2024-12-02 14:58:34,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:34,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986415708] [2024-12-02 14:58:34,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:34,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2024-12-02 14:58:35,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:35,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986415708] [2024-12-02 14:58:35,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986415708] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:35,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:58:35,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 14:58:35,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366157461] [2024-12-02 14:58:35,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:35,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:58:35,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:35,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:58:35,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:58:35,131 INFO L87 Difference]: Start difference. First operand 1249 states and 2141 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-12-02 14:58:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:36,595 INFO L93 Difference]: Finished difference Result 3563 states and 6065 transitions. [2024-12-02 14:58:36,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 14:58:36,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 707 [2024-12-02 14:58:36,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:36,612 INFO L225 Difference]: With dead ends: 3563 [2024-12-02 14:58:36,612 INFO L226 Difference]: Without dead ends: 2317 [2024-12-02 14:58:36,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-12-02 14:58:36,617 INFO L435 NwaCegarLoop]: 953 mSDtfsCounter, 2296 mSDsluCounter, 2255 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2296 SdHoareTripleChecker+Valid, 3208 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:36,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2296 Valid, 3208 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-12-02 14:58:36,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2024-12-02 14:58:36,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 1940. [2024-12-02 14:58:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1940 states, 1527 states have (on average 1.641781270464964) internal successors, (2507), 1535 states have internal predecessors, (2507), 399 states have call successors, (399), 13 states have call predecessors, (399), 13 states have return successors, (399), 391 states have call predecessors, (399), 399 states have call successors, (399) [2024-12-02 14:58:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 3305 transitions. [2024-12-02 14:58:36,798 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 3305 transitions. Word has length 707 [2024-12-02 14:58:36,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:36,799 INFO L471 AbstractCegarLoop]: Abstraction has 1940 states and 3305 transitions. [2024-12-02 14:58:36,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-12-02 14:58:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 3305 transitions. [2024-12-02 14:58:36,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2024-12-02 14:58:36,808 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:36,808 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:58:36,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 14:58:36,808 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:36,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:36,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2070080147, now seen corresponding path program 1 times [2024-12-02 14:58:36,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:36,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980618988] [2024-12-02 14:58:36,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:36,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:37,551 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2024-12-02 14:58:37,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:37,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980618988] [2024-12-02 14:58:37,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980618988] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:37,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:58:37,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 14:58:37,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472595525] [2024-12-02 14:58:37,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:37,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:58:37,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:37,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:58:37,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:58:37,554 INFO L87 Difference]: Start difference. First operand 1940 states and 3305 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-12-02 14:58:38,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:38,792 INFO L93 Difference]: Finished difference Result 5403 states and 9193 transitions. [2024-12-02 14:58:38,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 14:58:38,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 707 [2024-12-02 14:58:38,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:38,809 INFO L225 Difference]: With dead ends: 5403 [2024-12-02 14:58:38,809 INFO L226 Difference]: Without dead ends: 3503 [2024-12-02 14:58:38,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-12-02 14:58:38,815 INFO L435 NwaCegarLoop]: 1210 mSDtfsCounter, 1230 mSDsluCounter, 3078 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 4288 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:38,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 4288 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-12-02 14:58:38,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2024-12-02 14:58:38,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 2010. [2024-12-02 14:58:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2010 states, 1597 states have (on average 1.6455854727614276) internal successors, (2628), 1605 states have internal predecessors, (2628), 399 states have call successors, (399), 13 states have call predecessors, (399), 13 states have return successors, (399), 391 states have call predecessors, (399), 399 states have call successors, (399) [2024-12-02 14:58:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 3426 transitions. [2024-12-02 14:58:38,946 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 3426 transitions. Word has length 707 [2024-12-02 14:58:38,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:38,947 INFO L471 AbstractCegarLoop]: Abstraction has 2010 states and 3426 transitions. [2024-12-02 14:58:38,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-12-02 14:58:38,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 3426 transitions. [2024-12-02 14:58:38,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2024-12-02 14:58:38,953 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:38,953 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:58:38,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 14:58:38,953 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:38,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:38,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1082384683, now seen corresponding path program 1 times [2024-12-02 14:58:38,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:38,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329659114] [2024-12-02 14:58:38,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:38,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 117 proven. 210 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2024-12-02 14:58:39,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:39,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329659114] [2024-12-02 14:58:39,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329659114] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:58:39,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659243756] [2024-12-02 14:58:39,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:39,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:58:39,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:58:39,907 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:58:39,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 14:58:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:40,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 1613 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 14:58:40,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:58:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 11107 proven. 210 refuted. 0 times theorem prover too weak. 12663 trivial. 0 not checked. [2024-12-02 14:58:41,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:58:42,269 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 117 proven. 210 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2024-12-02 14:58:42,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659243756] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:58:42,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:58:42,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-12-02 14:58:42,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799731336] [2024-12-02 14:58:42,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:58:42,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 14:58:42,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:42,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 14:58:42,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:58:42,273 INFO L87 Difference]: Start difference. First operand 2010 states and 3426 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 2 states have call predecessors, (181), 2 states have call successors, (181) [2024-12-02 14:58:42,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:42,964 INFO L93 Difference]: Finished difference Result 4018 states and 6825 transitions. [2024-12-02 14:58:42,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 14:58:42,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 2 states have call predecessors, (181), 2 states have call successors, (181) Word has length 707 [2024-12-02 14:58:42,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:42,978 INFO L225 Difference]: With dead ends: 4018 [2024-12-02 14:58:42,978 INFO L226 Difference]: Without dead ends: 2048 [2024-12-02 14:58:42,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1421 GetRequests, 1411 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-12-02 14:58:42,983 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 532 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:42,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1092 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 14:58:42,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2024-12-02 14:58:43,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2018. [2024-12-02 14:58:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2018 states, 1603 states have (on average 1.620711166562695) internal successors, (2598), 1611 states have internal predecessors, (2598), 399 states have call successors, (399), 15 states have call predecessors, (399), 15 states have return successors, (399), 391 states have call predecessors, (399), 399 states have call successors, (399) [2024-12-02 14:58:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 3396 transitions. [2024-12-02 14:58:43,160 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 3396 transitions. Word has length 707 [2024-12-02 14:58:43,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:43,161 INFO L471 AbstractCegarLoop]: Abstraction has 2018 states and 3396 transitions. [2024-12-02 14:58:43,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 2 states have call predecessors, (181), 2 states have call successors, (181) [2024-12-02 14:58:43,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 3396 transitions. [2024-12-02 14:58:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2024-12-02 14:58:43,170 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:43,170 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:58:43,183 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 14:58:43,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:58:43,371 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:43,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:43,372 INFO L85 PathProgramCache]: Analyzing trace with hash -525919279, now seen corresponding path program 1 times [2024-12-02 14:58:43,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:43,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571176143] [2024-12-02 14:58:43,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:43,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:45,943 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 123 proven. 204 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2024-12-02 14:58:45,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:45,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571176143] [2024-12-02 14:58:45,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571176143] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:58:45,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004427939] [2024-12-02 14:58:45,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:45,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:58:45,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:58:45,946 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:58:45,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 14:58:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:46,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 1611 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 14:58:46,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:58:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 12099 proven. 162 refuted. 0 times theorem prover too weak. 11719 trivial. 0 not checked. [2024-12-02 14:58:47,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:58:47,649 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 165 proven. 162 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2024-12-02 14:58:47,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004427939] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:58:47,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:58:47,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 13 [2024-12-02 14:58:47,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692006417] [2024-12-02 14:58:47,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:58:47,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 14:58:47,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:47,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 14:58:47,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-12-02 14:58:47,654 INFO L87 Difference]: Start difference. First operand 2018 states and 3396 transitions. Second operand has 13 states, 13 states have (on average 19.46153846153846) internal successors, (253), 13 states have internal predecessors, (253), 3 states have call successors, (232), 2 states have call predecessors, (232), 4 states have return successors, (234), 3 states have call predecessors, (234), 3 states have call successors, (234) [2024-12-02 14:58:50,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:50,720 INFO L93 Difference]: Finished difference Result 9945 states and 16711 transitions. [2024-12-02 14:58:50,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-12-02 14:58:50,722 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 19.46153846153846) internal successors, (253), 13 states have internal predecessors, (253), 3 states have call successors, (232), 2 states have call predecessors, (232), 4 states have return successors, (234), 3 states have call predecessors, (234), 3 states have call successors, (234) Word has length 707 [2024-12-02 14:58:50,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:50,743 INFO L225 Difference]: With dead ends: 9945 [2024-12-02 14:58:50,743 INFO L226 Difference]: Without dead ends: 7292 [2024-12-02 14:58:50,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1449 GetRequests, 1414 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=329, Invalid=931, Unknown=0, NotChecked=0, Total=1260 [2024-12-02 14:58:50,748 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 2826 mSDsluCounter, 2980 mSDsCounter, 0 mSdLazyCounter, 2448 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2828 SdHoareTripleChecker+Valid, 3620 SdHoareTripleChecker+Invalid, 3136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 2448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:50,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2828 Valid, 3620 Invalid, 3136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 2448 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-12-02 14:58:50,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7292 states. [2024-12-02 14:58:51,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7292 to 4100. [2024-12-02 14:58:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4100 states, 3454 states have (on average 1.6077012159814708) internal successors, (5553), 3469 states have internal predecessors, (5553), 616 states have call successors, (616), 29 states have call predecessors, (616), 29 states have return successors, (616), 601 states have call predecessors, (616), 616 states have call successors, (616) [2024-12-02 14:58:51,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4100 states to 4100 states and 6785 transitions. [2024-12-02 14:58:51,188 INFO L78 Accepts]: Start accepts. Automaton has 4100 states and 6785 transitions. Word has length 707 [2024-12-02 14:58:51,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:51,189 INFO L471 AbstractCegarLoop]: Abstraction has 4100 states and 6785 transitions. [2024-12-02 14:58:51,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 19.46153846153846) internal successors, (253), 13 states have internal predecessors, (253), 3 states have call successors, (232), 2 states have call predecessors, (232), 4 states have return successors, (234), 3 states have call predecessors, (234), 3 states have call successors, (234) [2024-12-02 14:58:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 6785 transitions. [2024-12-02 14:58:51,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2024-12-02 14:58:51,201 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:51,202 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:58:51,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 14:58:51,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-12-02 14:58:51,402 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:51,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:51,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1719285387, now seen corresponding path program 1 times [2024-12-02 14:58:51,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:51,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265500693] [2024-12-02 14:58:51,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:51,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:52,315 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2024-12-02 14:58:52,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:52,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265500693] [2024-12-02 14:58:52,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265500693] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:52,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:58:52,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:58:52,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111634680] [2024-12-02 14:58:52,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:52,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:58:52,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:52,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:58:52,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:58:52,317 INFO L87 Difference]: Start difference. First operand 4100 states and 6785 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-12-02 14:58:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:52,872 INFO L93 Difference]: Finished difference Result 13762 states and 22779 transitions. [2024-12-02 14:58:52,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:58:52,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 707 [2024-12-02 14:58:52,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:52,909 INFO L225 Difference]: With dead ends: 13762 [2024-12-02 14:58:52,909 INFO L226 Difference]: Without dead ends: 9702 [2024-12-02 14:58:52,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:58:52,916 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 1062 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:52,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 1413 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 14:58:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9702 states. [2024-12-02 14:58:53,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9702 to 8731. [2024-12-02 14:58:53,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8731 states, 7564 states have (on average 1.6207033315705976) internal successors, (12259), 7592 states have internal predecessors, (12259), 1110 states have call successors, (1110), 56 states have call predecessors, (1110), 56 states have return successors, (1110), 1082 states have call predecessors, (1110), 1110 states have call successors, (1110) [2024-12-02 14:58:53,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8731 states to 8731 states and 14479 transitions. [2024-12-02 14:58:53,572 INFO L78 Accepts]: Start accepts. Automaton has 8731 states and 14479 transitions. Word has length 707 [2024-12-02 14:58:53,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:53,573 INFO L471 AbstractCegarLoop]: Abstraction has 8731 states and 14479 transitions. [2024-12-02 14:58:53,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-12-02 14:58:53,573 INFO L276 IsEmpty]: Start isEmpty. Operand 8731 states and 14479 transitions. [2024-12-02 14:58:53,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2024-12-02 14:58:53,588 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:53,588 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:58:53,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 14:58:53,589 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:53,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:53,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1916150387, now seen corresponding path program 1 times [2024-12-02 14:58:53,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:53,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023615314] [2024-12-02 14:58:53,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:53,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:54,575 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 264 proven. 63 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2024-12-02 14:58:54,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:54,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023615314] [2024-12-02 14:58:54,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023615314] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:58:54,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901820229] [2024-12-02 14:58:54,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:54,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:58:54,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:58:54,577 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:58:54,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 14:58:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:54,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 1605 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 14:58:54,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:58:55,245 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 7677 proven. 63 refuted. 0 times theorem prover too weak. 16240 trivial. 0 not checked. [2024-12-02 14:58:55,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:58:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 264 proven. 63 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2024-12-02 14:58:55,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901820229] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:58:55,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:58:55,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-12-02 14:58:55,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013115603] [2024-12-02 14:58:55,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:58:55,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 14:58:55,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:55,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 14:58:55,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:58:55,668 INFO L87 Difference]: Start difference. First operand 8731 states and 14479 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (131), 2 states have call predecessors, (131), 4 states have return successors, (132), 2 states have call predecessors, (132), 2 states have call successors, (132) [2024-12-02 14:58:56,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:56,521 INFO L93 Difference]: Finished difference Result 16367 states and 27004 transitions. [2024-12-02 14:58:56,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 14:58:56,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (131), 2 states have call predecessors, (131), 4 states have return successors, (132), 2 states have call predecessors, (132), 2 states have call successors, (132) Word has length 707 [2024-12-02 14:58:56,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:56,542 INFO L225 Difference]: With dead ends: 16367 [2024-12-02 14:58:56,542 INFO L226 Difference]: Without dead ends: 7676 [2024-12-02 14:58:56,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1420 GetRequests, 1411 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-12-02 14:58:56,555 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 619 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:56,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1061 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 14:58:56,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7676 states. [2024-12-02 14:58:57,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7676 to 7568. [2024-12-02 14:58:57,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7568 states, 6399 states have (on average 1.5989998437255821) internal successors, (10232), 6427 states have internal predecessors, (10232), 1110 states have call successors, (1110), 58 states have call predecessors, (1110), 58 states have return successors, (1110), 1082 states have call predecessors, (1110), 1110 states have call successors, (1110) [2024-12-02 14:58:57,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7568 states to 7568 states and 12452 transitions. [2024-12-02 14:58:57,050 INFO L78 Accepts]: Start accepts. Automaton has 7568 states and 12452 transitions. Word has length 707 [2024-12-02 14:58:57,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:57,050 INFO L471 AbstractCegarLoop]: Abstraction has 7568 states and 12452 transitions. [2024-12-02 14:58:57,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (131), 2 states have call predecessors, (131), 4 states have return successors, (132), 2 states have call predecessors, (132), 2 states have call successors, (132) [2024-12-02 14:58:57,051 INFO L276 IsEmpty]: Start isEmpty. Operand 7568 states and 12452 transitions. [2024-12-02 14:58:57,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2024-12-02 14:58:57,060 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:57,061 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:58:57,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 14:58:57,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:58:57,261 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:57,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:57,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1583863584, now seen corresponding path program 1 times [2024-12-02 14:58:57,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:57,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427141818] [2024-12-02 14:58:57,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:57,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 213 proven. 114 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2024-12-02 14:58:58,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:58,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427141818] [2024-12-02 14:58:58,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427141818] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:58:58,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715401608] [2024-12-02 14:58:58,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:58,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:58:58,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:58:58,247 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:58:58,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 14:58:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:58,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 1604 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-12-02 14:58:58,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:58:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 11811 proven. 114 refuted. 0 times theorem prover too weak. 12055 trivial. 0 not checked. [2024-12-02 14:58:59,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:59:00,110 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 213 proven. 114 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2024-12-02 14:59:00,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715401608] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:59:00,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:59:00,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-12-02 14:59:00,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203429826] [2024-12-02 14:59:00,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:59:00,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 14:59:00,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:59:00,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 14:59:00,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-12-02 14:59:00,113 INFO L87 Difference]: Start difference. First operand 7568 states and 12452 transitions. Second operand has 11 states, 11 states have (on average 30.454545454545453) internal successors, (335), 11 states have internal predecessors, (335), 6 states have call successors, (186), 3 states have call predecessors, (186), 5 states have return successors, (187), 6 states have call predecessors, (187), 6 states have call successors, (187) [2024-12-02 14:59:01,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:59:01,055 INFO L93 Difference]: Finished difference Result 15220 states and 24961 transitions. [2024-12-02 14:59:01,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 14:59:01,056 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 30.454545454545453) internal successors, (335), 11 states have internal predecessors, (335), 6 states have call successors, (186), 3 states have call predecessors, (186), 5 states have return successors, (187), 6 states have call predecessors, (187), 6 states have call successors, (187) Word has length 709 [2024-12-02 14:59:01,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:59:01,090 INFO L225 Difference]: With dead ends: 15220 [2024-12-02 14:59:01,090 INFO L226 Difference]: Without dead ends: 7692 [2024-12-02 14:59:01,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1427 GetRequests, 1413 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-12-02 14:59:01,107 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 783 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 14:59:01,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 1030 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 14:59:01,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7692 states. [2024-12-02 14:59:01,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7692 to 7584. [2024-12-02 14:59:01,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7584 states, 6411 states have (on average 1.5933551708001872) internal successors, (10215), 6439 states have internal predecessors, (10215), 1110 states have call successors, (1110), 62 states have call predecessors, (1110), 62 states have return successors, (1110), 1082 states have call predecessors, (1110), 1110 states have call successors, (1110) [2024-12-02 14:59:01,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7584 states to 7584 states and 12435 transitions. [2024-12-02 14:59:01,656 INFO L78 Accepts]: Start accepts. Automaton has 7584 states and 12435 transitions. Word has length 709 [2024-12-02 14:59:01,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:59:01,656 INFO L471 AbstractCegarLoop]: Abstraction has 7584 states and 12435 transitions. [2024-12-02 14:59:01,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 30.454545454545453) internal successors, (335), 11 states have internal predecessors, (335), 6 states have call successors, (186), 3 states have call predecessors, (186), 5 states have return successors, (187), 6 states have call predecessors, (187), 6 states have call successors, (187) [2024-12-02 14:59:01,657 INFO L276 IsEmpty]: Start isEmpty. Operand 7584 states and 12435 transitions. [2024-12-02 14:59:01,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2024-12-02 14:59:01,664 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:59:01,664 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:59:01,677 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 14:59:01,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-12-02 14:59:01,865 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:59:01,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:59:01,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1858623198, now seen corresponding path program 1 times [2024-12-02 14:59:01,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:59:01,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76134316] [2024-12-02 14:59:01,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:59:01,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:59:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-02 14:59:02,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [450751414] [2024-12-02 14:59:02,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:59:02,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:59:02,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:59:02,369 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:59:02,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 14:59:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:59:02,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 1602 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-02 14:59:03,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:59:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2024-12-02 14:59:03,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:59:03,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:59:03,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76134316] [2024-12-02 14:59:03,752 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-12-02 14:59:03,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450751414] [2024-12-02 14:59:03,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450751414] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:59:03,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:59:03,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:59:03,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154257950] [2024-12-02 14:59:03,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:59:03,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:59:03,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:59:03,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:59:03,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:59:03,754 INFO L87 Difference]: Start difference. First operand 7584 states and 12435 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-12-02 14:59:05,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:59:05,240 INFO L93 Difference]: Finished difference Result 25426 states and 41574 transitions. [2024-12-02 14:59:05,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:59:05,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 709 [2024-12-02 14:59:05,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:59:05,297 INFO L225 Difference]: With dead ends: 25426 [2024-12-02 14:59:05,297 INFO L226 Difference]: Without dead ends: 17838 [2024-12-02 14:59:05,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 705 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:59:05,310 INFO L435 NwaCegarLoop]: 900 mSDtfsCounter, 645 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-12-02 14:59:05,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 2153 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-12-02 14:59:05,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17838 states. [2024-12-02 14:59:06,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17838 to 15831. [2024-12-02 14:59:06,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15831 states, 13544 states have (on average 1.5979031305375073) internal successors, (21642), 13598 states have internal predecessors, (21642), 2164 states have call successors, (2164), 122 states have call predecessors, (2164), 122 states have return successors, (2164), 2110 states have call predecessors, (2164), 2164 states have call successors, (2164) [2024-12-02 14:59:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15831 states to 15831 states and 25970 transitions. [2024-12-02 14:59:06,644 INFO L78 Accepts]: Start accepts. Automaton has 15831 states and 25970 transitions. Word has length 709 [2024-12-02 14:59:06,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:59:06,645 INFO L471 AbstractCegarLoop]: Abstraction has 15831 states and 25970 transitions. [2024-12-02 14:59:06,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-12-02 14:59:06,645 INFO L276 IsEmpty]: Start isEmpty. Operand 15831 states and 25970 transitions. [2024-12-02 14:59:06,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2024-12-02 14:59:06,655 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:59:06,656 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:59:06,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 14:59:06,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-12-02 14:59:06,856 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:59:06,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:59:06,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1568956850, now seen corresponding path program 1 times [2024-12-02 14:59:06,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:59:06,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997546425] [2024-12-02 14:59:06,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:59:06,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:59:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:59:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2024-12-02 14:59:07,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:59:07,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997546425] [2024-12-02 14:59:07,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997546425] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:59:07,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:59:07,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:59:07,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443080610] [2024-12-02 14:59:07,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:59:07,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:59:07,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:59:07,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:59:07,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:59:07,616 INFO L87 Difference]: Start difference. First operand 15831 states and 25970 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-12-02 14:59:08,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:59:08,725 INFO L93 Difference]: Finished difference Result 35825 states and 58653 transitions. [2024-12-02 14:59:08,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:59:08,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 710 [2024-12-02 14:59:08,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:59:08,777 INFO L225 Difference]: With dead ends: 35825 [2024-12-02 14:59:08,777 INFO L226 Difference]: Without dead ends: 20034 [2024-12-02 14:59:08,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:59:08,797 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 348 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:59:08,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1285 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:59:08,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20034 states. [2024-12-02 14:59:10,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20034 to 19903. [2024-12-02 14:59:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19903 states, 16854 states have (on average 1.5848463272813575) internal successors, (26711), 16921 states have internal predecessors, (26711), 2879 states have call successors, (2879), 169 states have call predecessors, (2879), 169 states have return successors, (2879), 2812 states have call predecessors, (2879), 2879 states have call successors, (2879) [2024-12-02 14:59:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19903 states to 19903 states and 32469 transitions. [2024-12-02 14:59:10,316 INFO L78 Accepts]: Start accepts. Automaton has 19903 states and 32469 transitions. Word has length 710 [2024-12-02 14:59:10,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:59:10,317 INFO L471 AbstractCegarLoop]: Abstraction has 19903 states and 32469 transitions. [2024-12-02 14:59:10,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-12-02 14:59:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand 19903 states and 32469 transitions. [2024-12-02 14:59:10,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2024-12-02 14:59:10,343 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:59:10,344 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:59:10,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 14:59:10,344 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:59:10,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:59:10,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1342183195, now seen corresponding path program 1 times [2024-12-02 14:59:10,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:59:10,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092509415] [2024-12-02 14:59:10,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:59:10,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:59:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:59:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2024-12-02 14:59:10,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:59:10,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092509415] [2024-12-02 14:59:10,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092509415] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:59:10,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:59:10,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:59:10,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675583271] [2024-12-02 14:59:10,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:59:10,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:59:10,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:59:10,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:59:10,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:59:10,748 INFO L87 Difference]: Start difference. First operand 19903 states and 32469 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-12-02 14:59:12,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:59:12,534 INFO L93 Difference]: Finished difference Result 57940 states and 94262 transitions. [2024-12-02 14:59:12,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:59:12,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 710 [2024-12-02 14:59:12,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:59:12,606 INFO L225 Difference]: With dead ends: 57940 [2024-12-02 14:59:12,606 INFO L226 Difference]: Without dead ends: 38097 [2024-12-02 14:59:12,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:59:12,635 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 496 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:59:12,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1073 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:59:12,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38097 states. [2024-12-02 14:59:13,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38097 to 22117. [2024-12-02 14:59:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22117 states, 19068 states have (on average 1.5857457520453115) internal successors, (30237), 19135 states have internal predecessors, (30237), 2879 states have call successors, (2879), 169 states have call predecessors, (2879), 169 states have return successors, (2879), 2812 states have call predecessors, (2879), 2879 states have call successors, (2879) [2024-12-02 14:59:14,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22117 states to 22117 states and 35995 transitions. [2024-12-02 14:59:14,063 INFO L78 Accepts]: Start accepts. Automaton has 22117 states and 35995 transitions. Word has length 710 [2024-12-02 14:59:14,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:59:14,064 INFO L471 AbstractCegarLoop]: Abstraction has 22117 states and 35995 transitions. [2024-12-02 14:59:14,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-12-02 14:59:14,064 INFO L276 IsEmpty]: Start isEmpty. Operand 22117 states and 35995 transitions. [2024-12-02 14:59:14,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2024-12-02 14:59:14,136 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:59:14,136 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:59:14,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 14:59:14,137 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:59:14,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:59:14,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1286095579, now seen corresponding path program 1 times [2024-12-02 14:59:14,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:59:14,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676471578] [2024-12-02 14:59:14,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:59:14,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:59:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-02 14:59:15,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [132787251] [2024-12-02 14:59:15,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:59:15,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:59:15,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:59:15,145 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:59:15,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 14:59:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:59:15,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 1606 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-02 14:59:15,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:59:19,652 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 13440 proven. 255 refuted. 0 times theorem prover too weak. 10285 trivial. 0 not checked. [2024-12-02 14:59:19,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:59:35,052 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~var_1_66~0 256))) (let ((.cse175 (+ c_~var_1_65~0 1)) (.cse36 (+ |c_ULTIMATE.start_step_#t~bitwise5#1| 2)) (.cse5 (mod c_~var_1_73~0 65536)) (.cse15 (+ |c_ULTIMATE.start_step_#t~bitwise5#1| 1)) (.cse6 (* (- 1) .cse3))) (let ((.cse11 (forall ((v_z_3 Int)) (let ((.cse217 (+ .cse6 v_z_3))) (let ((.cse218 (div .cse217 c_~var_1_65~0))) (or (< (div .cse217 .cse5) .cse15) (< v_z_3 0) (= .cse218 .cse15) (< 8 v_z_3) (< .cse218 .cse15)))))) (.cse1 (forall ((v_z_3 Int)) (let ((.cse216 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse216 .cse5) 0) (< (div .cse216 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse18 (forall ((v_z_3 Int)) (or (< v_z_3 .cse3) (< 8 v_z_3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse15)))) (.cse48 (forall ((v_z_3 Int)) (let ((.cse215 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse215 .cse5) 0) (< (div .cse215 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (< (div .cse215 c_~var_1_65~0) .cse15))))) (.cse16 (forall ((v_z_3 Int)) (let ((.cse214 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse214 c_~var_1_65~0))) (< v_z_3 0) (< 8 v_z_3) (< (div .cse214 c_~var_1_65~0) .cse15))))) (.cse29 (forall ((v_z_3 Int)) (let ((.cse213 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse213 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse213 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse213 c_~var_1_65~0) .cse15))))) (.cse56 (forall ((v_z_3 Int)) (let ((.cse211 (+ .cse6 v_z_3))) (let ((.cse212 (div .cse211 c_~var_1_65~0))) (or (not (= 0 (mod .cse211 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse211 .cse5) 0) (< v_z_3 0) (= .cse212 .cse15) (< 8 v_z_3) (< .cse212 .cse15)))))) (.cse99 (forall ((v_z_3 Int)) (let ((.cse209 (+ .cse6 v_z_3))) (let ((.cse210 (div .cse209 c_~var_1_65~0))) (or (not (= 0 (mod .cse209 c_~var_1_65~0))) (< (div .cse209 .cse5) .cse15) (= (mod .cse209 .cse5) 0) (< v_z_3 0) (= .cse210 .cse15) (< 8 v_z_3) (< .cse210 .cse15)))))) (.cse23 (forall ((v_z_3 Int)) (let ((.cse207 (+ .cse6 v_z_3))) (let ((.cse208 (div .cse207 c_~var_1_65~0))) (or (not (= 0 (mod .cse207 c_~var_1_65~0))) (= (mod .cse207 .cse5) 0) (< v_z_3 0) (= .cse208 .cse15) (< 8 v_z_3) (< .cse208 .cse15)))))) (.cse43 (forall ((v_z_3 Int)) (let ((.cse206 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse206 c_~var_1_65~0))) (not (= (mod .cse206 .cse5) 0)) (< (div .cse206 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3))))) (.cse72 (forall ((v_z_3 Int)) (let ((.cse205 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse205 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse205 c_~var_1_65~0)))))) (.cse74 (forall ((v_z_3 Int)) (let ((.cse204 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (not (= (mod .cse204 .cse5) 0)) (< (div .cse204 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse204 c_~var_1_65~0)))))) (.cse61 (forall ((v_z_3 Int)) (let ((.cse203 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse203 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse203 .cse5) 0) (< (div .cse203 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse94 (forall ((v_z_3 Int)) (let ((.cse202 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse202 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse202 .cse5) 0) (< (div .cse202 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) (.cse97 (forall ((v_z_3 Int)) (let ((.cse200 (+ .cse6 v_z_3))) (let ((.cse201 (div .cse200 .cse5))) (or (not (= 0 (mod .cse200 c_~var_1_65~0))) (< .cse201 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse201) (< 8 v_z_3)))))) (.cse120 (forall ((v_z_3 Int)) (let ((.cse198 (+ .cse6 v_z_3))) (let ((.cse199 (div .cse198 .cse5))) (or (not (= 0 (mod .cse198 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse198 .cse5) 0) (< .cse199 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse199) (< 8 v_z_3) (< (div .cse198 c_~var_1_65~0) .cse15)))))) (.cse90 (forall ((v_z_3 Int)) (let ((.cse196 (+ .cse6 v_z_3))) (let ((.cse197 (div .cse196 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse196 .cse5) 0) (= .cse197 .cse15) (< 8 v_z_3) (< .cse197 .cse15)))))) (.cse26 (forall ((v_z_3 Int)) (let ((.cse194 (+ .cse6 v_z_3))) (let ((.cse195 (div .cse194 c_~var_1_65~0))) (or (= (mod .cse194 .cse5) 0) (< v_z_3 0) (= .cse195 .cse15) (< 8 v_z_3) (< .cse195 .cse15)))))) (.cse28 (forall ((v_z_3 Int)) (let ((.cse192 (+ .cse6 v_z_3))) (let ((.cse193 (div .cse192 c_~var_1_65~0))) (or (< (div .cse192 .cse5) .cse15) (= (mod .cse192 .cse5) 0) (< v_z_3 0) (= .cse193 .cse15) (< 8 v_z_3) (< .cse193 .cse15)))))) (.cse54 (forall ((v_z_3 Int)) (let ((.cse191 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse191 .cse5) 0) (< (div .cse191 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse191 c_~var_1_65~0)))))) (.cse133 (forall ((v_z_3 Int)) (let ((.cse189 (+ .cse6 v_z_3))) (let ((.cse190 (div .cse189 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse189 .cse5) 0) (< (div .cse189 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= .cse190 .cse15) (< 8 v_z_3) (< .cse190 .cse15)))))) (.cse27 (forall ((v_z_3 Int)) (let ((.cse187 (+ .cse6 v_z_3))) (let ((.cse188 (div .cse187 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse187 .cse5) 0) (< v_z_3 0) (= .cse188 .cse15) (< 8 v_z_3) (< .cse188 .cse15)))))) (.cse79 (forall ((v_z_3 Int)) (let ((.cse186 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse186 c_~var_1_65~0))) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse186 c_~var_1_65~0) .cse15))))) (.cse10 (forall ((v_z_3 Int)) (let ((.cse185 (div (+ .cse6 v_z_3) c_~var_1_65~0))) (or (< v_z_3 0) (= .cse185 .cse15) (< 8 v_z_3) (< .cse185 .cse15))))) (.cse107 (forall ((v_z_3 Int)) (let ((.cse184 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse184 c_~var_1_65~0))) (not (= (mod .cse184 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse184 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse108 (forall ((v_z_3 Int)) (let ((.cse183 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse183 c_~var_1_65~0))) (< v_z_3 .cse3) (< (div .cse183 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse89 (forall ((v_z_3 Int)) (let ((.cse181 (+ .cse6 v_z_3))) (let ((.cse182 (div .cse181 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse181 .cse5) 0) (< .cse182 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse182) (< 8 v_z_3) (< (div .cse181 c_~var_1_65~0) .cse15)))))) (.cse98 (forall ((v_z_3 Int)) (let ((.cse180 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse180 c_~var_1_65~0))) (not (= (mod .cse180 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse180 c_~var_1_65~0) .cse15))))) (.cse30 (forall ((v_z_3 Int)) (or (< v_z_3 .cse3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (.cse34 (forall ((v_z_3 Int)) (let ((.cse179 (+ .cse6 v_z_3))) (or (not (= (mod .cse179 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse179 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse21 (< c_~var_1_65~0 .cse5)) (.cse37 (forall ((v_z_3 Int)) (let ((.cse178 (+ .cse6 v_z_3))) (or (< (div .cse178 .cse5) .cse15) (not (= (mod .cse178 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse178 c_~var_1_65~0) .cse15))))) (.cse159 (forall ((v_z_3 Int)) (let ((.cse177 (+ .cse6 v_z_3))) (or (not (= (mod .cse177 .cse5) 0)) (< (div .cse177 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3))))) (.cse0 (< .cse5 .cse175)) (.cse49 (forall ((v_z_3 Int)) (let ((.cse176 (+ .cse6 v_z_3))) (or (< (div .cse176 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse176 .cse5) 0) (< 8 v_z_3) (< (div .cse176 c_~var_1_65~0) .cse15))))) (.cse7 (< c_~var_1_65~0 0)) (.cse9 (< 0 .cse175)) (.cse8 (forall ((v_z_3 Int)) (let ((.cse173 (+ .cse6 v_z_3))) (let ((.cse174 (div .cse173 c_~var_1_65~0))) (or (not (= 0 (mod .cse173 c_~var_1_65~0))) (< v_z_3 0) (= .cse174 .cse15) (< 8 v_z_3) (< .cse174 .cse15)))))) (.cse102 (forall ((v_z_3 Int)) (let ((.cse171 (+ .cse6 v_z_3))) (let ((.cse172 (div .cse171 c_~var_1_65~0))) (or (not (= 0 (mod .cse171 c_~var_1_65~0))) (< (div .cse171 .cse5) .cse15) (< v_z_3 0) (= .cse172 .cse15) (< 8 v_z_3) (< .cse172 .cse15))))))) (and (or .cse0 (and .cse1 (or (forall ((v_z_3 Int)) (let ((.cse4 (+ .cse6 v_z_3))) (let ((.cse2 (div .cse4 c_~var_1_65~0))) (or (< .cse2 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= (mod .cse4 .cse5) 0) (= .cse2 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7))) (or .cse0 .cse8) (or .cse9 (and .cse10 .cse11)) (forall ((v_z_3 Int)) (let ((.cse12 (+ .cse6 v_z_3))) (let ((.cse13 (div .cse12 .cse5)) (.cse14 (div .cse12 c_~var_1_65~0))) (or (= (mod .cse12 .cse5) 0) (< .cse13 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse13) (= .cse14 .cse15) (< 8 v_z_3) (< .cse14 .cse15))))) (or .cse0 .cse16) (forall ((v_z_3 Int)) (let ((.cse17 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse17 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse17 .cse5) 0) (< (div .cse17 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (< (div .cse17 c_~var_1_65~0) .cse15)))) (or .cse18 .cse9) (or (forall ((v_z_3 Int)) (let ((.cse19 (+ .cse6 v_z_3))) (let ((.cse20 (div .cse19 c_~var_1_65~0))) (or (not (= (mod .cse19 .cse5) 0)) (< v_z_3 0) (= .cse20 .cse15) (< 8 v_z_3) (< .cse20 .cse15))))) .cse0) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse22 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse22 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse22 c_~var_1_65~0)))))) (or .cse23 .cse0) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse24 (+ .cse6 v_z_3))) (let ((.cse25 (div .cse24 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse24 .cse5) .cse15) (= (mod .cse24 .cse5) 0) (< v_z_3 0) (= .cse25 .cse15) (< 8 v_z_3) (< .cse25 .cse15))))) .cse10 .cse26 .cse27 .cse28 .cse11)) (or .cse1 .cse9) (or (and .cse29 .cse16) .cse9) (or (and .cse30 (or (forall ((v_z_3 Int)) (let ((.cse31 (div (+ .cse6 v_z_3) c_~var_1_65~0))) (or (< .cse31 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= .cse31 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3)))) .cse7) (or (forall ((v_z_3 Int)) (let ((.cse33 (+ .cse6 v_z_3))) (let ((.cse32 (div .cse33 c_~var_1_65~0))) (or (< .cse32 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse33 .cse5) 0)) (< v_z_3 .cse3) (= .cse32 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7) .cse34) .cse0) (forall ((v_z_3 Int)) (let ((.cse35 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse35 c_~var_1_65~0))) (< (div .cse35 .cse5) .cse15) (< v_z_3 .cse3) (< (div .cse35 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (or .cse37 .cse7) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse38 (+ .cse6 v_z_3))) (let ((.cse39 (div .cse38 c_~var_1_65~0))) (or (not (= 0 (mod .cse38 c_~var_1_65~0))) (< (div .cse38 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse39 .cse15) (< 8 v_z_3) (< .cse39 .cse15)))))) (forall ((v_z_3 Int)) (let ((.cse40 (+ .cse6 v_z_3))) (let ((.cse41 (div .cse40 .cse5)) (.cse42 (div .cse40 c_~var_1_65~0))) (or (not (= 0 (mod .cse40 c_~var_1_65~0))) (< .cse41 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse41) (= .cse42 .cse15) (< 8 v_z_3) (< .cse42 .cse15))))) (or .cse9 .cse43) (forall ((v_z_3 Int)) (let ((.cse44 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse44 c_~var_1_65~0))) (< (div .cse44 .cse5) .cse15) (not (= (mod .cse44 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse44 c_~var_1_65~0) .cse15)))) (forall ((v_z_3 Int)) (let ((.cse45 (+ .cse6 v_z_3))) (let ((.cse46 (div .cse45 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse45 .cse5) 0) (< (div .cse45 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse46 .cse15) (< 8 v_z_3) (< .cse46 .cse15))))) (or (and (or .cse0 (forall ((v_z_3 Int)) (let ((.cse47 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse47 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse47 c_~var_1_65~0) .cse15))))) .cse48) .cse7) (or (and .cse49 (or .cse0 (forall ((v_z_3 Int)) (let ((.cse50 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse50 .cse5) 0) (< 8 v_z_3) (< (div .cse50 c_~var_1_65~0) .cse15)))))) .cse7) (or .cse18 .cse0) (or .cse21 .cse48) (forall ((v_z_3 Int)) (let ((.cse51 (+ .cse6 v_z_3))) (let ((.cse52 (div .cse51 .cse5)) (.cse53 (div .cse51 c_~var_1_65~0))) (or (not (= 0 (mod .cse51 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse51 .cse5) 0) (< .cse52 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse52) (= .cse53 .cse15) (< 8 v_z_3) (< .cse53 .cse15))))) (or (and .cse54 (or (forall ((v_z_3 Int)) (let ((.cse55 (+ .cse6 v_z_3))) (or (< (div .cse55 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (= (mod .cse55 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse55 c_~var_1_65~0))))) .cse7)) .cse0) (or .cse56 .cse0) (forall ((v_z_3 Int)) (let ((.cse57 (+ .cse6 v_z_3))) (let ((.cse58 (div .cse57 .cse5)) (.cse59 (div .cse57 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse57 .cse5) 0) (< .cse58 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse58) (= .cse59 .cse15) (< 8 v_z_3) (< .cse59 .cse15))))) (or (and (forall ((v_z_3 Int)) (let ((.cse60 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse60 c_~var_1_65~0))) (< (div .cse60 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse60 .cse5) 0) (< (div .cse60 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) .cse61) .cse9) (forall ((v_z_3 Int)) (let ((.cse62 (+ .cse6 v_z_3))) (let ((.cse63 (div .cse62 c_~var_1_65~0))) (or (not (= 0 (mod .cse62 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse62 .cse5) 0) (< (div .cse62 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse63 .cse15) (< 8 v_z_3) (< .cse63 .cse15))))) (forall ((v_z_3 Int)) (let ((.cse64 (+ .cse6 v_z_3))) (let ((.cse65 (div .cse64 c_~var_1_65~0))) (or (not (= 0 (mod .cse64 c_~var_1_65~0))) (< (div .cse64 .cse5) .cse15) (not (= (mod .cse64 .cse5) 0)) (< v_z_3 0) (= .cse65 .cse15) (< 8 v_z_3) (< .cse65 .cse15))))) (or .cse9 .cse16) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse66 (+ .cse6 v_z_3))) (let ((.cse67 (div .cse66 .cse5))) (or (not (= 0 (mod .cse66 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse66 .cse5) 0) (< .cse67 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse67) (< 8 v_z_3)))))) (forall ((v_z_3 Int)) (let ((.cse68 (+ .cse6 v_z_3))) (let ((.cse69 (div .cse68 c_~var_1_65~0))) (or (< (div .cse68 .cse5) .cse15) (not (= (mod .cse68 .cse5) 0)) (< v_z_3 0) (= .cse69 .cse15) (< 8 v_z_3) (< .cse69 .cse15))))) (forall ((v_z_3 Int)) (let ((.cse70 (+ .cse6 v_z_3))) (or (< (div .cse70 .cse5) .cse15) (< v_z_3 .cse3) (< (div .cse70 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse71 (+ .cse6 v_z_3))) (or (< (div .cse71 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse71 .cse5) 0) (< (div .cse71 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (or (and .cse72 (or (forall ((v_z_3 Int)) (let ((.cse73 (+ .cse6 v_z_3))) (or (< (div .cse73 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (not (= (mod .cse73 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse73 c_~var_1_65~0))))) .cse7) .cse74 (or (forall ((v_z_3 Int)) (let ((.cse75 (+ .cse6 v_z_3))) (or (< (div .cse75 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse75 c_~var_1_65~0))))) .cse7)) .cse0) (forall ((v_z_3 Int)) (let ((.cse78 (+ .cse6 v_z_3))) (let ((.cse76 (div .cse78 .cse5)) (.cse77 (div .cse78 c_~var_1_65~0))) (or (< .cse76 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse76) (= .cse77 .cse15) (< 8 v_z_3) (< .cse77 .cse15))))) (or .cse29 .cse0) (or .cse79 .cse0) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse80 (+ .cse6 v_z_3))) (let ((.cse81 (div .cse80 .cse5))) (or (not (= 0 (mod .cse80 c_~var_1_65~0))) (= (mod .cse80 .cse5) 0) (< .cse81 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse81) (< 8 v_z_3) (< (div .cse80 c_~var_1_65~0) .cse15)))))) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse82 (+ .cse6 v_z_3))) (let ((.cse83 (div .cse82 .cse5))) (or (not (= 0 (mod .cse82 c_~var_1_65~0))) (< .cse83 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse83) (< 8 v_z_3) (< (div .cse82 c_~var_1_65~0) .cse15)))))) (or (forall ((v_z_3 Int)) (let ((.cse84 (+ .cse6 v_z_3))) (or (< (div .cse84 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (< (div .cse84 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse84 c_~var_1_65~0))))) .cse7) (or (forall ((v_z_3 Int)) (let ((.cse85 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse85 c_~var_1_65~0))) (< (div .cse85 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3)))) .cse21) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse86 (+ .cse6 v_z_3))) (or (< (div .cse86 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse86 .cse5) 0) (< 8 v_z_3))))) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse88 (+ .cse6 v_z_3))) (let ((.cse87 (div .cse88 .cse5))) (or (< .cse87 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse87) (< 8 v_z_3) (< (div .cse88 c_~var_1_65~0) .cse15)))))) (or .cse21 .cse89) (or .cse56 .cse9) (or .cse0 .cse26) (or .cse90 .cse0) (forall ((v_z_3 Int)) (let ((.cse91 (+ .cse6 v_z_3))) (let ((.cse92 (div .cse91 .cse5)) (.cse93 (div .cse91 c_~var_1_65~0))) (or (not (= 0 (mod .cse91 c_~var_1_65~0))) (= (mod .cse91 .cse5) 0) (< .cse92 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse92) (= .cse93 .cse15) (< 8 v_z_3) (< .cse93 .cse15))))) (or .cse21 (and .cse94 (forall ((v_z_3 Int)) (let ((.cse95 (+ .cse6 v_z_3))) (let ((.cse96 (div .cse95 .cse5))) (or (not (= 0 (mod .cse95 c_~var_1_65~0))) (= (mod .cse95 .cse5) 0) (< .cse96 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse96) (< 8 v_z_3))))) .cse97)) (or .cse9 .cse98) (or (and .cse99 .cse23) .cse9) (or (and (forall ((v_z_3 Int)) (let ((.cse100 (+ .cse6 v_z_3))) (let ((.cse101 (div .cse100 c_~var_1_65~0))) (or (not (= 0 (mod .cse100 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (< (div .cse100 .cse5) .cse15) (= (mod .cse100 .cse5) 0) (< v_z_3 0) (= .cse101 .cse15) (< 8 v_z_3) (< .cse101 .cse15))))) .cse56 .cse99 .cse23 .cse8 .cse102) .cse9) (or (and .cse43 (or (forall ((v_z_3 Int)) (let ((.cse103 (+ .cse6 v_z_3))) (let ((.cse104 (div .cse103 c_~var_1_65~0))) (or (not (= 0 (mod .cse103 c_~var_1_65~0))) (< .cse104 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse103 .cse5) 0)) (= .cse104 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) .cse7)) .cse0) (or (and (or (forall ((v_z_3 Int)) (let ((.cse105 (+ .cse6 v_z_3))) (let ((.cse106 (div .cse105 c_~var_1_65~0))) (or (not (= 0 (mod .cse105 c_~var_1_65~0))) (< .cse106 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse105 .cse5) 0)) (< v_z_3 .cse3) (= .cse106 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7) .cse107 .cse108 (or (forall ((v_z_3 Int)) (let ((.cse109 (+ .cse6 v_z_3))) (let ((.cse110 (div .cse109 c_~var_1_65~0))) (or (not (= 0 (mod .cse109 c_~var_1_65~0))) (< .cse110 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= .cse110 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7)) .cse0) (or (and .cse72 (forall ((v_z_3 Int)) (let ((.cse112 (+ .cse6 v_z_3))) (let ((.cse111 (div .cse112 .cse5))) (or (< .cse3 (+ v_z_3 1)) (< .cse111 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse112 c_~var_1_65~0) .cse36) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse111) (< 8 v_z_3) (= 0 (mod .cse112 c_~var_1_65~0)))))) (forall ((v_z_3 Int)) (let ((.cse113 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse113 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse113 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse113 c_~var_1_65~0))))) .cse74 (forall ((v_z_3 Int)) (let ((.cse114 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse114 .cse5) .cse15) (not (= (mod .cse114 .cse5) 0)) (< (div .cse114 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse114 c_~var_1_65~0)))))) .cse9) (or .cse0 (and .cse61 (or (forall ((v_z_3 Int)) (let ((.cse115 (+ .cse6 v_z_3))) (let ((.cse116 (div .cse115 c_~var_1_65~0))) (or (not (= 0 (mod .cse115 c_~var_1_65~0))) (< .cse116 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= (mod .cse115 .cse5) 0) (= .cse116 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7))) (or .cse21 (and .cse94 .cse97)) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse117 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse117 c_~var_1_65~0))) (< (div .cse117 .cse5) .cse15) (not (= (mod .cse117 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3))))) (or (forall ((v_z_3 Int)) (or (< (div (+ .cse6 v_z_3) .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3))) .cse21) (or (forall ((v_z_3 Int)) (let ((.cse118 (+ .cse6 v_z_3))) (let ((.cse119 (div .cse118 c_~var_1_65~0))) (or (not (= 0 (mod .cse118 c_~var_1_65~0))) (not (= (mod .cse118 .cse5) 0)) (< v_z_3 0) (= .cse119 .cse15) (< 8 v_z_3) (< .cse119 .cse15))))) .cse0) (or .cse21 .cse120) (or .cse21 (and (forall ((v_z_3 Int)) (let ((.cse121 (+ .cse6 v_z_3))) (let ((.cse122 (div .cse121 .cse5))) (or (= (mod .cse121 .cse5) 0) (< .cse122 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse122) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse123 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse123 .cse5) 0) (< (div .cse123 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse124 (div (+ .cse6 v_z_3) .cse5))) (or (< .cse124 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse124) (< 8 v_z_3)))))) (or .cse120 .cse7) (or .cse9 (and .cse90 (forall ((v_z_3 Int)) (let ((.cse125 (+ .cse6 v_z_3))) (let ((.cse126 (div .cse125 c_~var_1_65~0))) (or (< (div .cse125 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse125 .cse5) 0) (= .cse126 .cse15) (< 8 v_z_3) (< .cse126 .cse15))))))) (forall ((v_z_3 Int)) (let ((.cse127 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse127 .cse5) .cse15) (< (div .cse127 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse127 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse128 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse128 .cse5) 0) (< (div .cse128 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse128 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse128 c_~var_1_65~0))))) (or (and .cse26 .cse28) .cse9) (or .cse0 .cse27) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse129 (+ .cse6 v_z_3))) (let ((.cse130 (div .cse129 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse129 .cse5) 0) (< .cse130 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse130) (< 8 v_z_3)))))) (or (forall ((v_z_3 Int)) (let ((.cse131 (+ .cse6 v_z_3))) (let ((.cse132 (div .cse131 c_~var_1_65~0))) (or (not (= 0 (mod .cse131 c_~var_1_65~0))) (= (mod .cse131 .cse5) 0) (< (div .cse131 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse132 .cse15) (< 8 v_z_3) (< .cse132 .cse15))))) .cse0) (or .cse54 .cse9) (or .cse133 .cse0) (or (and .cse133 (or (forall ((v_z_3 Int)) (let ((.cse134 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse134 .cse5) 0) (< (div .cse134 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3) (< (div .cse134 c_~var_1_65~0) .cse15)))) .cse7)) .cse0) (or .cse9 .cse27) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse135 (+ .cse6 v_z_3))) (let ((.cse136 (div .cse135 .cse5))) (or (= (mod .cse135 .cse5) 0) (< .cse136 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse136) (< 8 v_z_3) (< (div .cse135 c_~var_1_65~0) .cse15)))))) (or .cse9 .cse79) (or .cse10 .cse0) (or (and (or (forall ((v_z_3 Int)) (let ((.cse137 (+ .cse6 v_z_3))) (or (not (= (mod .cse137 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse137 c_~var_1_65~0) .cse15)))) .cse0) .cse37) .cse7) (or (and (or (forall ((v_z_3 Int)) (or (< v_z_3 0) (< 8 v_z_3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse15))) .cse0) (forall ((v_z_3 Int)) (let ((.cse138 (+ .cse6 v_z_3))) (or (< (div .cse138 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (< (div .cse138 c_~var_1_65~0) .cse15))))) .cse7) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse139 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse139 .cse5) 0) (< (div .cse139 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse139 c_~var_1_65~0)))))) (forall ((v_z_3 Int)) (let ((.cse140 (+ .cse6 v_z_3))) (or (< (div .cse140 .cse5) .cse15) (not (= (mod .cse140 .cse5) 0)) (< (div .cse140 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3)))) (or (and (forall ((v_z_3 Int)) (let ((.cse141 (+ .cse6 v_z_3))) (let ((.cse142 (div .cse141 .cse5))) (or (not (= 0 (mod .cse141 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse141 .cse5) 0) (< .cse142 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse141 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse142) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse143 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse143 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse143 .cse5) 0) (< (div .cse143 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse143 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) .cse9) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse144 (+ .cse6 v_z_3))) (let ((.cse145 (div .cse144 c_~var_1_65~0))) (or (< (div .cse144 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse145 .cse15) (< 8 v_z_3) (< .cse145 .cse15)))))) (or (forall ((v_z_3 Int)) (let ((.cse146 (+ .cse6 v_z_3))) (or (< (div .cse146 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (= (mod .cse146 .cse5) 0) (< (div .cse146 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse146 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse147 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse147 c_~var_1_65~0))) (< (div .cse147 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse147 c_~var_1_65~0) .cse15)))) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse148 (+ .cse6 v_z_3))) (let ((.cse149 (div .cse148 .cse5))) (or (not (= 0 (mod .cse148 c_~var_1_65~0))) (< v_z_3 .cse3) (< .cse149 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse148 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse149) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse150 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse150 c_~var_1_65~0))) (< v_z_3 .cse3) (< (div .cse150 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse150 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) .cse107 .cse108 (forall ((v_z_3 Int)) (let ((.cse151 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse151 c_~var_1_65~0))) (< (div .cse151 .cse5) .cse15) (not (= (mod .cse151 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse151 c_~var_1_65~0) .cse36) (< 8 v_z_3)))))) (or .cse89 .cse7) (or (forall ((v_z_3 Int)) (let ((.cse152 (+ .cse6 v_z_3))) (or (< (div .cse152 .cse5) .cse15) (not (= (mod .cse152 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3)))) .cse21) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse153 (+ .cse6 v_z_3))) (let ((.cse154 (div .cse153 c_~var_1_65~0))) (or (= (mod .cse153 .cse5) 0) (< (div .cse153 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse154 .cse15) (< 8 v_z_3) (< .cse154 .cse15)))))) (or .cse0 (and (or (forall ((v_z_3 Int)) (let ((.cse155 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse155 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse155 .cse5) 0) (< (div .cse155 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3) (< (div .cse155 c_~var_1_65~0) .cse15)))) .cse7) (forall ((v_z_3 Int)) (let ((.cse156 (+ .cse6 v_z_3))) (let ((.cse157 (div .cse156 c_~var_1_65~0))) (or (not (= 0 (mod .cse156 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse156 .cse5) 0) (< (div .cse156 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= .cse157 .cse15) (< 8 v_z_3) (< .cse157 .cse15))))))) (forall ((v_z_3 Int)) (let ((.cse158 (+ .cse6 v_z_3))) (or (< (div .cse158 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse158 c_~var_1_65~0) .cse15)))) (or .cse159 .cse9) (forall ((v_z_3 Int)) (let ((.cse160 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse160 c_~var_1_65~0))) (< (div .cse160 .cse5) .cse15) (not (= (mod .cse160 .cse5) 0)) (< (div .cse160 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3)))) (or .cse98 .cse0) (or .cse9 (and .cse30 (forall ((v_z_3 Int)) (let ((.cse161 (+ .cse6 v_z_3))) (or (< (div .cse161 .cse5) .cse15) (not (= (mod .cse161 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse161 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse163 (+ .cse6 v_z_3))) (let ((.cse162 (div .cse163 .cse5))) (or (< v_z_3 .cse3) (< .cse162 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse163 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse162) (< 8 v_z_3))))) .cse34 (forall ((v_z_3 Int)) (let ((.cse164 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (< (div .cse164 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse164 c_~var_1_65~0) .cse36) (< 8 v_z_3)))))) (or .cse21 .cse37) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse165 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse165 .cse5) 0) (< (div .cse165 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse165 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse166 (+ .cse6 v_z_3))) (let ((.cse167 (div .cse166 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse166 .cse5) 0) (< .cse167 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse166 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse167) (< 8 v_z_3))))))) (or (and .cse159 (or (forall ((v_z_3 Int)) (let ((.cse169 (+ .cse6 v_z_3))) (let ((.cse168 (div .cse169 c_~var_1_65~0))) (or (< .cse168 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse169 .cse5) 0)) (= .cse168 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) .cse7)) .cse0) (or .cse49 .cse7) (or .cse9 (and .cse8 .cse102)) (forall ((v_z_3 Int)) (let ((.cse170 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse170 c_~var_1_65~0))) (< (div .cse170 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (< (div .cse170 c_~var_1_65~0) .cse15)))))))) is different from false [2024-12-02 14:59:39,090 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~var_1_66~0 256))) (let ((.cse175 (+ c_~var_1_65~0 1)) (.cse36 (+ |c_ULTIMATE.start_step_#t~bitwise5#1| 2)) (.cse5 (mod c_~var_1_73~0 65536)) (.cse15 (+ |c_ULTIMATE.start_step_#t~bitwise5#1| 1)) (.cse6 (* (- 1) .cse3))) (let ((.cse11 (forall ((v_z_3 Int)) (let ((.cse217 (+ .cse6 v_z_3))) (let ((.cse218 (div .cse217 c_~var_1_65~0))) (or (< (div .cse217 .cse5) .cse15) (< v_z_3 0) (= .cse218 .cse15) (< 8 v_z_3) (< .cse218 .cse15)))))) (.cse1 (forall ((v_z_3 Int)) (let ((.cse216 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse216 .cse5) 0) (< (div .cse216 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse18 (forall ((v_z_3 Int)) (or (< v_z_3 .cse3) (< 8 v_z_3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse15)))) (.cse48 (forall ((v_z_3 Int)) (let ((.cse215 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse215 .cse5) 0) (< (div .cse215 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (< (div .cse215 c_~var_1_65~0) .cse15))))) (.cse16 (forall ((v_z_3 Int)) (let ((.cse214 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse214 c_~var_1_65~0))) (< v_z_3 0) (< 8 v_z_3) (< (div .cse214 c_~var_1_65~0) .cse15))))) (.cse29 (forall ((v_z_3 Int)) (let ((.cse213 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse213 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse213 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse213 c_~var_1_65~0) .cse15))))) (.cse56 (forall ((v_z_3 Int)) (let ((.cse211 (+ .cse6 v_z_3))) (let ((.cse212 (div .cse211 c_~var_1_65~0))) (or (not (= 0 (mod .cse211 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse211 .cse5) 0) (< v_z_3 0) (= .cse212 .cse15) (< 8 v_z_3) (< .cse212 .cse15)))))) (.cse99 (forall ((v_z_3 Int)) (let ((.cse209 (+ .cse6 v_z_3))) (let ((.cse210 (div .cse209 c_~var_1_65~0))) (or (not (= 0 (mod .cse209 c_~var_1_65~0))) (< (div .cse209 .cse5) .cse15) (= (mod .cse209 .cse5) 0) (< v_z_3 0) (= .cse210 .cse15) (< 8 v_z_3) (< .cse210 .cse15)))))) (.cse23 (forall ((v_z_3 Int)) (let ((.cse207 (+ .cse6 v_z_3))) (let ((.cse208 (div .cse207 c_~var_1_65~0))) (or (not (= 0 (mod .cse207 c_~var_1_65~0))) (= (mod .cse207 .cse5) 0) (< v_z_3 0) (= .cse208 .cse15) (< 8 v_z_3) (< .cse208 .cse15)))))) (.cse43 (forall ((v_z_3 Int)) (let ((.cse206 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse206 c_~var_1_65~0))) (not (= (mod .cse206 .cse5) 0)) (< (div .cse206 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3))))) (.cse72 (forall ((v_z_3 Int)) (let ((.cse205 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse205 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse205 c_~var_1_65~0)))))) (.cse74 (forall ((v_z_3 Int)) (let ((.cse204 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (not (= (mod .cse204 .cse5) 0)) (< (div .cse204 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse204 c_~var_1_65~0)))))) (.cse61 (forall ((v_z_3 Int)) (let ((.cse203 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse203 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse203 .cse5) 0) (< (div .cse203 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse94 (forall ((v_z_3 Int)) (let ((.cse202 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse202 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse202 .cse5) 0) (< (div .cse202 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) (.cse97 (forall ((v_z_3 Int)) (let ((.cse200 (+ .cse6 v_z_3))) (let ((.cse201 (div .cse200 .cse5))) (or (not (= 0 (mod .cse200 c_~var_1_65~0))) (< .cse201 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse201) (< 8 v_z_3)))))) (.cse120 (forall ((v_z_3 Int)) (let ((.cse198 (+ .cse6 v_z_3))) (let ((.cse199 (div .cse198 .cse5))) (or (not (= 0 (mod .cse198 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse198 .cse5) 0) (< .cse199 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse199) (< 8 v_z_3) (< (div .cse198 c_~var_1_65~0) .cse15)))))) (.cse90 (forall ((v_z_3 Int)) (let ((.cse196 (+ .cse6 v_z_3))) (let ((.cse197 (div .cse196 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse196 .cse5) 0) (= .cse197 .cse15) (< 8 v_z_3) (< .cse197 .cse15)))))) (.cse26 (forall ((v_z_3 Int)) (let ((.cse194 (+ .cse6 v_z_3))) (let ((.cse195 (div .cse194 c_~var_1_65~0))) (or (= (mod .cse194 .cse5) 0) (< v_z_3 0) (= .cse195 .cse15) (< 8 v_z_3) (< .cse195 .cse15)))))) (.cse28 (forall ((v_z_3 Int)) (let ((.cse192 (+ .cse6 v_z_3))) (let ((.cse193 (div .cse192 c_~var_1_65~0))) (or (< (div .cse192 .cse5) .cse15) (= (mod .cse192 .cse5) 0) (< v_z_3 0) (= .cse193 .cse15) (< 8 v_z_3) (< .cse193 .cse15)))))) (.cse54 (forall ((v_z_3 Int)) (let ((.cse191 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse191 .cse5) 0) (< (div .cse191 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse191 c_~var_1_65~0)))))) (.cse133 (forall ((v_z_3 Int)) (let ((.cse189 (+ .cse6 v_z_3))) (let ((.cse190 (div .cse189 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse189 .cse5) 0) (< (div .cse189 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= .cse190 .cse15) (< 8 v_z_3) (< .cse190 .cse15)))))) (.cse27 (forall ((v_z_3 Int)) (let ((.cse187 (+ .cse6 v_z_3))) (let ((.cse188 (div .cse187 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse187 .cse5) 0) (< v_z_3 0) (= .cse188 .cse15) (< 8 v_z_3) (< .cse188 .cse15)))))) (.cse79 (forall ((v_z_3 Int)) (let ((.cse186 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse186 c_~var_1_65~0))) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse186 c_~var_1_65~0) .cse15))))) (.cse10 (forall ((v_z_3 Int)) (let ((.cse185 (div (+ .cse6 v_z_3) c_~var_1_65~0))) (or (< v_z_3 0) (= .cse185 .cse15) (< 8 v_z_3) (< .cse185 .cse15))))) (.cse107 (forall ((v_z_3 Int)) (let ((.cse184 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse184 c_~var_1_65~0))) (not (= (mod .cse184 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse184 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse108 (forall ((v_z_3 Int)) (let ((.cse183 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse183 c_~var_1_65~0))) (< v_z_3 .cse3) (< (div .cse183 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse89 (forall ((v_z_3 Int)) (let ((.cse181 (+ .cse6 v_z_3))) (let ((.cse182 (div .cse181 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse181 .cse5) 0) (< .cse182 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse182) (< 8 v_z_3) (< (div .cse181 c_~var_1_65~0) .cse15)))))) (.cse98 (forall ((v_z_3 Int)) (let ((.cse180 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse180 c_~var_1_65~0))) (not (= (mod .cse180 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse180 c_~var_1_65~0) .cse15))))) (.cse30 (forall ((v_z_3 Int)) (or (< v_z_3 .cse3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (.cse34 (forall ((v_z_3 Int)) (let ((.cse179 (+ .cse6 v_z_3))) (or (not (= (mod .cse179 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse179 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse21 (< c_~var_1_65~0 .cse5)) (.cse37 (forall ((v_z_3 Int)) (let ((.cse178 (+ .cse6 v_z_3))) (or (< (div .cse178 .cse5) .cse15) (not (= (mod .cse178 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse178 c_~var_1_65~0) .cse15))))) (.cse159 (forall ((v_z_3 Int)) (let ((.cse177 (+ .cse6 v_z_3))) (or (not (= (mod .cse177 .cse5) 0)) (< (div .cse177 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3))))) (.cse0 (< .cse5 .cse175)) (.cse49 (forall ((v_z_3 Int)) (let ((.cse176 (+ .cse6 v_z_3))) (or (< (div .cse176 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse176 .cse5) 0) (< 8 v_z_3) (< (div .cse176 c_~var_1_65~0) .cse15))))) (.cse7 (< c_~var_1_65~0 0)) (.cse9 (< 0 .cse175)) (.cse8 (forall ((v_z_3 Int)) (let ((.cse173 (+ .cse6 v_z_3))) (let ((.cse174 (div .cse173 c_~var_1_65~0))) (or (not (= 0 (mod .cse173 c_~var_1_65~0))) (< v_z_3 0) (= .cse174 .cse15) (< 8 v_z_3) (< .cse174 .cse15)))))) (.cse102 (forall ((v_z_3 Int)) (let ((.cse171 (+ .cse6 v_z_3))) (let ((.cse172 (div .cse171 c_~var_1_65~0))) (or (not (= 0 (mod .cse171 c_~var_1_65~0))) (< (div .cse171 .cse5) .cse15) (< v_z_3 0) (= .cse172 .cse15) (< 8 v_z_3) (< .cse172 .cse15))))))) (and (or .cse0 (and .cse1 (or (forall ((v_z_3 Int)) (let ((.cse4 (+ .cse6 v_z_3))) (let ((.cse2 (div .cse4 c_~var_1_65~0))) (or (< .cse2 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= (mod .cse4 .cse5) 0) (= .cse2 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7))) (or .cse0 .cse8) (or .cse9 (and .cse10 .cse11)) (forall ((v_z_3 Int)) (let ((.cse12 (+ .cse6 v_z_3))) (let ((.cse13 (div .cse12 .cse5)) (.cse14 (div .cse12 c_~var_1_65~0))) (or (= (mod .cse12 .cse5) 0) (< .cse13 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse13) (= .cse14 .cse15) (< 8 v_z_3) (< .cse14 .cse15))))) (or .cse0 .cse16) (forall ((v_z_3 Int)) (let ((.cse17 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse17 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse17 .cse5) 0) (< (div .cse17 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (< (div .cse17 c_~var_1_65~0) .cse15)))) (or .cse18 .cse9) (or (forall ((v_z_3 Int)) (let ((.cse19 (+ .cse6 v_z_3))) (let ((.cse20 (div .cse19 c_~var_1_65~0))) (or (not (= (mod .cse19 .cse5) 0)) (< v_z_3 0) (= .cse20 .cse15) (< 8 v_z_3) (< .cse20 .cse15))))) .cse0) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse22 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse22 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse22 c_~var_1_65~0)))))) (or .cse23 .cse0) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse24 (+ .cse6 v_z_3))) (let ((.cse25 (div .cse24 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse24 .cse5) .cse15) (= (mod .cse24 .cse5) 0) (< v_z_3 0) (= .cse25 .cse15) (< 8 v_z_3) (< .cse25 .cse15))))) .cse10 .cse26 .cse27 .cse28 .cse11)) (or .cse1 .cse9) (or (and .cse29 .cse16) .cse9) (or (and .cse30 (or (forall ((v_z_3 Int)) (let ((.cse31 (div (+ .cse6 v_z_3) c_~var_1_65~0))) (or (< .cse31 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= .cse31 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3)))) .cse7) (or (forall ((v_z_3 Int)) (let ((.cse33 (+ .cse6 v_z_3))) (let ((.cse32 (div .cse33 c_~var_1_65~0))) (or (< .cse32 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse33 .cse5) 0)) (< v_z_3 .cse3) (= .cse32 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7) .cse34) .cse0) (forall ((v_z_3 Int)) (let ((.cse35 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse35 c_~var_1_65~0))) (< (div .cse35 .cse5) .cse15) (< v_z_3 .cse3) (< (div .cse35 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (or .cse37 .cse7) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse38 (+ .cse6 v_z_3))) (let ((.cse39 (div .cse38 c_~var_1_65~0))) (or (not (= 0 (mod .cse38 c_~var_1_65~0))) (< (div .cse38 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse39 .cse15) (< 8 v_z_3) (< .cse39 .cse15)))))) (forall ((v_z_3 Int)) (let ((.cse40 (+ .cse6 v_z_3))) (let ((.cse41 (div .cse40 .cse5)) (.cse42 (div .cse40 c_~var_1_65~0))) (or (not (= 0 (mod .cse40 c_~var_1_65~0))) (< .cse41 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse41) (= .cse42 .cse15) (< 8 v_z_3) (< .cse42 .cse15))))) (or .cse9 .cse43) (forall ((v_z_3 Int)) (let ((.cse44 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse44 c_~var_1_65~0))) (< (div .cse44 .cse5) .cse15) (not (= (mod .cse44 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse44 c_~var_1_65~0) .cse15)))) (forall ((v_z_3 Int)) (let ((.cse45 (+ .cse6 v_z_3))) (let ((.cse46 (div .cse45 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse45 .cse5) 0) (< (div .cse45 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse46 .cse15) (< 8 v_z_3) (< .cse46 .cse15))))) (or (and (or .cse0 (forall ((v_z_3 Int)) (let ((.cse47 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse47 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse47 c_~var_1_65~0) .cse15))))) .cse48) .cse7) (or (and .cse49 (or .cse0 (forall ((v_z_3 Int)) (let ((.cse50 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse50 .cse5) 0) (< 8 v_z_3) (< (div .cse50 c_~var_1_65~0) .cse15)))))) .cse7) (or .cse18 .cse0) (or .cse21 .cse48) (forall ((v_z_3 Int)) (let ((.cse51 (+ .cse6 v_z_3))) (let ((.cse52 (div .cse51 .cse5)) (.cse53 (div .cse51 c_~var_1_65~0))) (or (not (= 0 (mod .cse51 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse51 .cse5) 0) (< .cse52 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse52) (= .cse53 .cse15) (< 8 v_z_3) (< .cse53 .cse15))))) (or (and .cse54 (or (forall ((v_z_3 Int)) (let ((.cse55 (+ .cse6 v_z_3))) (or (< (div .cse55 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (= (mod .cse55 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse55 c_~var_1_65~0))))) .cse7)) .cse0) (or .cse56 .cse0) (forall ((v_z_3 Int)) (let ((.cse57 (+ .cse6 v_z_3))) (let ((.cse58 (div .cse57 .cse5)) (.cse59 (div .cse57 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse57 .cse5) 0) (< .cse58 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse58) (= .cse59 .cse15) (< 8 v_z_3) (< .cse59 .cse15))))) (or (and (forall ((v_z_3 Int)) (let ((.cse60 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse60 c_~var_1_65~0))) (< (div .cse60 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse60 .cse5) 0) (< (div .cse60 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) .cse61) .cse9) (forall ((v_z_3 Int)) (let ((.cse62 (+ .cse6 v_z_3))) (let ((.cse63 (div .cse62 c_~var_1_65~0))) (or (not (= 0 (mod .cse62 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse62 .cse5) 0) (< (div .cse62 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse63 .cse15) (< 8 v_z_3) (< .cse63 .cse15))))) (forall ((v_z_3 Int)) (let ((.cse64 (+ .cse6 v_z_3))) (let ((.cse65 (div .cse64 c_~var_1_65~0))) (or (not (= 0 (mod .cse64 c_~var_1_65~0))) (< (div .cse64 .cse5) .cse15) (not (= (mod .cse64 .cse5) 0)) (< v_z_3 0) (= .cse65 .cse15) (< 8 v_z_3) (< .cse65 .cse15))))) (or .cse9 .cse16) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse66 (+ .cse6 v_z_3))) (let ((.cse67 (div .cse66 .cse5))) (or (not (= 0 (mod .cse66 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse66 .cse5) 0) (< .cse67 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse67) (< 8 v_z_3)))))) (forall ((v_z_3 Int)) (let ((.cse68 (+ .cse6 v_z_3))) (let ((.cse69 (div .cse68 c_~var_1_65~0))) (or (< (div .cse68 .cse5) .cse15) (not (= (mod .cse68 .cse5) 0)) (< v_z_3 0) (= .cse69 .cse15) (< 8 v_z_3) (< .cse69 .cse15))))) (forall ((v_z_3 Int)) (let ((.cse70 (+ .cse6 v_z_3))) (or (< (div .cse70 .cse5) .cse15) (< v_z_3 .cse3) (< (div .cse70 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse71 (+ .cse6 v_z_3))) (or (< (div .cse71 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse71 .cse5) 0) (< (div .cse71 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (or (and .cse72 (or (forall ((v_z_3 Int)) (let ((.cse73 (+ .cse6 v_z_3))) (or (< (div .cse73 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (not (= (mod .cse73 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse73 c_~var_1_65~0))))) .cse7) .cse74 (or (forall ((v_z_3 Int)) (let ((.cse75 (+ .cse6 v_z_3))) (or (< (div .cse75 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse75 c_~var_1_65~0))))) .cse7)) .cse0) (forall ((v_z_3 Int)) (let ((.cse78 (+ .cse6 v_z_3))) (let ((.cse76 (div .cse78 .cse5)) (.cse77 (div .cse78 c_~var_1_65~0))) (or (< .cse76 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse76) (= .cse77 .cse15) (< 8 v_z_3) (< .cse77 .cse15))))) (or .cse29 .cse0) (or .cse79 .cse0) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse80 (+ .cse6 v_z_3))) (let ((.cse81 (div .cse80 .cse5))) (or (not (= 0 (mod .cse80 c_~var_1_65~0))) (= (mod .cse80 .cse5) 0) (< .cse81 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse81) (< 8 v_z_3) (< (div .cse80 c_~var_1_65~0) .cse15)))))) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse82 (+ .cse6 v_z_3))) (let ((.cse83 (div .cse82 .cse5))) (or (not (= 0 (mod .cse82 c_~var_1_65~0))) (< .cse83 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse83) (< 8 v_z_3) (< (div .cse82 c_~var_1_65~0) .cse15)))))) (or (forall ((v_z_3 Int)) (let ((.cse84 (+ .cse6 v_z_3))) (or (< (div .cse84 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (< (div .cse84 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse84 c_~var_1_65~0))))) .cse7) (or (forall ((v_z_3 Int)) (let ((.cse85 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse85 c_~var_1_65~0))) (< (div .cse85 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3)))) .cse21) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse86 (+ .cse6 v_z_3))) (or (< (div .cse86 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse86 .cse5) 0) (< 8 v_z_3))))) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse88 (+ .cse6 v_z_3))) (let ((.cse87 (div .cse88 .cse5))) (or (< .cse87 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse87) (< 8 v_z_3) (< (div .cse88 c_~var_1_65~0) .cse15)))))) (or .cse21 .cse89) (or .cse56 .cse9) (or .cse0 .cse26) (or .cse90 .cse0) (forall ((v_z_3 Int)) (let ((.cse91 (+ .cse6 v_z_3))) (let ((.cse92 (div .cse91 .cse5)) (.cse93 (div .cse91 c_~var_1_65~0))) (or (not (= 0 (mod .cse91 c_~var_1_65~0))) (= (mod .cse91 .cse5) 0) (< .cse92 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse92) (= .cse93 .cse15) (< 8 v_z_3) (< .cse93 .cse15))))) (or .cse21 (and .cse94 (forall ((v_z_3 Int)) (let ((.cse95 (+ .cse6 v_z_3))) (let ((.cse96 (div .cse95 .cse5))) (or (not (= 0 (mod .cse95 c_~var_1_65~0))) (= (mod .cse95 .cse5) 0) (< .cse96 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse96) (< 8 v_z_3))))) .cse97)) (or .cse9 .cse98) (or (and .cse99 .cse23) .cse9) (or (and (forall ((v_z_3 Int)) (let ((.cse100 (+ .cse6 v_z_3))) (let ((.cse101 (div .cse100 c_~var_1_65~0))) (or (not (= 0 (mod .cse100 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (< (div .cse100 .cse5) .cse15) (= (mod .cse100 .cse5) 0) (< v_z_3 0) (= .cse101 .cse15) (< 8 v_z_3) (< .cse101 .cse15))))) .cse56 .cse99 .cse23 .cse8 .cse102) .cse9) (or (and .cse43 (or (forall ((v_z_3 Int)) (let ((.cse103 (+ .cse6 v_z_3))) (let ((.cse104 (div .cse103 c_~var_1_65~0))) (or (not (= 0 (mod .cse103 c_~var_1_65~0))) (< .cse104 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse103 .cse5) 0)) (= .cse104 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) .cse7)) .cse0) (or (and (or (forall ((v_z_3 Int)) (let ((.cse105 (+ .cse6 v_z_3))) (let ((.cse106 (div .cse105 c_~var_1_65~0))) (or (not (= 0 (mod .cse105 c_~var_1_65~0))) (< .cse106 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse105 .cse5) 0)) (< v_z_3 .cse3) (= .cse106 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7) .cse107 .cse108 (or (forall ((v_z_3 Int)) (let ((.cse109 (+ .cse6 v_z_3))) (let ((.cse110 (div .cse109 c_~var_1_65~0))) (or (not (= 0 (mod .cse109 c_~var_1_65~0))) (< .cse110 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= .cse110 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7)) .cse0) (or (and .cse72 (forall ((v_z_3 Int)) (let ((.cse112 (+ .cse6 v_z_3))) (let ((.cse111 (div .cse112 .cse5))) (or (< .cse3 (+ v_z_3 1)) (< .cse111 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse112 c_~var_1_65~0) .cse36) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse111) (< 8 v_z_3) (= 0 (mod .cse112 c_~var_1_65~0)))))) (forall ((v_z_3 Int)) (let ((.cse113 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse113 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse113 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse113 c_~var_1_65~0))))) .cse74 (forall ((v_z_3 Int)) (let ((.cse114 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse114 .cse5) .cse15) (not (= (mod .cse114 .cse5) 0)) (< (div .cse114 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse114 c_~var_1_65~0)))))) .cse9) (or .cse0 (and .cse61 (or (forall ((v_z_3 Int)) (let ((.cse115 (+ .cse6 v_z_3))) (let ((.cse116 (div .cse115 c_~var_1_65~0))) (or (not (= 0 (mod .cse115 c_~var_1_65~0))) (< .cse116 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= (mod .cse115 .cse5) 0) (= .cse116 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7))) (or .cse21 (and .cse94 .cse97)) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse117 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse117 c_~var_1_65~0))) (< (div .cse117 .cse5) .cse15) (not (= (mod .cse117 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3))))) (or (forall ((v_z_3 Int)) (or (< (div (+ .cse6 v_z_3) .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3))) .cse21) (or (forall ((v_z_3 Int)) (let ((.cse118 (+ .cse6 v_z_3))) (let ((.cse119 (div .cse118 c_~var_1_65~0))) (or (not (= 0 (mod .cse118 c_~var_1_65~0))) (not (= (mod .cse118 .cse5) 0)) (< v_z_3 0) (= .cse119 .cse15) (< 8 v_z_3) (< .cse119 .cse15))))) .cse0) (or .cse21 .cse120) (or .cse21 (and (forall ((v_z_3 Int)) (let ((.cse121 (+ .cse6 v_z_3))) (let ((.cse122 (div .cse121 .cse5))) (or (= (mod .cse121 .cse5) 0) (< .cse122 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse122) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse123 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse123 .cse5) 0) (< (div .cse123 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse124 (div (+ .cse6 v_z_3) .cse5))) (or (< .cse124 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse124) (< 8 v_z_3)))))) (or .cse120 .cse7) (or .cse9 (and .cse90 (forall ((v_z_3 Int)) (let ((.cse125 (+ .cse6 v_z_3))) (let ((.cse126 (div .cse125 c_~var_1_65~0))) (or (< (div .cse125 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse125 .cse5) 0) (= .cse126 .cse15) (< 8 v_z_3) (< .cse126 .cse15))))))) (forall ((v_z_3 Int)) (let ((.cse127 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse127 .cse5) .cse15) (< (div .cse127 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse127 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse128 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse128 .cse5) 0) (< (div .cse128 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse128 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse128 c_~var_1_65~0))))) (or (and .cse26 .cse28) .cse9) (or .cse0 .cse27) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse129 (+ .cse6 v_z_3))) (let ((.cse130 (div .cse129 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse129 .cse5) 0) (< .cse130 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse130) (< 8 v_z_3)))))) (or (forall ((v_z_3 Int)) (let ((.cse131 (+ .cse6 v_z_3))) (let ((.cse132 (div .cse131 c_~var_1_65~0))) (or (not (= 0 (mod .cse131 c_~var_1_65~0))) (= (mod .cse131 .cse5) 0) (< (div .cse131 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse132 .cse15) (< 8 v_z_3) (< .cse132 .cse15))))) .cse0) (or .cse54 .cse9) (or .cse133 .cse0) (or (and .cse133 (or (forall ((v_z_3 Int)) (let ((.cse134 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse134 .cse5) 0) (< (div .cse134 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3) (< (div .cse134 c_~var_1_65~0) .cse15)))) .cse7)) .cse0) (or .cse9 .cse27) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse135 (+ .cse6 v_z_3))) (let ((.cse136 (div .cse135 .cse5))) (or (= (mod .cse135 .cse5) 0) (< .cse136 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse136) (< 8 v_z_3) (< (div .cse135 c_~var_1_65~0) .cse15)))))) (or .cse9 .cse79) (or .cse10 .cse0) (or (and (or (forall ((v_z_3 Int)) (let ((.cse137 (+ .cse6 v_z_3))) (or (not (= (mod .cse137 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse137 c_~var_1_65~0) .cse15)))) .cse0) .cse37) .cse7) (or (and (or (forall ((v_z_3 Int)) (or (< v_z_3 0) (< 8 v_z_3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse15))) .cse0) (forall ((v_z_3 Int)) (let ((.cse138 (+ .cse6 v_z_3))) (or (< (div .cse138 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (< (div .cse138 c_~var_1_65~0) .cse15))))) .cse7) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse139 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse139 .cse5) 0) (< (div .cse139 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse139 c_~var_1_65~0)))))) (forall ((v_z_3 Int)) (let ((.cse140 (+ .cse6 v_z_3))) (or (< (div .cse140 .cse5) .cse15) (not (= (mod .cse140 .cse5) 0)) (< (div .cse140 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3)))) (or (and (forall ((v_z_3 Int)) (let ((.cse141 (+ .cse6 v_z_3))) (let ((.cse142 (div .cse141 .cse5))) (or (not (= 0 (mod .cse141 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse141 .cse5) 0) (< .cse142 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse141 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse142) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse143 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse143 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse143 .cse5) 0) (< (div .cse143 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse143 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) .cse9) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse144 (+ .cse6 v_z_3))) (let ((.cse145 (div .cse144 c_~var_1_65~0))) (or (< (div .cse144 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse145 .cse15) (< 8 v_z_3) (< .cse145 .cse15)))))) (or (forall ((v_z_3 Int)) (let ((.cse146 (+ .cse6 v_z_3))) (or (< (div .cse146 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (= (mod .cse146 .cse5) 0) (< (div .cse146 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse146 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse147 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse147 c_~var_1_65~0))) (< (div .cse147 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse147 c_~var_1_65~0) .cse15)))) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse148 (+ .cse6 v_z_3))) (let ((.cse149 (div .cse148 .cse5))) (or (not (= 0 (mod .cse148 c_~var_1_65~0))) (< v_z_3 .cse3) (< .cse149 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse148 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse149) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse150 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse150 c_~var_1_65~0))) (< v_z_3 .cse3) (< (div .cse150 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse150 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) .cse107 .cse108 (forall ((v_z_3 Int)) (let ((.cse151 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse151 c_~var_1_65~0))) (< (div .cse151 .cse5) .cse15) (not (= (mod .cse151 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse151 c_~var_1_65~0) .cse36) (< 8 v_z_3)))))) (or .cse89 .cse7) (or (forall ((v_z_3 Int)) (let ((.cse152 (+ .cse6 v_z_3))) (or (< (div .cse152 .cse5) .cse15) (not (= (mod .cse152 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3)))) .cse21) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse153 (+ .cse6 v_z_3))) (let ((.cse154 (div .cse153 c_~var_1_65~0))) (or (= (mod .cse153 .cse5) 0) (< (div .cse153 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse154 .cse15) (< 8 v_z_3) (< .cse154 .cse15)))))) (or .cse0 (and (or (forall ((v_z_3 Int)) (let ((.cse155 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse155 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse155 .cse5) 0) (< (div .cse155 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3) (< (div .cse155 c_~var_1_65~0) .cse15)))) .cse7) (forall ((v_z_3 Int)) (let ((.cse156 (+ .cse6 v_z_3))) (let ((.cse157 (div .cse156 c_~var_1_65~0))) (or (not (= 0 (mod .cse156 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse156 .cse5) 0) (< (div .cse156 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= .cse157 .cse15) (< 8 v_z_3) (< .cse157 .cse15))))))) (forall ((v_z_3 Int)) (let ((.cse158 (+ .cse6 v_z_3))) (or (< (div .cse158 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse158 c_~var_1_65~0) .cse15)))) (or .cse159 .cse9) (forall ((v_z_3 Int)) (let ((.cse160 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse160 c_~var_1_65~0))) (< (div .cse160 .cse5) .cse15) (not (= (mod .cse160 .cse5) 0)) (< (div .cse160 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3)))) (or .cse98 .cse0) (or .cse9 (and .cse30 (forall ((v_z_3 Int)) (let ((.cse161 (+ .cse6 v_z_3))) (or (< (div .cse161 .cse5) .cse15) (not (= (mod .cse161 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse161 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse163 (+ .cse6 v_z_3))) (let ((.cse162 (div .cse163 .cse5))) (or (< v_z_3 .cse3) (< .cse162 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse163 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse162) (< 8 v_z_3))))) .cse34 (forall ((v_z_3 Int)) (let ((.cse164 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (< (div .cse164 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse164 c_~var_1_65~0) .cse36) (< 8 v_z_3)))))) (or .cse21 .cse37) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse165 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse165 .cse5) 0) (< (div .cse165 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse165 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse166 (+ .cse6 v_z_3))) (let ((.cse167 (div .cse166 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse166 .cse5) 0) (< .cse167 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse166 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse167) (< 8 v_z_3))))))) (or (and .cse159 (or (forall ((v_z_3 Int)) (let ((.cse169 (+ .cse6 v_z_3))) (let ((.cse168 (div .cse169 c_~var_1_65~0))) (or (< .cse168 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse169 .cse5) 0)) (= .cse168 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) .cse7)) .cse0) (or .cse49 .cse7) (or .cse9 (and .cse8 .cse102)) (forall ((v_z_3 Int)) (let ((.cse170 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse170 c_~var_1_65~0))) (< (div .cse170 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (< (div .cse170 c_~var_1_65~0) .cse15)))))))) is different from true [2024-12-02 14:59:55,927 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~var_1_66~0 256))) (let ((.cse89 (+ c_~var_1_65~0 1)) (.cse2 (mod c_~var_1_73~0 65536)) (.cse3 (* (- 1) .cse0))) (let ((.cse26 (forall ((v_z_3 Int)) (let ((.cse108 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse108 c_~var_1_65~0))) (= (mod .cse108 .cse2) 0) (< (div .cse108 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse30 (forall ((v_z_3 Int)) (let ((.cse107 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse107 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse107 c_~var_1_65~0) 1) (< 8 v_z_3))))) (.cse11 (forall ((v_z_3 Int)) (let ((.cse106 (+ .cse3 v_z_3))) (or (not (= (mod .cse106 .cse2) 0)) (< (div .cse106 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse28 (forall ((v_z_3 Int)) (let ((.cse105 (+ .cse3 v_z_3))) (or (not (= (mod .cse105 .cse2) 0)) (< (div .cse105 .cse2) 1) (< (div .cse105 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse8 (forall ((v_z_3 Int)) (let ((.cse104 (+ .cse3 v_z_3))) (or (< (div .cse104 .cse2) 1) (< (div .cse104 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse12 (forall ((v_z_3 Int)) (let ((.cse103 (+ .cse3 v_z_3))) (or (not (= (mod .cse103 .cse2) 0)) (< (div .cse103 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse38 (forall ((v_z_3 Int)) (let ((.cse102 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse102 c_~var_1_65~0))) (< (div .cse102 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse51 (forall ((v_z_3 Int)) (let ((.cse101 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse101 c_~var_1_65~0))) (< v_z_3 .cse0) (= (mod .cse101 .cse2) 0) (< (div .cse101 c_~var_1_65~0) 2) (< 8 v_z_3))))) (.cse40 (forall ((v_z_3 Int)) (let ((.cse100 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse100 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse100 .cse2) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse100 .cse2) 0))))) (.cse41 (forall ((v_z_3 Int)) (let ((.cse99 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse99 c_~var_1_65~0))) (< (div .cse99 .cse2) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse20 (forall ((v_z_3 Int)) (let ((.cse98 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse98 .cse2) 0) (< (div .cse98 c_~var_1_65~0) 2) (< 8 v_z_3))))) (.cse25 (forall ((v_z_3 Int)) (let ((.cse97 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse97 c_~var_1_65~0))) (< (div .cse97 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse29 (forall ((v_z_3 Int)) (or (< (div (+ .cse3 v_z_3) c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (.cse16 (forall ((v_z_3 Int)) (or (< v_z_3 .cse0) (< (div (+ .cse3 v_z_3) c_~var_1_65~0) 1) (< 8 v_z_3)))) (.cse43 (forall ((v_z_3 Int)) (let ((.cse96 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse96 c_~var_1_65~0))) (= (mod .cse96 .cse2) 0) (< (div .cse96 .cse2) 1) (< (div .cse96 c_~var_1_65~0) 1) (< 8 v_z_3))))) (.cse22 (forall ((v_z_3 Int)) (let ((.cse95 (+ .cse3 v_z_3))) (or (= (mod .cse95 .cse2) 0) (< (div .cse95 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse18 (forall ((v_z_3 Int)) (let ((.cse94 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse94 .cse2) 0) (< (div .cse94 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse72 (forall ((v_z_3 Int)) (let ((.cse93 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse93 .cse2) 0) (< (div .cse93 c_~var_1_65~0) 1) (< 8 v_z_3))))) (.cse6 (forall ((v_z_3 Int)) (let ((.cse92 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse92 .cse2) 0) (< (div .cse92 .cse2) 1) (< (div .cse92 c_~var_1_65~0) 1) (< 8 v_z_3))))) (.cse7 (< c_~var_1_65~0 0)) (.cse13 (< c_~var_1_65~0 .cse2)) (.cse5 (< .cse2 .cse89)) (.cse17 (forall ((v_z_3 Int)) (let ((.cse91 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse91 c_~var_1_65~0))) (not (= (mod .cse91 .cse2) 0)) (< (div .cse91 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse31 (forall ((v_z_3 Int)) (let ((.cse90 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse90 c_~var_1_65~0))) (not (= (mod .cse90 .cse2) 0)) (< (div .cse90 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse9 (< 0 .cse89))) (and (forall ((v_z_3 Int)) (let ((.cse1 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse1 .cse2) 0) (< (div .cse1 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse1 .cse2) 0) (= 0 (mod .cse1 c_~var_1_65~0))))) (or (forall ((v_z_3 Int)) (let ((.cse4 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse4 .cse2) 0) (< (div .cse4 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) .cse5) (or .cse6 .cse7) (or (and (or (forall ((v_z_3 Int)) (or (< (div (+ .cse3 v_z_3) c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))) .cse5) .cse8) .cse7) (or .cse9 (forall ((v_z_3 Int)) (let ((.cse10 (+ .cse3 v_z_3))) (or (= (mod .cse10 .cse2) 0) (< (div .cse10 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse10 c_~var_1_65~0)))))) (or (and (or .cse11 .cse7) .cse12) .cse5) (or .cse13 .cse6) (or .cse5 (and (forall ((v_z_3 Int)) (let ((.cse14 (+ .cse3 v_z_3))) (or (not (= (mod .cse14 .cse2) 0)) (< v_z_3 .cse0) (< (div .cse14 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse15 (+ .cse3 v_z_3))) (or (not (= (mod .cse15 .cse2) 0)) (< v_z_3 .cse0) (< (div .cse15 c_~var_1_65~0) 1) (< 8 v_z_3)))) .cse7) (forall ((v_z_3 Int)) (or (< v_z_3 .cse0) (< (div (+ .cse3 v_z_3) c_~var_1_65~0) 2) (< 8 v_z_3))) (or .cse16 .cse7))) (or .cse17 .cse5) (or .cse13 .cse18) (or .cse5 (and (or (forall ((v_z_3 Int)) (let ((.cse19 (+ .cse3 v_z_3))) (or (= (mod .cse19 .cse2) 0) (< (div .cse19 c_~var_1_65~0) 1) (< 8 v_z_3) (< (div .cse19 .cse2) 0)))) .cse7) .cse20)) (or (forall ((v_z_3 Int)) (let ((.cse21 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse21 c_~var_1_65~0))) (< (div .cse21 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse21 .cse2) 0)))) .cse5) (or .cse22 .cse5) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse23 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse23 c_~var_1_65~0))) (not (= (mod .cse23 .cse2) 0)) (< (div .cse23 .cse2) 1) (< v_z_3 0) (< 8 v_z_3))))) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse24 (+ .cse3 v_z_3))) (or (not (= (mod .cse24 .cse2) 0)) (< (div .cse24 .cse2) 1) (< v_z_3 0) (< 8 v_z_3))))) (or (and .cse25 .cse26) .cse9) (forall ((v_z_3 Int)) (let ((.cse27 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse27 .cse2) 0) (< (div .cse27 .cse2) 1) (< (div .cse27 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or .cse28 .cse13) (or .cse29 .cse5) (or (and .cse22 .cse29) .cse9) (or .cse20 .cse5) (or .cse5 .cse30) (or .cse5 (and .cse17 (or .cse31 .cse7))) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse32 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse32 c_~var_1_65~0))) (< v_z_3 .cse0) (= (mod .cse32 .cse2) 0) (< (div .cse32 .cse2) 1) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse33 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse33 c_~var_1_65~0))) (< v_z_3 .cse0) (= (mod .cse33 .cse2) 0) (< (div .cse33 .cse2) 1) (< (div .cse33 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse34 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse34 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse34 .cse2) 0) (< (div .cse34 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) .cse5) (or .cse5 (forall ((v_z_3 Int)) (let ((.cse35 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse35 c_~var_1_65~0))) (= (mod .cse35 .cse2) 0) (< (div .cse35 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse35 .cse2) 0))))) (or (forall ((v_z_3 Int)) (let ((.cse36 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse36 .cse2) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse36 .cse2) 0) (= 0 (mod .cse36 c_~var_1_65~0))))) .cse13) (forall ((v_z_3 Int)) (let ((.cse37 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse37 c_~var_1_65~0))) (not (= (mod .cse37 .cse2) 0)) (< (div .cse37 .cse2) 1) (< (div .cse37 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (or .cse38 .cse9) (or .cse9 .cse26) (or .cse13 (and (forall ((v_z_3 Int)) (let ((.cse39 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse39 c_~var_1_65~0))) (= (mod .cse39 .cse2) 0) (< (div .cse39 .cse2) 1) (< v_z_3 0) (< 8 v_z_3)))) .cse40 .cse41)) (or .cse13 (forall ((v_z_3 Int)) (or (< v_z_3 .cse0) (< (div (+ .cse3 v_z_3) .cse2) 1) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse42 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse42 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse42 .cse2) 0) (< (div .cse42 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3)))) .cse5) (or .cse43 .cse13) (or (forall ((v_z_3 Int)) (let ((.cse44 (+ .cse3 v_z_3))) (or (= (mod .cse44 .cse2) 0) (< (div .cse44 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse44 .cse2) 0)))) .cse5) (or .cse5 .cse26) (forall ((v_z_3 Int)) (let ((.cse45 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse45 c_~var_1_65~0))) (< (div .cse45 .cse2) 1) (< (div .cse45 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3)))) (or .cse5 (and (forall ((v_z_3 Int)) (let ((.cse46 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse46 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse46 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse47 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse47 c_~var_1_65~0))) (not (= (mod .cse47 .cse2) 0)) (< v_z_3 .cse0) (< (div .cse47 c_~var_1_65~0) 1) (< 8 v_z_3)))) .cse7) (forall ((v_z_3 Int)) (let ((.cse48 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse48 c_~var_1_65~0))) (not (= (mod .cse48 .cse2) 0)) (< v_z_3 .cse0) (< (div .cse48 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or .cse30 .cse7))) (or .cse5 (and (or (forall ((v_z_3 Int)) (let ((.cse49 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse49 .cse2) 0) (< v_z_3 0) (< (div .cse49 c_~var_1_65~0) 0) (< 8 v_z_3) (= 0 (mod .cse49 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse50 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse50 .cse2) 0) (< (div .cse50 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse50 c_~var_1_65~0))))))) (or (and .cse28 (or .cse5 .cse11)) .cse7) (or .cse28 .cse7) (or .cse5 (and .cse51 (or (forall ((v_z_3 Int)) (let ((.cse52 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse52 c_~var_1_65~0))) (= (mod .cse52 .cse2) 0) (< (div .cse52 c_~var_1_65~0) 1) (< 8 v_z_3) (< (div .cse52 .cse2) 0)))) .cse7))) (or .cse13 .cse8) (forall ((v_z_3 Int)) (let ((.cse53 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse53 c_~var_1_65~0))) (= (mod .cse53 .cse2) 0) (< (div .cse53 .cse2) 1) (< (div .cse53 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse54 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (< (div .cse54 .cse2) 1) (< (div .cse54 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or .cse25 .cse5) (or .cse12 .cse5) (forall ((v_z_3 Int)) (let ((.cse55 (+ .cse3 v_z_3))) (or (not (= (mod .cse55 .cse2) 0)) (< (div .cse55 .cse2) 1) (< (div .cse55 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse56 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse56 c_~var_1_65~0))) (< (div .cse56 .cse2) 1) (< (div .cse56 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse57 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< (div .cse57 .cse2) 1) (< v_z_3 0) (< (div .cse57 c_~var_1_65~0) 0) (< 8 v_z_3) (= 0 (mod .cse57 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse58 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse58 .cse2) 0) (< (div .cse58 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse58 .cse2) 0)))) (or .cse5 (and (forall ((v_z_3 Int)) (let ((.cse59 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (not (= (mod .cse59 .cse2) 0)) (< (div .cse59 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse59 c_~var_1_65~0))))) (or (forall ((v_z_3 Int)) (let ((.cse60 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (not (= (mod .cse60 .cse2) 0)) (< v_z_3 0) (< (div .cse60 c_~var_1_65~0) 0) (< 8 v_z_3) (= 0 (mod .cse60 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse61 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< (div .cse61 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse61 c_~var_1_65~0))))) (or (forall ((v_z_3 Int)) (let ((.cse62 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< v_z_3 0) (< (div .cse62 c_~var_1_65~0) 0) (< 8 v_z_3) (= 0 (mod .cse62 c_~var_1_65~0))))) .cse7))) (or (forall ((v_z_3 Int)) (let ((.cse63 (+ .cse3 v_z_3))) (or (< (div .cse63 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse63 .cse2) 0)))) .cse5) (or (forall ((v_z_3 Int)) (let ((.cse64 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< v_z_3 0) (< (div .cse64 c_~var_1_65~0) 0) (< 8 v_z_3) (< (div .cse64 .cse2) 0) (= 0 (mod .cse64 c_~var_1_65~0))))) .cse7) (or .cse9 (and .cse38 (forall ((v_z_3 Int)) (let ((.cse65 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse65 c_~var_1_65~0))) (= (mod .cse65 .cse2) 0) (< (div .cse65 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3)))))) (or .cse9 .cse12) (or .cse38 .cse5) (forall ((v_z_3 Int)) (let ((.cse66 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse66 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse66 .cse2) 0) (< (div .cse66 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse66 .cse2) 0)))) (or (and .cse51 (or (forall ((v_z_3 Int)) (let ((.cse67 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse67 c_~var_1_65~0))) (< v_z_3 .cse0) (= (mod .cse67 .cse2) 0) (< (div .cse67 c_~var_1_65~0) 1) (< 8 v_z_3)))) .cse7)) .cse5) (forall ((v_z_3 Int)) (let ((.cse68 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse68 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse68 .cse2) 1) (< (div .cse68 c_~var_1_65~0) 1) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse69 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< (div .cse69 .cse2) 1) (< (div .cse69 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse69 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse70 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse70 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse70 .cse2) 1) (< (div .cse70 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse71 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< (div .cse71 .cse2) 1) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse71 c_~var_1_65~0)))))) (or .cse13 (and .cse40 .cse41)) (or (and (or .cse72 .cse7) .cse20) .cse5) (forall ((v_z_3 Int)) (let ((.cse73 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse73 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse73 .cse2) 0) (< (div .cse73 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3) (< (div .cse73 .cse2) 0)))) (or .cse9 .cse25) (or .cse9 .cse29) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse74 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse74 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse74 .cse2) 1) (< 8 v_z_3))))) (or .cse16 .cse5) (or .cse13 (and (forall ((v_z_3 Int)) (let ((.cse75 (+ .cse3 v_z_3))) (or (= (mod .cse75 .cse2) 0) (< (div .cse75 .cse2) 1) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (or (< (div (+ .cse3 v_z_3) .cse2) 1) (< v_z_3 0) (< 8 v_z_3))) (forall ((v_z_3 Int)) (let ((.cse76 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse76 .cse2) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse76 .cse2) 0)))))) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse77 (+ .cse3 v_z_3))) (or (= (mod .cse77 .cse2) 0) (< (div .cse77 .cse2) 1) (< (div .cse77 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (or .cse43 .cse7) (forall ((v_z_3 Int)) (let ((.cse78 (+ .cse3 v_z_3))) (or (< (div .cse78 .cse2) 1) (< (div .cse78 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse79 (+ .cse3 v_z_3))) (or (= (mod .cse79 .cse2) 0) (< (div .cse79 .cse2) 1) (< (div .cse79 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (or .cse22 .cse9) (forall ((v_z_3 Int)) (let ((.cse80 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (< (div .cse80 .cse2) 1) (< (div .cse80 c_~var_1_65~0) 1) (< 8 v_z_3)))) (or (and (forall ((v_z_3 Int)) (let ((.cse81 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse81 .cse2) 0) (< (div .cse81 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3) (< (div .cse81 .cse2) 0)))) (or .cse5 .cse18)) .cse7) (forall ((v_z_3 Int)) (let ((.cse82 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse82 c_~var_1_65~0))) (not (= (mod .cse82 .cse2) 0)) (< (div .cse82 .cse2) 1) (< (div .cse82 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3)))) (or (and (or .cse72 .cse5) .cse6) .cse7) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse83 (+ .cse3 v_z_3))) (or (< (div .cse83 .cse2) 1) (< (div .cse83 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse83 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse84 (+ .cse3 v_z_3))) (or (not (= (mod .cse84 .cse2) 0)) (< (div .cse84 .cse2) 1) (< (div .cse84 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse84 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse85 (+ .cse3 v_z_3))) (or (< (div .cse85 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse85 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse86 (+ .cse3 v_z_3))) (or (< (div .cse86 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse86 .cse2) 0) (= 0 (mod .cse86 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse87 (+ .cse3 v_z_3))) (or (not (= (mod .cse87 .cse2) 0)) (< (div .cse87 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse87 c_~var_1_65~0))))))) (or (forall ((v_z_3 Int)) (let ((.cse88 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse88 .cse2) 0) (< (div .cse88 .cse2) 1) (< 8 v_z_3)))) .cse13) (or .cse31 .cse5) (or .cse17 .cse9) (or .cse31 .cse9))))) is different from false [2024-12-02 14:59:59,952 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~var_1_66~0 256))) (let ((.cse89 (+ c_~var_1_65~0 1)) (.cse2 (mod c_~var_1_73~0 65536)) (.cse3 (* (- 1) .cse0))) (let ((.cse26 (forall ((v_z_3 Int)) (let ((.cse108 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse108 c_~var_1_65~0))) (= (mod .cse108 .cse2) 0) (< (div .cse108 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse30 (forall ((v_z_3 Int)) (let ((.cse107 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse107 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse107 c_~var_1_65~0) 1) (< 8 v_z_3))))) (.cse11 (forall ((v_z_3 Int)) (let ((.cse106 (+ .cse3 v_z_3))) (or (not (= (mod .cse106 .cse2) 0)) (< (div .cse106 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse28 (forall ((v_z_3 Int)) (let ((.cse105 (+ .cse3 v_z_3))) (or (not (= (mod .cse105 .cse2) 0)) (< (div .cse105 .cse2) 1) (< (div .cse105 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse8 (forall ((v_z_3 Int)) (let ((.cse104 (+ .cse3 v_z_3))) (or (< (div .cse104 .cse2) 1) (< (div .cse104 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse12 (forall ((v_z_3 Int)) (let ((.cse103 (+ .cse3 v_z_3))) (or (not (= (mod .cse103 .cse2) 0)) (< (div .cse103 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse38 (forall ((v_z_3 Int)) (let ((.cse102 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse102 c_~var_1_65~0))) (< (div .cse102 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse51 (forall ((v_z_3 Int)) (let ((.cse101 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse101 c_~var_1_65~0))) (< v_z_3 .cse0) (= (mod .cse101 .cse2) 0) (< (div .cse101 c_~var_1_65~0) 2) (< 8 v_z_3))))) (.cse40 (forall ((v_z_3 Int)) (let ((.cse100 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse100 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse100 .cse2) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse100 .cse2) 0))))) (.cse41 (forall ((v_z_3 Int)) (let ((.cse99 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse99 c_~var_1_65~0))) (< (div .cse99 .cse2) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse20 (forall ((v_z_3 Int)) (let ((.cse98 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse98 .cse2) 0) (< (div .cse98 c_~var_1_65~0) 2) (< 8 v_z_3))))) (.cse25 (forall ((v_z_3 Int)) (let ((.cse97 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse97 c_~var_1_65~0))) (< (div .cse97 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse29 (forall ((v_z_3 Int)) (or (< (div (+ .cse3 v_z_3) c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (.cse16 (forall ((v_z_3 Int)) (or (< v_z_3 .cse0) (< (div (+ .cse3 v_z_3) c_~var_1_65~0) 1) (< 8 v_z_3)))) (.cse43 (forall ((v_z_3 Int)) (let ((.cse96 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse96 c_~var_1_65~0))) (= (mod .cse96 .cse2) 0) (< (div .cse96 .cse2) 1) (< (div .cse96 c_~var_1_65~0) 1) (< 8 v_z_3))))) (.cse22 (forall ((v_z_3 Int)) (let ((.cse95 (+ .cse3 v_z_3))) (or (= (mod .cse95 .cse2) 0) (< (div .cse95 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse18 (forall ((v_z_3 Int)) (let ((.cse94 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse94 .cse2) 0) (< (div .cse94 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse72 (forall ((v_z_3 Int)) (let ((.cse93 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse93 .cse2) 0) (< (div .cse93 c_~var_1_65~0) 1) (< 8 v_z_3))))) (.cse6 (forall ((v_z_3 Int)) (let ((.cse92 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse92 .cse2) 0) (< (div .cse92 .cse2) 1) (< (div .cse92 c_~var_1_65~0) 1) (< 8 v_z_3))))) (.cse7 (< c_~var_1_65~0 0)) (.cse13 (< c_~var_1_65~0 .cse2)) (.cse5 (< .cse2 .cse89)) (.cse17 (forall ((v_z_3 Int)) (let ((.cse91 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse91 c_~var_1_65~0))) (not (= (mod .cse91 .cse2) 0)) (< (div .cse91 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse31 (forall ((v_z_3 Int)) (let ((.cse90 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse90 c_~var_1_65~0))) (not (= (mod .cse90 .cse2) 0)) (< (div .cse90 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse9 (< 0 .cse89))) (and (forall ((v_z_3 Int)) (let ((.cse1 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse1 .cse2) 0) (< (div .cse1 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse1 .cse2) 0) (= 0 (mod .cse1 c_~var_1_65~0))))) (or (forall ((v_z_3 Int)) (let ((.cse4 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse4 .cse2) 0) (< (div .cse4 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) .cse5) (or .cse6 .cse7) (or (and (or (forall ((v_z_3 Int)) (or (< (div (+ .cse3 v_z_3) c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))) .cse5) .cse8) .cse7) (or .cse9 (forall ((v_z_3 Int)) (let ((.cse10 (+ .cse3 v_z_3))) (or (= (mod .cse10 .cse2) 0) (< (div .cse10 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse10 c_~var_1_65~0)))))) (or (and (or .cse11 .cse7) .cse12) .cse5) (or .cse13 .cse6) (or .cse5 (and (forall ((v_z_3 Int)) (let ((.cse14 (+ .cse3 v_z_3))) (or (not (= (mod .cse14 .cse2) 0)) (< v_z_3 .cse0) (< (div .cse14 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse15 (+ .cse3 v_z_3))) (or (not (= (mod .cse15 .cse2) 0)) (< v_z_3 .cse0) (< (div .cse15 c_~var_1_65~0) 1) (< 8 v_z_3)))) .cse7) (forall ((v_z_3 Int)) (or (< v_z_3 .cse0) (< (div (+ .cse3 v_z_3) c_~var_1_65~0) 2) (< 8 v_z_3))) (or .cse16 .cse7))) (or .cse17 .cse5) (or .cse13 .cse18) (or .cse5 (and (or (forall ((v_z_3 Int)) (let ((.cse19 (+ .cse3 v_z_3))) (or (= (mod .cse19 .cse2) 0) (< (div .cse19 c_~var_1_65~0) 1) (< 8 v_z_3) (< (div .cse19 .cse2) 0)))) .cse7) .cse20)) (or (forall ((v_z_3 Int)) (let ((.cse21 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse21 c_~var_1_65~0))) (< (div .cse21 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse21 .cse2) 0)))) .cse5) (or .cse22 .cse5) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse23 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse23 c_~var_1_65~0))) (not (= (mod .cse23 .cse2) 0)) (< (div .cse23 .cse2) 1) (< v_z_3 0) (< 8 v_z_3))))) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse24 (+ .cse3 v_z_3))) (or (not (= (mod .cse24 .cse2) 0)) (< (div .cse24 .cse2) 1) (< v_z_3 0) (< 8 v_z_3))))) (or (and .cse25 .cse26) .cse9) (forall ((v_z_3 Int)) (let ((.cse27 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse27 .cse2) 0) (< (div .cse27 .cse2) 1) (< (div .cse27 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or .cse28 .cse13) (or .cse29 .cse5) (or (and .cse22 .cse29) .cse9) (or .cse20 .cse5) (or .cse5 .cse30) (or .cse5 (and .cse17 (or .cse31 .cse7))) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse32 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse32 c_~var_1_65~0))) (< v_z_3 .cse0) (= (mod .cse32 .cse2) 0) (< (div .cse32 .cse2) 1) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse33 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse33 c_~var_1_65~0))) (< v_z_3 .cse0) (= (mod .cse33 .cse2) 0) (< (div .cse33 .cse2) 1) (< (div .cse33 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse34 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse34 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse34 .cse2) 0) (< (div .cse34 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) .cse5) (or .cse5 (forall ((v_z_3 Int)) (let ((.cse35 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse35 c_~var_1_65~0))) (= (mod .cse35 .cse2) 0) (< (div .cse35 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse35 .cse2) 0))))) (or (forall ((v_z_3 Int)) (let ((.cse36 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse36 .cse2) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse36 .cse2) 0) (= 0 (mod .cse36 c_~var_1_65~0))))) .cse13) (forall ((v_z_3 Int)) (let ((.cse37 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse37 c_~var_1_65~0))) (not (= (mod .cse37 .cse2) 0)) (< (div .cse37 .cse2) 1) (< (div .cse37 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (or .cse38 .cse9) (or .cse9 .cse26) (or .cse13 (and (forall ((v_z_3 Int)) (let ((.cse39 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse39 c_~var_1_65~0))) (= (mod .cse39 .cse2) 0) (< (div .cse39 .cse2) 1) (< v_z_3 0) (< 8 v_z_3)))) .cse40 .cse41)) (or .cse13 (forall ((v_z_3 Int)) (or (< v_z_3 .cse0) (< (div (+ .cse3 v_z_3) .cse2) 1) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse42 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse42 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse42 .cse2) 0) (< (div .cse42 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3)))) .cse5) (or .cse43 .cse13) (or (forall ((v_z_3 Int)) (let ((.cse44 (+ .cse3 v_z_3))) (or (= (mod .cse44 .cse2) 0) (< (div .cse44 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse44 .cse2) 0)))) .cse5) (or .cse5 .cse26) (forall ((v_z_3 Int)) (let ((.cse45 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse45 c_~var_1_65~0))) (< (div .cse45 .cse2) 1) (< (div .cse45 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3)))) (or .cse5 (and (forall ((v_z_3 Int)) (let ((.cse46 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse46 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse46 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse47 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse47 c_~var_1_65~0))) (not (= (mod .cse47 .cse2) 0)) (< v_z_3 .cse0) (< (div .cse47 c_~var_1_65~0) 1) (< 8 v_z_3)))) .cse7) (forall ((v_z_3 Int)) (let ((.cse48 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse48 c_~var_1_65~0))) (not (= (mod .cse48 .cse2) 0)) (< v_z_3 .cse0) (< (div .cse48 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or .cse30 .cse7))) (or .cse5 (and (or (forall ((v_z_3 Int)) (let ((.cse49 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse49 .cse2) 0) (< v_z_3 0) (< (div .cse49 c_~var_1_65~0) 0) (< 8 v_z_3) (= 0 (mod .cse49 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse50 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse50 .cse2) 0) (< (div .cse50 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse50 c_~var_1_65~0))))))) (or (and .cse28 (or .cse5 .cse11)) .cse7) (or .cse28 .cse7) (or .cse5 (and .cse51 (or (forall ((v_z_3 Int)) (let ((.cse52 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse52 c_~var_1_65~0))) (= (mod .cse52 .cse2) 0) (< (div .cse52 c_~var_1_65~0) 1) (< 8 v_z_3) (< (div .cse52 .cse2) 0)))) .cse7))) (or .cse13 .cse8) (forall ((v_z_3 Int)) (let ((.cse53 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse53 c_~var_1_65~0))) (= (mod .cse53 .cse2) 0) (< (div .cse53 .cse2) 1) (< (div .cse53 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse54 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (< (div .cse54 .cse2) 1) (< (div .cse54 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or .cse25 .cse5) (or .cse12 .cse5) (forall ((v_z_3 Int)) (let ((.cse55 (+ .cse3 v_z_3))) (or (not (= (mod .cse55 .cse2) 0)) (< (div .cse55 .cse2) 1) (< (div .cse55 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse56 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse56 c_~var_1_65~0))) (< (div .cse56 .cse2) 1) (< (div .cse56 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse57 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< (div .cse57 .cse2) 1) (< v_z_3 0) (< (div .cse57 c_~var_1_65~0) 0) (< 8 v_z_3) (= 0 (mod .cse57 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse58 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse58 .cse2) 0) (< (div .cse58 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse58 .cse2) 0)))) (or .cse5 (and (forall ((v_z_3 Int)) (let ((.cse59 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (not (= (mod .cse59 .cse2) 0)) (< (div .cse59 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse59 c_~var_1_65~0))))) (or (forall ((v_z_3 Int)) (let ((.cse60 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (not (= (mod .cse60 .cse2) 0)) (< v_z_3 0) (< (div .cse60 c_~var_1_65~0) 0) (< 8 v_z_3) (= 0 (mod .cse60 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse61 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< (div .cse61 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse61 c_~var_1_65~0))))) (or (forall ((v_z_3 Int)) (let ((.cse62 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< v_z_3 0) (< (div .cse62 c_~var_1_65~0) 0) (< 8 v_z_3) (= 0 (mod .cse62 c_~var_1_65~0))))) .cse7))) (or (forall ((v_z_3 Int)) (let ((.cse63 (+ .cse3 v_z_3))) (or (< (div .cse63 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse63 .cse2) 0)))) .cse5) (or (forall ((v_z_3 Int)) (let ((.cse64 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< v_z_3 0) (< (div .cse64 c_~var_1_65~0) 0) (< 8 v_z_3) (< (div .cse64 .cse2) 0) (= 0 (mod .cse64 c_~var_1_65~0))))) .cse7) (or .cse9 (and .cse38 (forall ((v_z_3 Int)) (let ((.cse65 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse65 c_~var_1_65~0))) (= (mod .cse65 .cse2) 0) (< (div .cse65 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3)))))) (or .cse9 .cse12) (or .cse38 .cse5) (forall ((v_z_3 Int)) (let ((.cse66 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse66 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse66 .cse2) 0) (< (div .cse66 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse66 .cse2) 0)))) (or (and .cse51 (or (forall ((v_z_3 Int)) (let ((.cse67 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse67 c_~var_1_65~0))) (< v_z_3 .cse0) (= (mod .cse67 .cse2) 0) (< (div .cse67 c_~var_1_65~0) 1) (< 8 v_z_3)))) .cse7)) .cse5) (forall ((v_z_3 Int)) (let ((.cse68 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse68 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse68 .cse2) 1) (< (div .cse68 c_~var_1_65~0) 1) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse69 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< (div .cse69 .cse2) 1) (< (div .cse69 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse69 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse70 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse70 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse70 .cse2) 1) (< (div .cse70 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse71 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< (div .cse71 .cse2) 1) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse71 c_~var_1_65~0)))))) (or .cse13 (and .cse40 .cse41)) (or (and (or .cse72 .cse7) .cse20) .cse5) (forall ((v_z_3 Int)) (let ((.cse73 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse73 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse73 .cse2) 0) (< (div .cse73 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3) (< (div .cse73 .cse2) 0)))) (or .cse9 .cse25) (or .cse9 .cse29) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse74 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse74 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse74 .cse2) 1) (< 8 v_z_3))))) (or .cse16 .cse5) (or .cse13 (and (forall ((v_z_3 Int)) (let ((.cse75 (+ .cse3 v_z_3))) (or (= (mod .cse75 .cse2) 0) (< (div .cse75 .cse2) 1) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (or (< (div (+ .cse3 v_z_3) .cse2) 1) (< v_z_3 0) (< 8 v_z_3))) (forall ((v_z_3 Int)) (let ((.cse76 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse76 .cse2) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse76 .cse2) 0)))))) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse77 (+ .cse3 v_z_3))) (or (= (mod .cse77 .cse2) 0) (< (div .cse77 .cse2) 1) (< (div .cse77 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (or .cse43 .cse7) (forall ((v_z_3 Int)) (let ((.cse78 (+ .cse3 v_z_3))) (or (< (div .cse78 .cse2) 1) (< (div .cse78 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse79 (+ .cse3 v_z_3))) (or (= (mod .cse79 .cse2) 0) (< (div .cse79 .cse2) 1) (< (div .cse79 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (or .cse22 .cse9) (forall ((v_z_3 Int)) (let ((.cse80 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (< (div .cse80 .cse2) 1) (< (div .cse80 c_~var_1_65~0) 1) (< 8 v_z_3)))) (or (and (forall ((v_z_3 Int)) (let ((.cse81 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse81 .cse2) 0) (< (div .cse81 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3) (< (div .cse81 .cse2) 0)))) (or .cse5 .cse18)) .cse7) (forall ((v_z_3 Int)) (let ((.cse82 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse82 c_~var_1_65~0))) (not (= (mod .cse82 .cse2) 0)) (< (div .cse82 .cse2) 1) (< (div .cse82 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3)))) (or (and (or .cse72 .cse5) .cse6) .cse7) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse83 (+ .cse3 v_z_3))) (or (< (div .cse83 .cse2) 1) (< (div .cse83 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse83 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse84 (+ .cse3 v_z_3))) (or (not (= (mod .cse84 .cse2) 0)) (< (div .cse84 .cse2) 1) (< (div .cse84 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse84 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse85 (+ .cse3 v_z_3))) (or (< (div .cse85 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse85 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse86 (+ .cse3 v_z_3))) (or (< (div .cse86 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse86 .cse2) 0) (= 0 (mod .cse86 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse87 (+ .cse3 v_z_3))) (or (not (= (mod .cse87 .cse2) 0)) (< (div .cse87 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse87 c_~var_1_65~0))))))) (or (forall ((v_z_3 Int)) (let ((.cse88 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse88 .cse2) 0) (< (div .cse88 .cse2) 1) (< 8 v_z_3)))) .cse13) (or .cse31 .cse5) (or .cse17 .cse9) (or .cse31 .cse9))))) is different from true [2024-12-02 15:03:11,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:03:11,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676471578] [2024-12-02 15:03:11,959 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-12-02 15:03:11,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132787251] [2024-12-02 15:03:11,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132787251] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:03:11,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-12-02 15:03:11,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-12-02 15:03:11,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943538144] [2024-12-02 15:03:11,960 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-12-02 15:03:11,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 15:03:11,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:03:11,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 15:03:11,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=110, Unknown=4, NotChecked=46, Total=210 [2024-12-02 15:03:11,962 INFO L87 Difference]: Start difference. First operand 22117 states and 35995 transitions. Second operand has 12 states, 12 states have (on average 14.583333333333334) internal successors, (175), 11 states have internal predecessors, (175), 4 states have call successors, (110), 4 states have call predecessors, (110), 5 states have return successors, (110), 3 states have call predecessors, (110), 4 states have call successors, (110) [2024-12-02 15:03:22,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:03:22,580 INFO L93 Difference]: Finished difference Result 83316 states and 134784 transitions. [2024-12-02 15:03:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-12-02 15:03:22,581 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.583333333333334) internal successors, (175), 11 states have internal predecessors, (175), 4 states have call successors, (110), 4 states have call predecessors, (110), 5 states have return successors, (110), 3 states have call predecessors, (110), 4 states have call successors, (110) Word has length 710 [2024-12-02 15:03:22,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:03:22,694 INFO L225 Difference]: With dead ends: 83316 [2024-12-02 15:03:22,694 INFO L226 Difference]: Without dead ends: 61259 [2024-12-02 15:03:22,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 789 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=139, Invalid=285, Unknown=4, NotChecked=78, Total=506 [2024-12-02 15:03:22,733 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 1518 mSDsluCounter, 1911 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1579 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-12-02 15:03:22,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1579 Valid, 2411 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-12-02 15:03:22,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61259 states. [2024-12-02 15:03:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61259 to 60691. [2024-12-02 15:03:26,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60691 states, 51944 states have (on average 1.572173879562606) internal successors, (81665), 52149 states have internal predecessors, (81665), 8253 states have call successors, (8253), 493 states have call predecessors, (8253), 493 states have return successors, (8253), 8048 states have call predecessors, (8253), 8253 states have call successors, (8253) [2024-12-02 15:03:26,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60691 states to 60691 states and 98171 transitions. [2024-12-02 15:03:26,767 INFO L78 Accepts]: Start accepts. Automaton has 60691 states and 98171 transitions. Word has length 710 [2024-12-02 15:03:26,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:03:26,768 INFO L471 AbstractCegarLoop]: Abstraction has 60691 states and 98171 transitions. [2024-12-02 15:03:26,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.583333333333334) internal successors, (175), 11 states have internal predecessors, (175), 4 states have call successors, (110), 4 states have call predecessors, (110), 5 states have return successors, (110), 3 states have call predecessors, (110), 4 states have call successors, (110) [2024-12-02 15:03:26,768 INFO L276 IsEmpty]: Start isEmpty. Operand 60691 states and 98171 transitions. [2024-12-02 15:03:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2024-12-02 15:03:26,786 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:03:26,787 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:03:26,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-12-02 15:03:26,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-12-02 15:03:26,987 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:03:26,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:03:26,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1145546969, now seen corresponding path program 1 times [2024-12-02 15:03:26,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:03:26,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222234535] [2024-12-02 15:03:26,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:03:26,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:03:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-02 15:03:27,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [35100235] [2024-12-02 15:03:27,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:03:27,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:03:27,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:03:27,358 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:03:27,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927e4b4e-513a-4c1c-aa71-454a7fa0bcc9/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 15:03:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:03:28,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 1604 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-12-02 15:03:28,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:03:33,607 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 14079 proven. 426 refuted. 0 times theorem prover too weak. 9475 trivial. 0 not checked. [2024-12-02 15:03:33,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:04:07,568 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:04:31,897 WARN L286 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:04:36,331 WARN L873 $PredicateComparison]: unable to prove that (or (< (mod c_~var_1_39~0 256) c_~var_1_63~0) (let ((.cse1 (mod c_~var_1_85~0 256))) (let ((.cse12 (+ .cse1 1)) (.cse2 (< c_~var_1_65~0 0)) (.cse6 (< 0 (+ c_~var_1_65~0 1))) (.cse5 (* (- 1) c_~var_1_65~0))) (and (or (forall ((v_z_40 Int)) (let ((.cse0 (+ (* (- 1) v_z_40) .cse1))) (or (< |c_ULTIMATE.start_step_#t~bitwise7#1| (+ (div .cse0 c_~var_1_65~0) 1)) (= (mod .cse0 c_~var_1_65~0) 0) (< v_z_40 0) (< .cse1 v_z_40)))) .cse2) (forall ((v_z_50 Int)) (let ((.cse3 (+ (* (- 1) v_z_50) .cse1))) (let ((.cse4 (div .cse3 .cse5))) (or (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div .cse3 c_~var_1_65~0)) (not (= 0 (mod .cse3 c_~var_1_65~0))) (< |c_ULTIMATE.start_step_#t~bitwise7#1| .cse4) (< v_z_50 0) (< 255 v_z_50) (= |c_ULTIMATE.start_step_#t~bitwise7#1| .cse4))))) (or .cse6 (forall ((v_z_47 Int)) (let ((.cse8 (+ .cse1 (* (- 1) v_z_47)))) (let ((.cse7 (div .cse8 .cse5))) (or (= |c_ULTIMATE.start_step_#t~bitwise7#1| .cse7) (not (= (mod .cse8 c_~var_1_65~0) 0)) (< .cse1 v_z_47) (< |c_ULTIMATE.start_step_#t~bitwise7#1| .cse7) (< v_z_47 0)))))) (forall ((v_z_40 Int)) (let ((.cse9 (+ (* (- 1) v_z_40) .cse1))) (let ((.cse10 (div .cse9 .cse5))) (or (< |c_ULTIMATE.start_step_#t~bitwise7#1| (+ (div .cse9 c_~var_1_65~0) 1)) (= (mod .cse9 c_~var_1_65~0) 0) (< v_z_40 0) (< |c_ULTIMATE.start_step_#t~bitwise7#1| .cse10) (< .cse1 v_z_40) (= |c_ULTIMATE.start_step_#t~bitwise7#1| .cse10))))) (or .cse6 (forall ((v_z_32 Int)) (let ((.cse11 (+ (* (- 1) v_z_32) .cse1))) (or (< |c_ULTIMATE.start_step_#t~bitwise7#1| (+ (div .cse11 .cse5) 1)) (< v_z_32 .cse12) (= (mod .cse11 .cse5) 0) (< 255 v_z_32))))) (or (forall ((v_z_70 Int)) (let ((.cse13 (+ (* (- 1) v_z_70) .cse1))) (or (< v_z_70 0) (not (= (mod .cse13 c_~var_1_65~0) 0)) (< 255 v_z_70) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (+ (div .cse13 c_~var_1_65~0) 1))))) .cse2) (or .cse6 (forall ((v_z_21 Int)) (or (< .cse1 v_z_21) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div (+ (* (- 1) v_z_21) .cse1) .cse5)) (< v_z_21 0)))) (or (forall ((v_z_18 Int)) (let ((.cse14 (+ (* (- 1) v_z_18) .cse1))) (or (not (= 0 (mod .cse14 .cse5))) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div .cse14 .cse5)) (< 255 v_z_18) (< v_z_18 0)))) .cse6) (forall ((v_z_40 Int)) (let ((.cse15 (+ (* (- 1) v_z_40) .cse1))) (let ((.cse16 (div .cse15 .cse5))) (or (< |c_ULTIMATE.start_step_#t~bitwise7#1| (+ (div .cse15 c_~var_1_65~0) 1)) (< v_z_40 0) (< |c_ULTIMATE.start_step_#t~bitwise7#1| .cse16) (< .cse1 v_z_40) (= |c_ULTIMATE.start_step_#t~bitwise7#1| .cse16))))) (forall ((v_z_18 Int)) (let ((.cse17 (+ (* (- 1) v_z_18) .cse1))) (or (not (= 0 (mod .cse17 .cse5))) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div .cse17 .cse5)) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div .cse17 c_~var_1_65~0)) (< v_z_18 0) (< .cse1 v_z_18)))) (or (forall ((v_z_18 Int)) (let ((.cse18 (+ (* (- 1) v_z_18) .cse1))) (or (not (= 0 (mod .cse18 .cse5))) (< 255 v_z_18) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div .cse18 c_~var_1_65~0)) (< v_z_18 0)))) .cse2) (or (forall ((v_z_40 Int)) (let ((.cse19 (+ (* (- 1) v_z_40) .cse1))) (or (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div .cse19 c_~var_1_65~0)) (< v_z_40 0) (not (= (mod .cse19 c_~var_1_65~0) 0)) (< .cse1 v_z_40)))) .cse2) (or .cse6 (forall ((v_z_40 Int)) (let ((.cse20 (+ (* (- 1) v_z_40) .cse1))) (let ((.cse21 (div .cse20 .cse5))) (or (< v_z_40 0) (not (= (mod .cse20 c_~var_1_65~0) 0)) (< |c_ULTIMATE.start_step_#t~bitwise7#1| .cse21) (< .cse1 v_z_40) (= |c_ULTIMATE.start_step_#t~bitwise7#1| .cse21)))))) (or (and (forall ((v_z_59 Int)) (let ((.cse22 (+ (* (- 1) v_z_59) .cse1))) (let ((.cse23 (div .cse22 .cse5))) (or (not (= (mod .cse22 .cse5) 0)) (< |c_ULTIMATE.start_step_#t~bitwise7#1| .cse23) (< 255 v_z_59) (= |c_ULTIMATE.start_step_#t~bitwise7#1| .cse23) (< v_z_59 0))))) (forall ((v_z_65 Int)) (or (< 255 v_z_65) (< v_z_65 0) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (+ (div (+ .cse1 (* (- 1) v_z_65)) .cse5) 1))))) .cse6) (forall ((v_z_28 Int)) (let ((.cse24 (+ .cse1 (* (- 1) v_z_28)))) (or (< |c_ULTIMATE.start_step_#t~bitwise7#1| (+ (div .cse24 c_~var_1_65~0) 1)) (< v_z_28 .cse12) (= (mod .cse24 .cse5) 0) (< 255 v_z_28) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (+ (div .cse24 .cse5) 1))))) (forall ((v_z_53 Int)) (let ((.cse25 (+ .cse1 (* (- 1) v_z_53)))) (let ((.cse26 (div .cse25 .cse5))) (or (< v_z_53 0) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div .cse25 c_~var_1_65~0)) (< 255 v_z_53) (< |c_ULTIMATE.start_step_#t~bitwise7#1| .cse26) (not (= (mod .cse25 c_~var_1_65~0) 0)) (= |c_ULTIMATE.start_step_#t~bitwise7#1| .cse26))))) (or (forall ((v_z_50 Int)) (let ((.cse27 (+ (* (- 1) v_z_50) .cse1))) (or (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div .cse27 c_~var_1_65~0)) (not (= 0 (mod .cse27 c_~var_1_65~0))) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div .cse27 .cse5)) (< v_z_50 0) (< 255 v_z_50)))) .cse2) (forall ((v_z_47 Int)) (let ((.cse29 (+ .cse1 (* (- 1) v_z_47)))) (let ((.cse28 (div .cse29 .cse5))) (or (= |c_ULTIMATE.start_step_#t~bitwise7#1| .cse28) (not (= (mod .cse29 c_~var_1_65~0) 0)) (< .cse1 v_z_47) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div .cse29 c_~var_1_65~0)) (< |c_ULTIMATE.start_step_#t~bitwise7#1| .cse28) (< v_z_47 0))))) (or (forall ((v_z_69 Int)) (or (< |c_ULTIMATE.start_step_#t~bitwise7#1| (+ (div (+ .cse1 (* (- 1) v_z_69)) c_~var_1_65~0) 1)) (< 255 v_z_69) (< v_z_69 0))) .cse2) (or (forall ((v_z_18 Int)) (let ((.cse30 (+ (* (- 1) v_z_18) .cse1))) (or (< |c_ULTIMATE.start_step_#t~bitwise7#1| (+ (div .cse30 c_~var_1_65~0) 1)) (not (= 0 (mod .cse30 .cse5))) (< 255 v_z_18) (< v_z_18 0)))) .cse2) (forall ((v_z_18 Int)) (let ((.cse31 (+ (* (- 1) v_z_18) .cse1))) (or (not (= 0 (mod .cse31 .cse5))) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div .cse31 .cse5)) (< 255 v_z_18) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div .cse31 c_~var_1_65~0)) (< v_z_18 0)))) (or .cse6 (forall ((v_z_18 Int)) (let ((.cse32 (+ (* (- 1) v_z_18) .cse1))) (or (not (= 0 (mod .cse32 .cse5))) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div .cse32 .cse5)) (< v_z_18 0) (< .cse1 v_z_18))))) (or (forall ((v_z_43 Int)) (let ((.cse33 (+ (* (- 1) v_z_43) .cse1))) (or (not (= (mod .cse33 c_~var_1_65~0) 0)) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div .cse33 c_~var_1_65~0)) (< v_z_43 0) (< 255 v_z_43)))) .cse2) (or (forall ((v_z_28 Int)) (let ((.cse34 (+ .cse1 (* (- 1) v_z_28)))) (or (< |c_ULTIMATE.start_step_#t~bitwise7#1| (+ (div .cse34 c_~var_1_65~0) 1)) (< v_z_28 .cse12) (= (mod .cse34 .cse5) 0) (< 255 v_z_28)))) .cse2) (or .cse6 (forall ((v_z_40 Int)) (let ((.cse35 (div (+ (* (- 1) v_z_40) .cse1) .cse5))) (or (< v_z_40 0) (< |c_ULTIMATE.start_step_#t~bitwise7#1| .cse35) (< .cse1 v_z_40) (= |c_ULTIMATE.start_step_#t~bitwise7#1| .cse35))))) (or (and (forall ((v_z_38 Int)) (let ((.cse36 (+ .cse1 (* (- 1) v_z_38)))) (or (< .cse1 v_z_38) (< v_z_38 0) (not (= (mod .cse36 c_~var_1_65~0) 0)) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div .cse36 c_~var_1_65~0))))) (forall ((v_z_38 Int)) (let ((.cse37 (div (+ .cse1 (* (- 1) v_z_38)) c_~var_1_65~0))) (or (< .cse1 v_z_38) (< v_z_38 0) (= |c_ULTIMATE.start_step_#t~bitwise7#1| .cse37) (< |c_ULTIMATE.start_step_#t~bitwise7#1| .cse37))))) .cse2) (forall ((v_z_40 Int)) (let ((.cse38 (+ (* (- 1) v_z_40) .cse1))) (let ((.cse39 (div .cse38 .cse5))) (or (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div .cse38 c_~var_1_65~0)) (< v_z_40 0) (not (= (mod .cse38 c_~var_1_65~0) 0)) (< |c_ULTIMATE.start_step_#t~bitwise7#1| .cse39) (< .cse1 v_z_40) (= |c_ULTIMATE.start_step_#t~bitwise7#1| .cse39))))) (forall ((v_z_35 Int)) (let ((.cse40 (+ (* (- 1) v_z_35) .cse1))) (or (= (mod .cse40 .cse5) 0) (not (= (mod .cse40 c_~var_1_65~0) 0)) (< v_z_35 0)))) (or (forall ((v_z_40 Int)) (or (< |c_ULTIMATE.start_step_#t~bitwise7#1| (+ (div (+ (* (- 1) v_z_40) .cse1) c_~var_1_65~0) 1)) (< v_z_40 0) (< .cse1 v_z_40))) .cse2) (forall ((v_z_18 Int)) (let ((.cse41 (+ (* (- 1) v_z_18) .cse1))) (or (< |c_ULTIMATE.start_step_#t~bitwise7#1| (+ (div .cse41 c_~var_1_65~0) 1)) (not (= 0 (mod .cse41 .cse5))) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div .cse41 .cse5)) (< 255 v_z_18) (< v_z_18 0)))) (or (forall ((v_z_18 Int)) (let ((.cse42 (+ (* (- 1) v_z_18) .cse1))) (or (not (= 0 (mod .cse42 .cse5))) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div .cse42 c_~var_1_65~0)) (< v_z_18 0) (< .cse1 v_z_18)))) .cse2) (or (forall ((v_z_47 Int)) (let ((.cse43 (+ .cse1 (* (- 1) v_z_47)))) (or (not (= (mod .cse43 c_~var_1_65~0) 0)) (< .cse1 v_z_47) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div .cse43 c_~var_1_65~0)) (< v_z_47 0)))) .cse2) (or (forall ((v_z_23 Int)) (or (< v_z_23 0) (< .cse1 v_z_23) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div (+ .cse1 (* (- 1) v_z_23)) c_~var_1_65~0)))) .cse2) (forall ((v_z_21 Int)) (let ((.cse44 (+ (* (- 1) v_z_21) .cse1))) (or (< .cse1 v_z_21) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div .cse44 .cse5)) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (div .cse44 c_~var_1_65~0)) (< v_z_21 0)))) (forall ((v_z_67 Int)) (let ((.cse45 (+ (* (- 1) v_z_67) .cse1))) (or (< |c_ULTIMATE.start_step_#t~bitwise7#1| (+ (div .cse45 .cse5) 1)) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (+ (div .cse45 c_~var_1_65~0) 1)) (< 255 v_z_67) (< v_z_67 0)))) (forall ((v_z_70 Int)) (let ((.cse46 (+ (* (- 1) v_z_70) .cse1))) (or (< v_z_70 0) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (+ (div .cse46 .cse5) 1)) (not (= (mod .cse46 c_~var_1_65~0) 0)) (< 255 v_z_70) (< |c_ULTIMATE.start_step_#t~bitwise7#1| (+ (div .cse46 c_~var_1_65~0) 1))))) (or .cse6 (forall ((v_z_53 Int)) (let ((.cse48 (+ .cse1 (* (- 1) v_z_53)))) (let ((.cse47 (div .cse48 .cse5))) (or (< v_z_53 0) (< 255 v_z_53) (< |c_ULTIMATE.start_step_#t~bitwise7#1| .cse47) (not (= (mod .cse48 c_~var_1_65~0) 0)) (= |c_ULTIMATE.start_step_#t~bitwise7#1| .cse47)))))) (or .cse6 (forall ((v_z_50 Int)) (let ((.cse49 (+ (* (- 1) v_z_50) .cse1))) (let ((.cse50 (div .cse49 .cse5))) (or (not (= 0 (mod .cse49 c_~var_1_65~0))) (< |c_ULTIMATE.start_step_#t~bitwise7#1| .cse50) (< v_z_50 0) (< 255 v_z_50) (= |c_ULTIMATE.start_step_#t~bitwise7#1| .cse50))))))))) (not (= c_~var_1_41~0 0))) is different from true [2024-12-02 15:04:55,743 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:06:06,170 WARN L286 SmtUtils]: Spent 22.87s on a formula simplification. DAG size of input: 321 DAG size of output: 319 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-02 15:06:25,527 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:06:45,709 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:07:52,027 WARN L286 SmtUtils]: Spent 20.93s on a formula simplification that was a NOOP. DAG size: 319 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-02 15:08:11,138 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:08:31,180 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:08:51,044 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:09:10,733 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:09:30,437 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:09:50,300 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:10:10,192 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:10:29,990 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:10:49,920 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:11:09,822 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:11:29,775 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:11:50,196 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:12:10,586 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:12:28,029 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)