./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-87.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:24:03,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:24:03,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 12:24:03,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:24:03,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:24:03,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:24:03,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:24:03,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:24:03,733 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:24:03,734 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:24:03,734 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:24:03,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:24:03,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:24:03,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:24:03,737 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:24:03,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:24:03,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:24:03,740 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:24:03,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 12:24:03,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:24:03,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:24:03,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:24:03,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:24:03,746 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:24:03,746 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:24:03,746 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:24:03,747 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:24:03,747 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:24:03,747 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:24:03,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:24:03,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:24:03,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:24:03,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:24:03,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:24:03,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:24:03,749 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:24:03,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 12:24:03,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 12:24:03,753 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:24:03,753 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:24:03,754 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:24:03,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:24:03,754 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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-10-14 12:24:04,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:24:04,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:24:04,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:24:04,086 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:24:04,086 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:24:04,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-87.i [2024-10-14 12:24:05,712 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:24:05,959 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:24:05,959 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-87.i [2024-10-14 12:24:05,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/037113d60/0f5f2fb96ef149b299aefcadcf85d3c4/FLAG13249a10d [2024-10-14 12:24:06,294 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/037113d60/0f5f2fb96ef149b299aefcadcf85d3c4 [2024-10-14 12:24:06,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:24:06,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:24:06,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:24:06,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:24:06,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:24:06,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:24:06" (1/1) ... [2024-10-14 12:24:06,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c77802b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:06, skipping insertion in model container [2024-10-14 12:24:06,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:24:06" (1/1) ... [2024-10-14 12:24:06,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:24:06,493 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-87.i[916,929] [2024-10-14 12:24:06,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:24:06,607 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:24:06,620 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-87.i[916,929] [2024-10-14 12:24:06,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:24:06,769 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:24:06,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:06 WrapperNode [2024-10-14 12:24:06,771 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:24:06,772 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:24:06,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:24:06,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:24:06,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:06" (1/1) ... [2024-10-14 12:24:06,802 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:06" (1/1) ... [2024-10-14 12:24:06,863 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2024-10-14 12:24:06,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:24:06,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:24:06,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:24:06,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:24:06,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:06" (1/1) ... [2024-10-14 12:24:06,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:06" (1/1) ... [2024-10-14 12:24:06,895 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:06" (1/1) ... [2024-10-14 12:24:06,932 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-10-14 12:24:06,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:06" (1/1) ... [2024-10-14 12:24:06,933 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:06" (1/1) ... [2024-10-14 12:24:06,944 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:06" (1/1) ... [2024-10-14 12:24:06,948 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:06" (1/1) ... [2024-10-14 12:24:06,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:06" (1/1) ... [2024-10-14 12:24:06,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:06" (1/1) ... [2024-10-14 12:24:06,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:24:06,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:24:06,968 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:24:06,968 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:24:06,969 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:06" (1/1) ... [2024-10-14 12:24:06,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:24:06,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:24:07,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 12:24:07,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 12:24:07,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:24:07,064 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:24:07,065 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:24:07,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 12:24:07,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:24:07,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:24:07,175 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:24:07,177 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:24:07,772 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-14 12:24:07,772 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:24:07,839 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:24:07,840 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:24:07,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:24:07 BoogieIcfgContainer [2024-10-14 12:24:07,840 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:24:07,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:24:07,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:24:07,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:24:07,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:24:06" (1/3) ... [2024-10-14 12:24:07,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3d049e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:24:07, skipping insertion in model container [2024-10-14 12:24:07,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:06" (2/3) ... [2024-10-14 12:24:07,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3d049e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:24:07, skipping insertion in model container [2024-10-14 12:24:07,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:24:07" (3/3) ... [2024-10-14 12:24:07,853 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-87.i [2024-10-14 12:24:07,871 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:24:07,871 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:24:07,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:24:07,945 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;@1c31fa66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:24:07,945 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:24:07,950 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 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-10-14 12:24:07,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-14 12:24:07,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:24:07,969 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] [2024-10-14 12:24:07,969 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:24:07,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:24:07,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1740645682, now seen corresponding path program 1 times [2024-10-14 12:24:07,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:24:07,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979776407] [2024-10-14 12:24:07,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:24:07,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:24:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:24:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:24:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 12:24:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:24:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 12:24:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 12:24:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 12:24:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 12:24:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 12:24:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 12:24:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 12:24:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 12:24:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:24:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 12:24:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:24:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 12:24:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 12:24:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 12:24:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 12:24:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 12:24:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 12:24:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 12:24:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 12:24:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 12:24:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 12:24:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 12:24:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 12:24:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 12:24:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 12:24:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 12:24:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 12:24:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 12:24:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 12:24:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 12:24:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-14 12:24:08,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:24:08,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979776407] [2024-10-14 12:24:08,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979776407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:24:08,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:24:08,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:24:08,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096192202] [2024-10-14 12:24:08,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:24:08,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:24:08,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:24:08,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:24:08,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:24:08,761 INFO L87 Difference]: Start difference. First operand has 86 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 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 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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-10-14 12:24:08,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:24:08,846 INFO L93 Difference]: Finished difference Result 169 states and 306 transitions. [2024-10-14 12:24:08,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:24:08,853 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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 209 [2024-10-14 12:24:08,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:24:08,862 INFO L225 Difference]: With dead ends: 169 [2024-10-14 12:24:08,862 INFO L226 Difference]: Without dead ends: 84 [2024-10-14 12:24:08,870 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-10-14 12:24:08,878 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:24:08,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:24:08,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-14 12:24:08,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-14 12:24:08,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 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-10-14 12:24:08,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 132 transitions. [2024-10-14 12:24:08,942 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 132 transitions. Word has length 209 [2024-10-14 12:24:08,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:24:08,942 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 132 transitions. [2024-10-14 12:24:08,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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-10-14 12:24:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 132 transitions. [2024-10-14 12:24:08,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-14 12:24:08,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:24:08,953 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] [2024-10-14 12:24:08,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 12:24:08,954 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:24:08,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:24:08,955 INFO L85 PathProgramCache]: Analyzing trace with hash 810858134, now seen corresponding path program 1 times [2024-10-14 12:24:08,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:24:08,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691921214] [2024-10-14 12:24:08,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:24:08,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:24:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:24:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:24:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 12:24:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:24:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 12:24:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 12:24:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 12:24:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 12:24:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 12:24:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 12:24:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 12:24:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 12:24:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:24:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 12:24:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:24:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 12:24:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 12:24:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 12:24:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 12:24:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 12:24:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 12:24:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 12:24:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 12:24:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 12:24:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 12:24:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 12:24:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 12:24:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 12:24:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 12:24:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 12:24:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 12:24:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 12:24:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 12:24:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 12:24:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-14 12:24:10,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:24:10,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691921214] [2024-10-14 12:24:10,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691921214] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 12:24:10,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666056371] [2024-10-14 12:24:10,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:24:10,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 12:24:10,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:24:10,350 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 12:24:10,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 12:24:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:10,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 12:24:10,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:24:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1143 proven. 54 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2024-10-14 12:24:11,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 12:24:11,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-14 12:24:11,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666056371] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 12:24:11,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 12:24:11,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-14 12:24:11,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348525277] [2024-10-14 12:24:11,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 12:24:11,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 12:24:11,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:24:11,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 12:24:11,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 12:24:11,348 INFO L87 Difference]: Start difference. First operand 84 states and 132 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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-10-14 12:24:11,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:24:11,705 INFO L93 Difference]: Finished difference Result 175 states and 270 transitions. [2024-10-14 12:24:11,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 12:24:11,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 209 [2024-10-14 12:24:11,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:24:11,711 INFO L225 Difference]: With dead ends: 175 [2024-10-14 12:24:11,711 INFO L226 Difference]: Without dead ends: 92 [2024-10-14 12:24:11,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 481 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-14 12:24:11,720 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 60 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 12:24:11,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 203 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 12:24:11,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-14 12:24:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2024-10-14 12:24:11,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 states have internal predecessors, (66), 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-10-14 12:24:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 134 transitions. [2024-10-14 12:24:11,753 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 134 transitions. Word has length 209 [2024-10-14 12:24:11,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:24:11,754 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 134 transitions. [2024-10-14 12:24:11,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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-10-14 12:24:11,755 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 134 transitions. [2024-10-14 12:24:11,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-14 12:24:11,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:24:11,764 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] [2024-10-14 12:24:11,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 12:24:11,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 12:24:11,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:24:11,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:24:11,970 INFO L85 PathProgramCache]: Analyzing trace with hash -210210220, now seen corresponding path program 1 times [2024-10-14 12:24:11,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:24:11,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150145342] [2024-10-14 12:24:11,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:24:11,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:24:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:24:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:24:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 12:24:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:24:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 12:24:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 12:24:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 12:24:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 12:24:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 12:24:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 12:24:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 12:24:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 12:24:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:24:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 12:24:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:24:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 12:24:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 12:24:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 12:24:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 12:24:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 12:24:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 12:24:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 12:24:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 12:24:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 12:24:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 12:24:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 12:24:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 12:24:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 12:24:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 12:24:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 12:24:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 12:24:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 12:24:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 12:24:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 12:24:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 132 proven. 60 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2024-10-14 12:24:13,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:24:13,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150145342] [2024-10-14 12:24:13,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150145342] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 12:24:13,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105112981] [2024-10-14 12:24:13,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:24:13,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 12:24:13,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:24:13,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 12:24:13,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 12:24:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:13,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 12:24:13,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:24:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1229 proven. 60 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2024-10-14 12:24:14,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 12:24:14,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 132 proven. 63 refuted. 0 times theorem prover too weak. 2049 trivial. 0 not checked. [2024-10-14 12:24:14,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105112981] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 12:24:14,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 12:24:14,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 19 [2024-10-14 12:24:14,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120626806] [2024-10-14 12:24:14,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 12:24:14,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 12:24:14,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:24:14,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 12:24:14,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2024-10-14 12:24:14,748 INFO L87 Difference]: Start difference. First operand 88 states and 134 transitions. Second operand has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 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-10-14 12:24:15,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:24:15,749 INFO L93 Difference]: Finished difference Result 296 states and 434 transitions. [2024-10-14 12:24:15,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 12:24:15,751 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 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 209 [2024-10-14 12:24:15,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:24:15,754 INFO L225 Difference]: With dead ends: 296 [2024-10-14 12:24:15,754 INFO L226 Difference]: Without dead ends: 209 [2024-10-14 12:24:15,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 474 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2024-10-14 12:24:15,756 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 354 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 12:24:15,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 511 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 12:24:15,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-14 12:24:15,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 178. [2024-10-14 12:24:15,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 104 states have (on average 1.2403846153846154) internal successors, (129), 105 states have internal predecessors, (129), 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-10-14 12:24:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 261 transitions. [2024-10-14 12:24:15,807 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 261 transitions. Word has length 209 [2024-10-14 12:24:15,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:24:15,810 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 261 transitions. [2024-10-14 12:24:15,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 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-10-14 12:24:15,810 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 261 transitions. [2024-10-14 12:24:15,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-14 12:24:15,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:24:15,818 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] [2024-10-14 12:24:15,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 12:24:16,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-14 12:24:16,021 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:24:16,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:24:16,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1798558122, now seen corresponding path program 1 times [2024-10-14 12:24:16,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:24:16,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529071310] [2024-10-14 12:24:16,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:24:16,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:24:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 12:24:16,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [610287151] [2024-10-14 12:24:16,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:24:16,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 12:24:16,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:24:16,373 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 12:24:16,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 12:24:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:16,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-14 12:24:16,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:24:22,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1693 proven. 303 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-10-14 12:24:22,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 12:24:34,979 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-10-14 12:24:38,994 WARN L873 $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 true [2024-10-14 12:24:45,294 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)) (.cse2 (div c_~var_1_22~0 c_~var_1_5~0)) (.cse0 (+ c_~var_1_25~0 c_~var_1_22~0))) (let ((.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)))) (.cse9 (< .cse0 .cse2)) (.cse20 (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 (< .cse0 (+ .cse2 1))) (.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)) (.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))))) (.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 .cse20 .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 .cse21) .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 .cse20 .cse8 .cse9) (or .cse20 .cse17 .cse13) (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 .cse21) (or .cse16 .cse21) (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-10-14 12:25:01,119 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~var_1_28~0 65536)) (.cse42 (mod c_~var_1_8~0 256)) (.cse28 (div c_~var_1_22~0 c_~var_1_5~0))) (let ((.cse30 (+ .cse28 1)) (.cse20 (+ c_~var_1_22~0 1 .cse42)) (.cse47 (+ c_~var_1_5~0 1)) (.cse10 (+ c_~var_1_22~0 .cse42)) (.cse7 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse0 (+ .cse1 c_~var_1_22~0))) (let ((.cse34 (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))))) (.cse18 (+ .cse1 c_~var_1_22~0 1)) (.cse39 (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))))) (.cse35 (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)))) (.cse43 (mod c_~var_1_28~0 4294967296)) (.cse25 (not .cse7)) (.cse23 (< .cse10 .cse28)) (.cse8 (< 0 .cse47)) (.cse29 (< .cse20 .cse28)) (.cse38 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse47) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (.cse37 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse47) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (.cse16 (< 0 (+ c_~var_1_22~0 1))) (.cse3 (< .cse10 .cse30)) (.cse22 (< c_~var_1_22~0 0)) (.cse44 (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)))) (.cse46 (forall ((~var_1_6~0 Int)) (or (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (< ~var_1_6~0 0)))) (.cse36 (< .cse0 (+ .cse28 65537))) (.cse41 (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))))) (.cse4 (< 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)))) (or (< 32767 .cse1) (let ((.cse6 (forall ((~var_1_6~0 Int)) (let ((.cse33 (div c_~var_1_22~0 ~var_1_6~0))) (or (< 0 (+ ~var_1_6~0 1)) (< .cse0 .cse33) (< .cse10 .cse33))))) (.cse5 (forall ((~var_1_6~0 Int)) (let ((.cse32 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse32) (< .cse10 .cse32))))) (.cse24 (< .cse0 .cse28)) (.cse21 (forall ((~var_1_6~0 Int)) (let ((.cse31 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< .cse0 .cse31) (< .cse10 .cse31) (< ~var_1_6~0 0))))) (.cse2 (< .cse0 .cse30))) (and (or .cse2 .cse3 .cse4) (or (and .cse5 (or .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 (< c_~var_1_5~0 ~var_1_6~0) (< 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)))) (or .cse6 .cse4) (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 .cse16 (forall ((~var_1_6~0 Int)) (let ((.cse17 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse17) (< .cse10 .cse17) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (or .cse16 (forall ((~var_1_6~0 Int)) (let ((.cse19 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse18 .cse19) (< 0 (+ ~var_1_6~0 1)) (< .cse20 .cse19) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (or .cse21 .cse2 .cse3 .cse7) (or .cse5 .cse22) (or .cse23 .cse21 .cse8 .cse24) (or .cse6 .cse4 .cse25) (or .cse23 .cse25 .cse24) (or (forall ((~var_1_6~0 Int)) (let ((.cse26 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse26) (< .cse10 .cse26) (< ~var_1_6~0 0)))) .cse22) (or .cse8 .cse5) (or .cse16 (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) (< .cse0 .cse27) (< .cse10 .cse27) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (or .cse23 .cse22 .cse24) (or .cse21 .cse2 .cse3) (or .cse16 (< .cse18 .cse28) .cse8 .cse7 .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) 65537)))) (or .cse34 .cse4) (or .cse34 .cse4 .cse25) (or .cse16 (and .cse35 (or .cse36 .cse37) (or .cse36 .cse38) (or (forall ((~var_1_6~0 Int)) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537))) .cse36) (or .cse4 .cse36 .cse38))) (or .cse39 .cse22) (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 ((.cse40 (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 .cse34 (or .cse16 (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 .cse16 (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 .cse40 .cse22) .cse41 (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 .cse16 (forall ((~var_1_6~0 Int)) (or (< .cse18 (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 .cse40 .cse8) (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))))) (< .cse42 .cse43)) (or .cse39 .cse8) (or .cse16 .cse35) (or .cse25 (< .cse0 (+ 65536 .cse28))) (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 .cse44 .cse22) (or (< .cse43 (+ 1 .cse42)) (let ((.cse45 (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 (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)) (< ~var_1_6~0 0))) .cse22) (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))) (or .cse23 .cse25) (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 .cse23 .cse22) (or .cse8 .cse45) (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 .cse16 .cse8 .cse7 .cse29) (or .cse16 (and (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))) (or .cse3 .cse38) (or .cse3 .cse4 .cse38) (or .cse3 .cse37) (or .cse3 (forall ((~var_1_6~0 Int)) (or (< .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)))))) (or .cse16 (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)))) (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)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) .cse4) (or .cse3 (forall ((~var_1_6~0 Int)) (or (< .cse10 (+ (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)) (< .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) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))) (or .cse22 .cse45) (or .cse16 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse20 (div c_~var_1_22~0 ~var_1_6~0)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse3 .cse4)))) (or .cse46 .cse7 .cse36) (or .cse22 (and .cse44 (<= .cse0 (+ .cse28 65535)))) (or .cse46 .cse36) (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 .cse4 .cse36) (or .cse41 .cse4))))) is different from false [2024-10-14 12:25:05,136 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~var_1_28~0 65536)) (.cse42 (mod c_~var_1_8~0 256)) (.cse28 (div c_~var_1_22~0 c_~var_1_5~0))) (let ((.cse30 (+ .cse28 1)) (.cse20 (+ c_~var_1_22~0 1 .cse42)) (.cse47 (+ c_~var_1_5~0 1)) (.cse10 (+ c_~var_1_22~0 .cse42)) (.cse7 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse0 (+ .cse1 c_~var_1_22~0))) (let ((.cse34 (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))))) (.cse18 (+ .cse1 c_~var_1_22~0 1)) (.cse39 (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))))) (.cse35 (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)))) (.cse43 (mod c_~var_1_28~0 4294967296)) (.cse25 (not .cse7)) (.cse23 (< .cse10 .cse28)) (.cse8 (< 0 .cse47)) (.cse29 (< .cse20 .cse28)) (.cse38 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse47) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (.cse37 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse47) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (.cse16 (< 0 (+ c_~var_1_22~0 1))) (.cse3 (< .cse10 .cse30)) (.cse22 (< c_~var_1_22~0 0)) (.cse44 (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)))) (.cse46 (forall ((~var_1_6~0 Int)) (or (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (< ~var_1_6~0 0)))) (.cse36 (< .cse0 (+ .cse28 65537))) (.cse41 (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))))) (.cse4 (< 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)))) (or (< 32767 .cse1) (let ((.cse6 (forall ((~var_1_6~0 Int)) (let ((.cse33 (div c_~var_1_22~0 ~var_1_6~0))) (or (< 0 (+ ~var_1_6~0 1)) (< .cse0 .cse33) (< .cse10 .cse33))))) (.cse5 (forall ((~var_1_6~0 Int)) (let ((.cse32 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse32) (< .cse10 .cse32))))) (.cse24 (< .cse0 .cse28)) (.cse21 (forall ((~var_1_6~0 Int)) (let ((.cse31 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< .cse0 .cse31) (< .cse10 .cse31) (< ~var_1_6~0 0))))) (.cse2 (< .cse0 .cse30))) (and (or .cse2 .cse3 .cse4) (or (and .cse5 (or .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 (< c_~var_1_5~0 ~var_1_6~0) (< 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)))) (or .cse6 .cse4) (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 .cse16 (forall ((~var_1_6~0 Int)) (let ((.cse17 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse17) (< .cse10 .cse17) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (or .cse16 (forall ((~var_1_6~0 Int)) (let ((.cse19 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse18 .cse19) (< 0 (+ ~var_1_6~0 1)) (< .cse20 .cse19) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (or .cse21 .cse2 .cse3 .cse7) (or .cse5 .cse22) (or .cse23 .cse21 .cse8 .cse24) (or .cse6 .cse4 .cse25) (or .cse23 .cse25 .cse24) (or (forall ((~var_1_6~0 Int)) (let ((.cse26 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse26) (< .cse10 .cse26) (< ~var_1_6~0 0)))) .cse22) (or .cse8 .cse5) (or .cse16 (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) (< .cse0 .cse27) (< .cse10 .cse27) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (or .cse23 .cse22 .cse24) (or .cse21 .cse2 .cse3) (or .cse16 (< .cse18 .cse28) .cse8 .cse7 .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) 65537)))) (or .cse34 .cse4) (or .cse34 .cse4 .cse25) (or .cse16 (and .cse35 (or .cse36 .cse37) (or .cse36 .cse38) (or (forall ((~var_1_6~0 Int)) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537))) .cse36) (or .cse4 .cse36 .cse38))) (or .cse39 .cse22) (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 ((.cse40 (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 .cse34 (or .cse16 (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 .cse16 (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 .cse40 .cse22) .cse41 (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 .cse16 (forall ((~var_1_6~0 Int)) (or (< .cse18 (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 .cse40 .cse8) (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))))) (< .cse42 .cse43)) (or .cse39 .cse8) (or .cse16 .cse35) (or .cse25 (< .cse0 (+ 65536 .cse28))) (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 .cse44 .cse22) (or (< .cse43 (+ 1 .cse42)) (let ((.cse45 (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 (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)) (< ~var_1_6~0 0))) .cse22) (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))) (or .cse23 .cse25) (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 .cse23 .cse22) (or .cse8 .cse45) (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 .cse16 .cse8 .cse7 .cse29) (or .cse16 (and (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))) (or .cse3 .cse38) (or .cse3 .cse4 .cse38) (or .cse3 .cse37) (or .cse3 (forall ((~var_1_6~0 Int)) (or (< .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)))))) (or .cse16 (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)))) (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)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) .cse4) (or .cse3 (forall ((~var_1_6~0 Int)) (or (< .cse10 (+ (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)) (< .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) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))) (or .cse22 .cse45) (or .cse16 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse20 (div c_~var_1_22~0 ~var_1_6~0)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse3 .cse4)))) (or .cse46 .cse7 .cse36) (or .cse22 (and .cse44 (<= .cse0 (+ .cse28 65535)))) (or .cse46 .cse36) (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 .cse4 .cse36) (or .cse41 .cse4))))) is different from true [2024-10-14 12:25:16,648 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