./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-87.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '983db8b9d7b8c1a6cf88f0ccf9f67454cabc986e490bff9f0d35f6b76f68db9d'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-87.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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 983db8b9d7b8c1a6cf88f0ccf9f67454cabc986e490bff9f0d35f6b76f68db9d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:10:42,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:10:42,401 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 09:10:42,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:10:42,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:10:42,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:10:42,428 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:10:42,428 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:10:42,428 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:10:42,428 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:10:42,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:10:42,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:10:42,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:10:42,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:10:42,429 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:10:42,429 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:10:42,429 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:10:42,430 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:10:42,430 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 09:10:42,430 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:10:42,430 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:10:42,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:10:42,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:10:42,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:10:42,430 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:10:42,431 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:10:42,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:10:42,431 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:10:42,431 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:10:42,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:10:42,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:10:42,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:10:42,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:10:42,431 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:10:42,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:10:42,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:10:42,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 09:10:42,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 09:10:42,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:10:42,432 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:10:42,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:10:42,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:10:42,432 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 -> 983db8b9d7b8c1a6cf88f0ccf9f67454cabc986e490bff9f0d35f6b76f68db9d [2024-11-07 09:10:42,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:10:42,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:10:42,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:10:42,763 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:10:42,763 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:10:42,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-87.i [2024-11-07 09:10:44,090 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:10:44,385 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:10:44,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-87.i [2024-11-07 09:10:44,400 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f5433583f/2db49141996c43ccbab3e6c3143c17c2/FLAGda11fb39d [2024-11-07 09:10:44,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f5433583f/2db49141996c43ccbab3e6c3143c17c2 [2024-11-07 09:10:44,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:10:44,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:10:44,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:10:44,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:10:44,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:10:44,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:10:44" (1/1) ... [2024-11-07 09:10:44,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7db82311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:10:44, skipping insertion in model container [2024-11-07 09:10:44,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:10:44" (1/1) ... [2024-11-07 09:10:44,461 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:10:44,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-87.i[916,929] [2024-11-07 09:10:44,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:10:44,691 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:10:44,701 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-87.i[916,929] [2024-11-07 09:10:44,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:10:44,760 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:10:44,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:10:44 WrapperNode [2024-11-07 09:10:44,761 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:10:44,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:10:44,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:10:44,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:10:44,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:10:44" (1/1) ... [2024-11-07 09:10:44,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:10:44" (1/1) ... [2024-11-07 09:10:44,832 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2024-11-07 09:10:44,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:10:44,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:10:44,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:10:44,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:10:44,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:10:44" (1/1) ... [2024-11-07 09:10:44,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:10:44" (1/1) ... [2024-11-07 09:10:44,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:10:44" (1/1) ... [2024-11-07 09:10:44,878 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-11-07 09:10:44,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:10:44" (1/1) ... [2024-11-07 09:10:44,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:10:44" (1/1) ... [2024-11-07 09:10:44,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:10:44" (1/1) ... [2024-11-07 09:10:44,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:10:44" (1/1) ... [2024-11-07 09:10:44,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:10:44" (1/1) ... [2024-11-07 09:10:44,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:10:44" (1/1) ... [2024-11-07 09:10:44,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:10:44,923 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:10:44,923 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:10:44,924 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:10:44,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:10:44" (1/1) ... [2024-11-07 09:10:44,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:10:44,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:10:44,964 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 09:10:44,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 09:10:44,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:10:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:10:44,990 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:10:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 09:10:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:10:44,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:10:45,087 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:10:45,089 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:10:45,594 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-07 09:10:45,594 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:10:45,604 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:10:45,605 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:10:45,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:10:45 BoogieIcfgContainer [2024-11-07 09:10:45,606 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:10:45,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:10:45,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:10:45,614 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:10:45,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:10:44" (1/3) ... [2024-11-07 09:10:45,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3180e085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:10:45, skipping insertion in model container [2024-11-07 09:10:45,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:10:44" (2/3) ... [2024-11-07 09:10:45,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3180e085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:10:45, skipping insertion in model container [2024-11-07 09:10:45,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:10:45" (3/3) ... [2024-11-07 09:10:45,617 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-87.i [2024-11-07 09:10:45,631 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:10:45,632 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:10:45,690 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:10:45,700 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;@46fb8d34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:10:45,700 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:10:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 56 states have internal predecessors, (75), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 09:10:45,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-07 09:10:45,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:10:45,723 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 09:10:45,723 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:10:45,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:10:45,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1518696061, now seen corresponding path program 1 times [2024-11-07 09:10:45,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:10:45,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893119940] [2024-11-07 09:10:45,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:10:45,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:10:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:10:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:10:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 09:10:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:10:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 09:10:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 09:10:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:10:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 09:10:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:10:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 09:10:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:10:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 09:10:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:10:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 09:10:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 09:10:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 09:10:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 09:10:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 09:10:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 09:10:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 09:10:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 09:10:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 09:10:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 09:10:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 09:10:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 09:10:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 09:10:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 09:10:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 09:10:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 09:10:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 09:10:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 09:10:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 09:10:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 09:10:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-07 09:10:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:46,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-07 09:10:46,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:10:46,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893119940] [2024-11-07 09:10:46,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893119940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:10:46,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:10:46,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:10:46,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323391218] [2024-11-07 09:10:46,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:10:46,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:10:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:10:46,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:10:46,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:10:46,342 INFO L87 Difference]: Start difference. First operand has 92 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 56 states have internal predecessors, (75), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-07 09:10:46,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:10:46,383 INFO L93 Difference]: Finished difference Result 177 states and 314 transitions. [2024-11-07 09:10:46,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:10:46,385 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 213 [2024-11-07 09:10:46,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:10:46,393 INFO L225 Difference]: With dead ends: 177 [2024-11-07 09:10:46,394 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 09:10:46,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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-11-07 09:10:46,403 INFO L432 NwaCegarLoop]: 136 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, 136 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-11-07 09:10:46,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:10:46,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 09:10:46,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-07 09:10:46,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 09:10:46,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 136 transitions. [2024-11-07 09:10:46,460 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 136 transitions. Word has length 213 [2024-11-07 09:10:46,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:10:46,462 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 136 transitions. [2024-11-07 09:10:46,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-07 09:10:46,462 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 136 transitions. [2024-11-07 09:10:46,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-07 09:10:46,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:10:46,469 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 09:10:46,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 09:10:46,469 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:10:46,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:10:46,470 INFO L85 PathProgramCache]: Analyzing trace with hash 268510907, now seen corresponding path program 1 times [2024-11-07 09:10:46,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:10:46,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731022908] [2024-11-07 09:10:46,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:10:46,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:10:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:10:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:10:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 09:10:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:10:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 09:10:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 09:10:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:10:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 09:10:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:10:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 09:10:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:10:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 09:10:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:10:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 09:10:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 09:10:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 09:10:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 09:10:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 09:10:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 09:10:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 09:10:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 09:10:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 09:10:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 09:10:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 09:10:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 09:10:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 09:10:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 09:10:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 09:10:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 09:10:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 09:10:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 09:10:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 09:10:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 09:10:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-07 09:10:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-11-07 09:10:47,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:10:47,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731022908] [2024-11-07 09:10:47,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731022908] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 09:10:47,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790654469] [2024-11-07 09:10:47,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:10:47,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 09:10:47,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:10:47,660 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 09:10:47,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 09:10:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:47,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 09:10:47,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:10:48,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1143 proven. 54 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2024-11-07 09:10:48,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 09:10:48,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-11-07 09:10:48,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790654469] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 09:10:48,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 09:10:48,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 09:10:48,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847964293] [2024-11-07 09:10:48,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 09:10:48,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 09:10:48,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:10:48,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 09:10:48,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:10:48,641 INFO L87 Difference]: Start difference. First operand 88 states and 136 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-11-07 09:10:48,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:10:48,974 INFO L93 Difference]: Finished difference Result 181 states and 276 transitions. [2024-11-07 09:10:48,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 09:10:48,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) Word has length 213 [2024-11-07 09:10:48,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:10:48,980 INFO L225 Difference]: With dead ends: 181 [2024-11-07 09:10:48,980 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 09:10:48,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 490 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 09:10:48,982 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 63 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 09:10:48,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 220 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 09:10:48,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 09:10:49,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2024-11-07 09:10:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 55 states have internal predecessors, (70), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 09:10:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 138 transitions. [2024-11-07 09:10:49,005 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 138 transitions. Word has length 213 [2024-11-07 09:10:49,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:10:49,007 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 138 transitions. [2024-11-07 09:10:49,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-11-07 09:10:49,008 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 138 transitions. [2024-11-07 09:10:49,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-07 09:10:49,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:10:49,015 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 09:10:49,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 09:10:49,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 09:10:49,215 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:10:49,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:10:49,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1319836995, now seen corresponding path program 1 times [2024-11-07 09:10:49,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:10:49,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763139280] [2024-11-07 09:10:49,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:10:49,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:10:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:10:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:10:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 09:10:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:10:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 09:10:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 09:10:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 09:10:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 09:10:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 09:10:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 09:10:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 09:10:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 09:10:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 09:10:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 09:10:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 09:10:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 09:10:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 09:10:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 09:10:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 09:10:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 09:10:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 09:10:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 09:10:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 09:10:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 09:10:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 09:10:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 09:10:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 09:10:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 09:10:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 09:10:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 09:10:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 09:10:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 09:10:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 09:10:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-07 09:10:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 132 proven. 60 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2024-11-07 09:10:50,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:10:50,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763139280] [2024-11-07 09:10:50,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763139280] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 09:10:50,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517994804] [2024-11-07 09:10:50,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:10:50,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 09:10:50,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:10:50,660 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 09:10:50,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 09:10:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:50,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 09:10:50,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:10:51,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1229 proven. 60 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2024-11-07 09:10:51,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 09:10:51,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 132 proven. 63 refuted. 0 times theorem prover too weak. 2049 trivial. 0 not checked. [2024-11-07 09:10:51,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517994804] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 09:10:51,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 09:10:51,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2024-11-07 09:10:51,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403966509] [2024-11-07 09:10:51,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 09:10:51,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 09:10:51,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:10:51,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 09:10:51,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-07 09:10:51,685 INFO L87 Difference]: Start difference. First operand 92 states and 138 transitions. Second operand has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 4 states have call successors, (55), 3 states have call predecessors, (55), 7 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) [2024-11-07 09:10:52,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:10:52,802 INFO L93 Difference]: Finished difference Result 304 states and 442 transitions. [2024-11-07 09:10:52,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-07 09:10:52,803 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 4 states have call successors, (55), 3 states have call predecessors, (55), 7 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) Word has length 213 [2024-11-07 09:10:52,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:10:52,808 INFO L225 Difference]: With dead ends: 304 [2024-11-07 09:10:52,808 INFO L226 Difference]: Without dead ends: 215 [2024-11-07 09:10:52,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 485 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=282, Invalid=774, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 09:10:52,810 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 465 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 09:10:52,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 668 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 09:10:52,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-07 09:10:52,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 184. [2024-11-07 09:10:52,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 110 states have (on average 1.2272727272727273) internal successors, (135), 111 states have internal predecessors, (135), 66 states have call successors, (66), 7 states have call predecessors, (66), 7 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 09:10:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 267 transitions. [2024-11-07 09:10:52,850 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 267 transitions. Word has length 213 [2024-11-07 09:10:52,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:10:52,850 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 267 transitions. [2024-11-07 09:10:52,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 4 states have call successors, (55), 3 states have call predecessors, (55), 7 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) [2024-11-07 09:10:52,853 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 267 transitions. [2024-11-07 09:10:52,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-07 09:10:52,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:10:52,858 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 09:10:52,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 09:10:53,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 09:10:53,059 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:10:53,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:10:53,059 INFO L85 PathProgramCache]: Analyzing trace with hash 980985595, now seen corresponding path program 1 times [2024-11-07 09:10:53,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:10:53,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312889720] [2024-11-07 09:10:53,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:10:53,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:10:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 09:10:53,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [985892873] [2024-11-07 09:10:53,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:10:53,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 09:10:53,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:10:53,401 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 09:10:53,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 09:10:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:10:53,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-07 09:10:53,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:10:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1711 proven. 270 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2024-11-07 09:10:58,837 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 09:11:09,060 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse17 (+ c_~var_1_5~0 1)) (.cse8 (div c_~var_1_22~0 c_~var_1_5~0)) (.cse0 (+ |c_ULTIMATE.start_step_~stepLocal_0~0#1| 1))) (let ((.cse6 (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (< c_~var_1_5~0 ~var_1_6~0) (< ~var_1_6~0 0)))) (.cse2 (< c_~var_1_22~0 0)) (.cse4 (forall ((~var_1_6~0 Int)) (let ((.cse31 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse0 .cse31) (= .cse31 .cse0) (< 0 (+ ~var_1_6~0 1)))))) (.cse9 (forall ((~var_1_6~0 Int)) (let ((.cse30 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse0 .cse30) (< c_~var_1_5~0 ~var_1_6~0) (= .cse30 .cse0))))) (.cse12 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0)))) (.cse7 (< 0 (+ c_~var_1_22~0 1))) (.cse21 (< .cse0 .cse8)) (.cse19 (< 0 .cse17)) (.cse5 (< c_~var_1_5~0 0)) (.cse10 (not .cse13)) (.cse11 (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse8)) (.cse14 (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse8)) (.cse16 (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ .cse8 1)))) (and (forall ((~var_1_6~0 Int)) (let ((.cse1 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse0 .cse1) (< c_~var_1_5~0 ~var_1_6~0) (= .cse1 .cse0) (< 0 (+ ~var_1_6~0 1))))) (or (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (< c_~var_1_5~0 ~var_1_6~0))) .cse2) (forall ((~var_1_6~0 Int)) (let ((.cse3 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse0 .cse3) (< c_~var_1_5~0 ~var_1_6~0) (= .cse3 .cse0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (or (and .cse4 (or (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (< 0 (+ ~var_1_6~0 1)))) .cse2)) .cse5) (or .cse2 .cse6) (or .cse7 (forall ((~var_1_6~0 Int)) (or (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or (and (<= .cse0 .cse8) .cse6) .cse2) (or .cse2 .cse9) (or .cse7 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))) (or .cse5 .cse10 .cse4) (or .cse5 (let ((.cse15 (and (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))) (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse17) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))))) (and (or .cse10 .cse11 .cse12) (or .cse10 .cse11) (or .cse7 .cse13 .cse12) (or (and .cse14 .cse12) .cse11) (or .cse15 .cse16) (or .cse15 .cse11 .cse2) (or .cse15 .cse10 .cse11)))) (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (< c_~var_1_5~0 ~var_1_6~0) (< 0 (+ ~var_1_6~0 1)))) .cse2) (forall ((~var_1_6~0 Int)) (let ((.cse18 (div c_~var_1_22~0 ~var_1_6~0))) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse18) (< c_~var_1_5~0 ~var_1_6~0) (= .cse18 |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (< ~var_1_6~0 0)))) (or .cse19 .cse9) (or .cse19 (and (or .cse7 .cse13 .cse4) .cse9)) (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse5 (forall ((~var_1_6~0 Int)) (let ((.cse20 (div c_~var_1_22~0 ~var_1_6~0))) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse20) (< c_~var_1_5~0 ~var_1_6~0) (= .cse20 |c_ULTIMATE.start_step_~stepLocal_0~0#1|))))) (or .cse21 (let ((.cse23 (= .cse8 .cse0)) (.cse22 (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))))) (and (or (and (or .cse22 .cse23) (or .cse7 .cse13 .cse22)) .cse19) (or .cse23 (and (or .cse10 .cse22) (or .cse22 .cse16))) (or .cse10 .cse23) .cse12 (or .cse13 .cse22 .cse16) (or .cse7 .cse19 .cse13)))) (or (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))) .cse5) (or .cse7 (let ((.cse27 (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (let ((.cse26 (forall ((~var_1_6~0 Int)) (or (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (.cse25 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse17) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (.cse24 (or .cse16 .cse27)) (.cse28 (or .cse14 .cse27))) (and (or (and .cse24 (or .cse25 .cse16) (or .cse19 (and (or .cse26 .cse21) (or .cse21 .cse27)))) .cse13) (or (and .cse25 .cse27 (or .cse26 .cse19)) .cse10 .cse11) (or .cse11 (and .cse28 (or .cse25 (and .cse10 .cse14 (<= 0 c_~var_1_5~0))) (or .cse10 .cse27) (or .cse19 .cse27))) (or .cse5 (let ((.cse29 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse17) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or (and .cse24 (or .cse16 .cse29)) .cse13) (or (and .cse28 (or .cse14 .cse29)) .cse11) (or .cse10 .cse11 (and .cse27 .cse29))))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))))))))) is different from false [2024-11-07 09:11:14,559 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~var_1_25~0 c_~var_1_22~0 1)) (.cse15 (+ c_~var_1_5~0 1)) (.cse17 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse0 (+ c_~var_1_25~0 c_~var_1_22~0)) (.cse2 (div c_~var_1_22~0 c_~var_1_5~0))) (let ((.cse13 (< .cse0 (+ .cse2 1))) (.cse9 (< .cse0 .cse2)) (.cse3 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0)))) (.cse4 (< c_~var_1_22~0 0)) (.cse19 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse11 (not .cse17)) (.cse16 (< c_~var_1_5~0 0)) (.cse20 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse5 (< 0 (+ c_~var_1_22~0 1))) (.cse8 (< 0 .cse15)) (.cse18 (< .cse1 .cse2))) (and (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))) (or (and (<= .cse1 .cse2) .cse3) .cse4) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse5 (let ((.cse12 (forall ((~var_1_6~0 Int)) (or (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (let ((.cse6 (or .cse9 .cse12)) (.cse7 (forall ((~var_1_6~0 Int)) (or (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (.cse10 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse15) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (and (or (and .cse6 (or .cse7 .cse8 .cse9) (or .cse9 .cse10)) .cse11) (or (and (<= .cse0 .cse2) (or .cse8 .cse9)) .cse10) (or .cse11 .cse9 .cse12) (or .cse13 .cse12) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))) (or (let ((.cse14 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse15) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse11 (and .cse6 (or .cse9 .cse14))) (or .cse13 .cse14))) .cse16) (or .cse17 (and (or .cse8 (and (or .cse18 .cse12) (or .cse7 .cse18))) (or .cse10 .cse13))) (or .cse8 .cse9 .cse12))))) (or .cse8 .cse19) (or (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) .cse16) (or (forall ((~var_1_6~0 Int)) (or (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))) .cse13) (or .cse16 .cse13) (or .cse5 (forall ((~var_1_6~0 Int)) (or (< .cse1 (div c_~var_1_22~0 ~var_1_6~0)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse11 .cse9) (or .cse8 (and (or .cse5 .cse17 .cse20) .cse19)) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse3 .cse4) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or .cse4 .cse19) (or .cse5 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (or .cse16 .cse11 .cse20) (or .cse16 .cse20) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse5 .cse8 .cse17 .cse18)))) is different from false [2024-11-07 09:11:27,437 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse24 (mod c_~var_1_28~0 65536)) (.cse5 (mod c_~var_1_8~0 256)) (.cse12 (div c_~var_1_22~0 c_~var_1_5~0))) (let ((.cse49 (+ .cse12 1)) (.cse7 (+ c_~var_1_22~0 .cse5)) (.cse37 (+ c_~var_1_5~0 1)) (.cse16 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse11 (+ c_~var_1_22~0 1 .cse5)) (.cse0 (+ .cse24 c_~var_1_22~0))) (let ((.cse1 (forall ((~var_1_6~0 Int)) (or (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< 0 (+ ~var_1_6~0 1))))) (.cse4 (mod c_~var_1_28~0 4294967296)) (.cse19 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536))))) (.cse23 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< ~var_1_6~0 0)))) (.cse17 (< .cse11 .cse12)) (.cse6 (< 0 (+ c_~var_1_22~0 1))) (.cse3 (not .cse16)) (.cse14 (< 0 .cse37)) (.cse10 (< .cse7 .cse12)) (.cse9 (< c_~var_1_22~0 0)) (.cse18 (< .cse7 .cse49)) (.cse22 (+ .cse24 c_~var_1_22~0 1)) (.cse21 (forall ((~var_1_6~0 Int)) (or (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1))))) (.cse2 (< c_~var_1_5~0 0))) (and (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)))) (or .cse1 .cse2) (or .cse1 .cse2 .cse3) (or (< .cse4 (+ 1 .cse5)) (let ((.cse8 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse7 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0)))) (.cse13 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse7 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse15 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse7 (div c_~var_1_22~0 ~var_1_6~0)))))) (and (or .cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse7 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< 0 (+ ~var_1_6~0 1)) (< .cse7 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse8 .cse9) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse7 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (or .cse10 .cse3) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse7 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse9 (and .cse8 (<= .cse11 .cse12))) (or .cse13 .cse2) (or .cse14 .cse15) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse7 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or .cse6 .cse14 .cse16 .cse17) (or .cse13 .cse2 .cse3) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse7 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse7 (div c_~var_1_22~0 ~var_1_6~0)))) .cse2) (or .cse14 (and .cse15 (or .cse6 .cse13 .cse16))) (or .cse18 (forall ((~var_1_6~0 Int)) (or (< .cse7 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse7 (div c_~var_1_22~0 ~var_1_6~0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse7 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))) (or .cse9 .cse15) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse11 (div c_~var_1_22~0 ~var_1_6~0)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse18 .cse2)))) (or .cse19 .cse9) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (< ~var_1_6~0 0))) (or (let ((.cse20 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))))) (and .cse1 (or .cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse20 .cse9) .cse21 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< .cse22 (div c_~var_1_22~0 ~var_1_6~0)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or .cse20 .cse14) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))))) (< .cse5 .cse4)) (or .cse19 .cse14) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse3 (< .cse0 (+ 65536 .cse12))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< 0 (+ ~var_1_6~0 1)))) (or .cse23 .cse9) (or .cse9 (and .cse23 (<= .cse0 (+ .cse12 65535)))) (or (< 32767 .cse24) (let ((.cse26 (< .cse22 .cse12)) (.cse28 (forall ((~var_1_6~0 Int)) (let ((.cse52 (div c_~var_1_22~0 ~var_1_6~0))) (or (< 0 (+ ~var_1_6~0 1)) (< .cse0 .cse52) (< .cse7 .cse52))))) (.cse27 (forall ((~var_1_6~0 Int)) (let ((.cse51 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse51) (< .cse7 .cse51))))) (.cse46 (forall ((~var_1_6~0 Int)) (let ((.cse50 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse50) (< .cse7 .cse50) (< ~var_1_6~0 0))))) (.cse33 (< .cse0 .cse12)) (.cse25 (< .cse0 .cse49))) (and (or .cse25 .cse18 .cse2) (or .cse26 .cse14 .cse16 .cse17) (or (and .cse27 (or .cse28 .cse16)) .cse14) (forall ((~var_1_6~0 Int)) (let ((.cse29 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse29) (< .cse7 .cse29)))) (forall ((~var_1_6~0 Int)) (let ((.cse30 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< 0 (+ ~var_1_6~0 1)) (< .cse0 .cse30) (< .cse7 .cse30)))) (or .cse6 (let ((.cse35 (forall ((~var_1_6~0 Int)) (let ((.cse39 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< .cse0 .cse39) (< .cse7 .cse39) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))))) (let ((.cse34 (forall ((~var_1_6~0 Int)) (or (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (.cse31 (or .cse10 .cse35 .cse33)) (.cse32 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse37) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (and (or (and .cse31 (or .cse10 .cse32 .cse33) (or .cse10 .cse34 .cse14 .cse33)) .cse3) (or .cse16 (and (or (and (or .cse35 .cse26 .cse17) (or .cse34 .cse26 .cse17)) .cse14) (or .cse25 .cse18 .cse32))) (or .cse35 .cse25 .cse18) (or .cse10 .cse35 .cse3 .cse33) (or .cse10 .cse35 .cse14 .cse33) (or .cse2 (let ((.cse36 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse37) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse25 .cse18 .cse36) (or (and .cse31 (or .cse10 .cse33 .cse36)) .cse3)))) (forall ((~var_1_6~0 Int)) (let ((.cse38 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse38) (< .cse7 .cse38) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (or .cse32 (and (or .cse10 .cse14 .cse33) (or .cse25 .cse18))))))) (or .cse28 .cse2) (forall ((~var_1_6~0 Int)) (let ((.cse40 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 .cse40) (< .cse7 .cse40)))) (forall ((~var_1_6~0 Int)) (let ((.cse41 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse41) (< .cse7 .cse41) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (let ((.cse42 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 .cse42) (< .cse7 .cse42) (< ~var_1_6~0 0)))) (or .cse6 (forall ((~var_1_6~0 Int)) (let ((.cse43 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse43) (< .cse7 .cse43) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (or .cse6 (forall ((~var_1_6~0 Int)) (let ((.cse44 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse22 .cse44) (< 0 (+ ~var_1_6~0 1)) (< .cse11 .cse44) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (or .cse27 .cse9) (or .cse28 .cse2 .cse3) (forall ((~var_1_6~0 Int)) (let ((.cse45 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse0 .cse45) (< .cse7 .cse45)))) (or .cse10 .cse3 .cse33) (or .cse46 .cse9) (or (forall ((~var_1_6~0 Int)) (let ((.cse47 (div c_~var_1_22~0 ~var_1_6~0))) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse0 .cse47) (< .cse7 .cse47)))) .cse2) (or .cse14 .cse27) (or (and .cse46 (or .cse10 .cse33)) .cse9) (or (forall ((~var_1_6~0 Int)) (let ((.cse48 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< .cse0 .cse48) (< .cse7 .cse48) (< ~var_1_6~0 0)))) .cse25 .cse18)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))) (or .cse2 (< .cse0 (+ .cse12 65537))) (or .cse21 .cse2))))) is different from false [2024-11-07 09:11:31,450 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse24 (mod c_~var_1_28~0 65536)) (.cse5 (mod c_~var_1_8~0 256)) (.cse12 (div c_~var_1_22~0 c_~var_1_5~0))) (let ((.cse49 (+ .cse12 1)) (.cse7 (+ c_~var_1_22~0 .cse5)) (.cse37 (+ c_~var_1_5~0 1)) (.cse16 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse11 (+ c_~var_1_22~0 1 .cse5)) (.cse0 (+ .cse24 c_~var_1_22~0))) (let ((.cse1 (forall ((~var_1_6~0 Int)) (or (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< 0 (+ ~var_1_6~0 1))))) (.cse4 (mod c_~var_1_28~0 4294967296)) (.cse19 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536))))) (.cse23 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< ~var_1_6~0 0)))) (.cse17 (< .cse11 .cse12)) (.cse6 (< 0 (+ c_~var_1_22~0 1))) (.cse3 (not .cse16)) (.cse14 (< 0 .cse37)) (.cse10 (< .cse7 .cse12)) (.cse9 (< c_~var_1_22~0 0)) (.cse18 (< .cse7 .cse49)) (.cse22 (+ .cse24 c_~var_1_22~0 1)) (.cse21 (forall ((~var_1_6~0 Int)) (or (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1))))) (.cse2 (< c_~var_1_5~0 0))) (and (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)))) (or .cse1 .cse2) (or .cse1 .cse2 .cse3) (or (< .cse4 (+ 1 .cse5)) (let ((.cse8 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse7 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0)))) (.cse13 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse7 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse15 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse7 (div c_~var_1_22~0 ~var_1_6~0)))))) (and (or .cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse7 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< 0 (+ ~var_1_6~0 1)) (< .cse7 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse8 .cse9) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse7 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (or .cse10 .cse3) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse7 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse9 (and .cse8 (<= .cse11 .cse12))) (or .cse13 .cse2) (or .cse14 .cse15) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse7 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or .cse6 .cse14 .cse16 .cse17) (or .cse13 .cse2 .cse3) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse7 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse7 (div c_~var_1_22~0 ~var_1_6~0)))) .cse2) (or .cse14 (and .cse15 (or .cse6 .cse13 .cse16))) (or .cse18 (forall ((~var_1_6~0 Int)) (or (< .cse7 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse7 (div c_~var_1_22~0 ~var_1_6~0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse7 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))) (or .cse9 .cse15) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse11 (div c_~var_1_22~0 ~var_1_6~0)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse18 .cse2)))) (or .cse19 .cse9) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (< ~var_1_6~0 0))) (or (let ((.cse20 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))))) (and .cse1 (or .cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse20 .cse9) .cse21 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< .cse22 (div c_~var_1_22~0 ~var_1_6~0)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or .cse20 .cse14) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))))) (< .cse5 .cse4)) (or .cse19 .cse14) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse3 (< .cse0 (+ 65536 .cse12))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< 0 (+ ~var_1_6~0 1)))) (or .cse23 .cse9) (or .cse9 (and .cse23 (<= .cse0 (+ .cse12 65535)))) (or (< 32767 .cse24) (let ((.cse26 (< .cse22 .cse12)) (.cse28 (forall ((~var_1_6~0 Int)) (let ((.cse52 (div c_~var_1_22~0 ~var_1_6~0))) (or (< 0 (+ ~var_1_6~0 1)) (< .cse0 .cse52) (< .cse7 .cse52))))) (.cse27 (forall ((~var_1_6~0 Int)) (let ((.cse51 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse51) (< .cse7 .cse51))))) (.cse46 (forall ((~var_1_6~0 Int)) (let ((.cse50 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse50) (< .cse7 .cse50) (< ~var_1_6~0 0))))) (.cse33 (< .cse0 .cse12)) (.cse25 (< .cse0 .cse49))) (and (or .cse25 .cse18 .cse2) (or .cse26 .cse14 .cse16 .cse17) (or (and .cse27 (or .cse28 .cse16)) .cse14) (forall ((~var_1_6~0 Int)) (let ((.cse29 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse29) (< .cse7 .cse29)))) (forall ((~var_1_6~0 Int)) (let ((.cse30 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< 0 (+ ~var_1_6~0 1)) (< .cse0 .cse30) (< .cse7 .cse30)))) (or .cse6 (let ((.cse35 (forall ((~var_1_6~0 Int)) (let ((.cse39 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< .cse0 .cse39) (< .cse7 .cse39) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))))) (let ((.cse34 (forall ((~var_1_6~0 Int)) (or (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (.cse31 (or .cse10 .cse35 .cse33)) (.cse32 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse37) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (and (or (and .cse31 (or .cse10 .cse32 .cse33) (or .cse10 .cse34 .cse14 .cse33)) .cse3) (or .cse16 (and (or (and (or .cse35 .cse26 .cse17) (or .cse34 .cse26 .cse17)) .cse14) (or .cse25 .cse18 .cse32))) (or .cse35 .cse25 .cse18) (or .cse10 .cse35 .cse3 .cse33) (or .cse10 .cse35 .cse14 .cse33) (or .cse2 (let ((.cse36 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse37) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse25 .cse18 .cse36) (or (and .cse31 (or .cse10 .cse33 .cse36)) .cse3)))) (forall ((~var_1_6~0 Int)) (let ((.cse38 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse38) (< .cse7 .cse38) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (or .cse32 (and (or .cse10 .cse14 .cse33) (or .cse25 .cse18))))))) (or .cse28 .cse2) (forall ((~var_1_6~0 Int)) (let ((.cse40 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 .cse40) (< .cse7 .cse40)))) (forall ((~var_1_6~0 Int)) (let ((.cse41 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse41) (< .cse7 .cse41) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (let ((.cse42 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 .cse42) (< .cse7 .cse42) (< ~var_1_6~0 0)))) (or .cse6 (forall ((~var_1_6~0 Int)) (let ((.cse43 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse43) (< .cse7 .cse43) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (or .cse6 (forall ((~var_1_6~0 Int)) (let ((.cse44 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse22 .cse44) (< 0 (+ ~var_1_6~0 1)) (< .cse11 .cse44) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (or .cse27 .cse9) (or .cse28 .cse2 .cse3) (forall ((~var_1_6~0 Int)) (let ((.cse45 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse0 .cse45) (< .cse7 .cse45)))) (or .cse10 .cse3 .cse33) (or .cse46 .cse9) (or (forall ((~var_1_6~0 Int)) (let ((.cse47 (div c_~var_1_22~0 ~var_1_6~0))) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse0 .cse47) (< .cse7 .cse47)))) .cse2) (or .cse14 .cse27) (or (and .cse46 (or .cse10 .cse33)) .cse9) (or (forall ((~var_1_6~0 Int)) (let ((.cse48 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< .cse0 .cse48) (< .cse7 .cse48) (< ~var_1_6~0 0)))) .cse25 .cse18)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))) (or .cse2 (< .cse0 (+ .cse12 65537))) (or .cse21 .cse2))))) is different from true [2024-11-07 09:11:42,781 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse27 (mod c_~var_1_8~0 256))) (let ((.cse3 (mod c_~var_1_28~0 65536)) (.cse10 (+ c_~var_1_22~0 .cse27)) (.cse7 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse19 (+ c_~var_1_22~0 1 .cse27)) (.cse5 (div c_~var_1_22~0 c_~var_1_5~0))) (let ((.cse8 (< .cse19 .cse5)) (.cse22 (not .cse7)) (.cse21 (< .cse10 .cse5)) (.cse1 (< c_~var_1_22~0 0)) (.cse2 (< 0 (+ c_~var_1_22~0 1))) (.cse4 (+ .cse3 c_~var_1_22~0 1)) (.cse6 (< 0 (+ c_~var_1_5~0 1))) (.cse26 (mod c_~var_1_28~0 4294967296)) (.cse0 (+ .cse3 c_~var_1_22~0))) (and (forall ((~var_1_6~0 Int)) (or (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< 0 (+ ~var_1_6~0 1)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)))) (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)))) .cse1) (forall ((~var_1_6~0 Int)) (or (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (< ~var_1_6~0 0))) (or .cse2 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or (< 32767 .cse3) (let ((.cse20 (forall ((~var_1_6~0 Int)) (let ((.cse25 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse25) (< .cse10 .cse25))))) (.cse23 (< .cse0 .cse5))) (and (or (< .cse4 .cse5) .cse6 .cse7 .cse8) (forall ((~var_1_6~0 Int)) (let ((.cse9 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse9) (< .cse10 .cse9)))) (forall ((~var_1_6~0 Int)) (let ((.cse11 (div c_~var_1_22~0 ~var_1_6~0))) (or (< 0 (+ ~var_1_6~0 1)) (< .cse0 .cse11) (< .cse10 .cse11)))) (forall ((~var_1_6~0 Int)) (let ((.cse12 (div c_~var_1_22~0 ~var_1_6~0))) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse0 .cse12) (< .cse10 .cse12)))) (forall ((~var_1_6~0 Int)) (let ((.cse13 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 .cse13) (< .cse10 .cse13)))) (forall ((~var_1_6~0 Int)) (let ((.cse14 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse14) (< .cse10 .cse14) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (let ((.cse15 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 .cse15) (< .cse10 .cse15) (< ~var_1_6~0 0)))) (or .cse2 (forall ((~var_1_6~0 Int)) (let ((.cse16 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse16) (< .cse10 .cse16) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (let ((.cse17 (+ .cse5 1))) (or (< .cse0 .cse17) (< .cse10 .cse17))) (or .cse2 (forall ((~var_1_6~0 Int)) (let ((.cse18 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse4 .cse18) (< 0 (+ ~var_1_6~0 1)) (< .cse19 .cse18) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (or .cse20 .cse1) (or .cse21 .cse22 .cse23) (or .cse6 .cse20) (or .cse2 (forall ((~var_1_6~0 Int)) (let ((.cse24 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse24) (< .cse10 .cse24) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (or .cse21 .cse1 .cse23)))) (or (< .cse26 (+ 1 .cse27)) (let ((.cse28 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))))) (and (or .cse6 .cse7 .cse8) (or .cse2 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse21 .cse22) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse21 .cse1) (<= .cse10 .cse5) (or .cse6 .cse28) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or .cse2 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))) (or .cse1 .cse28) (or .cse2 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse19 (div c_~var_1_22~0 ~var_1_6~0)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))))) (or (let ((.cse29 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))))) (and (or .cse2 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse2 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse29 .cse1) (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse2 (forall ((~var_1_6~0 Int)) (or (< .cse4 (div c_~var_1_22~0 ~var_1_6~0)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or .cse29 .cse6) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))))) (< .cse27 .cse26)) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))))))) is different from false [2024-11-07 09:12:01,241 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~var_1_18~0 65536))) (or (< |c_ULTIMATE.start_step_~stepLocal_5~0#1| (+ .cse0 1)) (let ((.cse15 (mod c_~var_1_8~0 256))) (let ((.cse38 (div c_~var_1_22~0 c_~var_1_5~0)) (.cse28 (+ c_~var_1_22~0 .cse15))) (let ((.cse37 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse28 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse12 (< c_~var_1_22~0 0)) (.cse39 (< .cse28 .cse38)) (.cse4 (< 0 (+ c_~var_1_22~0 1))) (.cse13 (< 0 (+ c_~var_1_5~0 1))) (.cse40 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse26 (+ c_~var_1_22~0 1 .cse15))) (let ((.cse1 (mod c_~var_1_7~0 256)) (.cse3 (or .cse13 .cse40 (< .cse26 .cse38))) (.cse5 (or .cse4 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse28 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (.cse6 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse28 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse7 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse28 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0)))) (.cse8 (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse28 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse9 (or .cse39 (not .cse40))) (.cse10 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse28 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse11 (or .cse39 .cse12)) (.cse16 (<= .cse28 .cse38)) (.cse17 (or .cse13 .cse37)) (.cse18 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse28 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))))) (.cse19 (or .cse4 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse28 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (.cse20 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse28 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0)))) (.cse21 (or .cse12 .cse37)) (.cse22 (or .cse4 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse26 (div c_~var_1_22~0 ~var_1_6~0)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))))) (and (or (< .cse1 .cse0) (let ((.cse2 (+ c_~var_1_22~0 .cse1 .cse15))) (and (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse2 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (< ~var_1_6~0 0))) .cse3 (or .cse4 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse2 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse2 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)))) .cse12) (or (let ((.cse14 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse2 (div c_~var_1_22~0 ~var_1_6~0)))))) (and (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse2 (div c_~var_1_22~0 ~var_1_6~0)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))) (forall ((~var_1_6~0 Int)) (or (< .cse2 (div c_~var_1_22~0 ~var_1_6~0)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse2 (div c_~var_1_22~0 ~var_1_6~0)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse13 .cse14) (or .cse4 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse2 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse4 (forall ((~var_1_6~0 Int)) (or (< (+ c_~var_1_22~0 .cse1 1 .cse15) (div c_~var_1_22~0 ~var_1_6~0)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse4 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse2 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse2 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))) (forall ((~var_1_6~0 Int)) (or (< .cse2 (div c_~var_1_22~0 ~var_1_6~0)) (< 0 (+ ~var_1_6~0 1)))) (or .cse12 .cse14) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse2 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))))) (< 0 .cse1)) (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse2 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)))) .cse16 .cse17 .cse18 .cse19 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse2 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< ~var_1_6~0 0))) (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse2 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)))) .cse20 .cse21 .cse22 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse2 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse2 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536))))))) (or (< .cse0 (+ .cse1 1)) (let ((.cse24 (mod (+ .cse15 c_~var_1_18~0) 65536))) (let ((.cse23 (+ c_~var_1_22~0 .cse24))) (and .cse3 .cse5 .cse6 (forall ((~var_1_6~0 Int)) (or (< .cse23 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))) .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 (forall ((~var_1_6~0 Int)) (or (< .cse23 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (< c_~var_1_5~0 ~var_1_6~0))) (forall ((~var_1_6~0 Int)) (or (< .cse23 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< 0 (+ ~var_1_6~0 1)))) .cse17 (forall ((~var_1_6~0 Int)) (or (< .cse23 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))) .cse18 .cse19 (or .cse4 (forall ((~var_1_6~0 Int)) (or (< .cse23 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (< c_~var_1_5~0 ~var_1_6~0) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or (< 32767 .cse24) (and (or .cse4 (forall ((~var_1_6~0 Int)) (let ((.cse25 (div c_~var_1_22~0 ~var_1_6~0))) (or (< (+ c_~var_1_22~0 1 .cse24) .cse25) (< 0 (+ ~var_1_6~0 1)) (< .cse26 .cse25) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (forall ((~var_1_6~0 Int)) (let ((.cse27 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse23 .cse27) (< .cse28 .cse27)))) (forall ((~var_1_6~0 Int)) (let ((.cse29 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse23 .cse29) (< .cse28 .cse29) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (let ((.cse30 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse23 .cse30) (< .cse28 .cse30) (< ~var_1_6~0 0)))) (or .cse4 (forall ((~var_1_6~0 Int)) (let ((.cse31 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse23 .cse31) (< .cse28 .cse31) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (or .cse4 (forall ((~var_1_6~0 Int)) (let ((.cse32 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse23 .cse32) (< .cse28 .cse32) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (forall ((~var_1_6~0 Int)) (let ((.cse33 (div c_~var_1_22~0 ~var_1_6~0))) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse23 .cse33) (< .cse28 .cse33)))) (or (forall ((~var_1_6~0 Int)) (let ((.cse34 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse23 .cse34) (< .cse28 .cse34)))) .cse13) (forall ((~var_1_6~0 Int)) (let ((.cse35 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse23 .cse35) (< .cse28 .cse35)))) (forall ((~var_1_6~0 Int)) (let ((.cse36 (div c_~var_1_22~0 ~var_1_6~0))) (or (< 0 (+ ~var_1_6~0 1)) (< .cse23 .cse36) (< .cse28 .cse36)))))) (forall ((~var_1_6~0 Int)) (or (< .cse23 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (< c_~var_1_5~0 ~var_1_6~0) (< ~var_1_6~0 0))) .cse20 .cse21 (forall ((~var_1_6~0 Int)) (or (< .cse23 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) .cse22 (or (forall ((~var_1_6~0 Int)) (or (< .cse23 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< c_~var_1_5~0 ~var_1_6~0))) .cse12)))))))))))) is different from true