./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/vnew2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/vnew2.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 6cb26fc448cefa547e2463448c16c0efba841bf620bbd2ba420ae15e288e3a3f --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 14:29:40,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:29:40,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:29:40,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:29:40,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:29:40,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:29:40,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:29:40,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:29:40,816 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:29:40,817 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:29:40,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:29:40,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:29:40,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:29:40,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:29:40,819 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:29:40,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:29:40,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:29:40,820 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:29:40,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:29:40,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:29:40,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:29:40,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:29:40,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:29:40,824 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:29:40,824 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:29:40,825 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:29:40,825 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:29:40,826 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:29:40,826 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:29:40,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:29:40,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:29:40,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:29:40,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:29:40,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:29:40,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:29:40,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:29:40,829 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:29:40,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:29:40,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:29:40,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:29:40,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:29:40,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:29:40,831 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer 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 -> 6cb26fc448cefa547e2463448c16c0efba841bf620bbd2ba420ae15e288e3a3f Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 14:29:41,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:29:41,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:29:41,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:29:41,135 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:29:41,136 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:29:41,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops-crafted-1/vnew2.c [2024-10-15 14:29:42,585 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:29:42,744 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:29:42,745 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/vnew2.c [2024-10-15 14:29:42,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/f50ba81dd/03a36910e1a84fdcb7d4c7b3a1617f96/FLAG5a352d1e7 [2024-10-15 14:29:43,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/f50ba81dd/03a36910e1a84fdcb7d4c7b3a1617f96 [2024-10-15 14:29:43,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:29:43,153 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:29:43,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:29:43,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:29:43,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:29:43,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:29:43" (1/1) ... [2024-10-15 14:29:43,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a4e792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:29:43, skipping insertion in model container [2024-10-15 14:29:43,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:29:43" (1/1) ... [2024-10-15 14:29:43,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:29:43,337 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/vnew2.c[403,416] [2024-10-15 14:29:43,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:29:43,363 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:29:43,375 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/vnew2.c[403,416] [2024-10-15 14:29:43,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:29:43,403 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:29:43,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:29:43 WrapperNode [2024-10-15 14:29:43,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:29:43,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:29:43,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:29:43,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:29:43,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:29:43" (1/1) ... [2024-10-15 14:29:43,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:29:43" (1/1) ... [2024-10-15 14:29:43,425 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:29:43,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:29:43,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:29:43,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:29:43,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:29:43,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:29:43" (1/1) ... [2024-10-15 14:29:43,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:29:43" (1/1) ... [2024-10-15 14:29:43,439 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:29:43" (1/1) ... [2024-10-15 14:29:43,458 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-15 14:29:43,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:29:43" (1/1) ... [2024-10-15 14:29:43,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:29:43" (1/1) ... [2024-10-15 14:29:43,465 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:29:43" (1/1) ... [2024-10-15 14:29:43,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:29:43" (1/1) ... [2024-10-15 14:29:43,472 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:29:43" (1/1) ... [2024-10-15 14:29:43,473 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:29:43" (1/1) ... [2024-10-15 14:29:43,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:29:43,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:29:43,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:29:43,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:29:43,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:29:43" (1/1) ... [2024-10-15 14:29:43,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:29:43,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:29:43,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-15 14:29:43,515 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-15 14:29:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:29:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:29:43,560 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:29:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:29:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-15 14:29:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:29:43,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:29:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:29:43,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:29:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 14:29:43,563 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 14:29:43,627 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:29:43,630 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:29:43,791 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-10-15 14:29:43,793 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:29:43,825 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:29:43,825 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-15 14:29:43,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:29:43 BoogieIcfgContainer [2024-10-15 14:29:43,826 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:29:43,829 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:29:43,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:29:43,833 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:29:43,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:29:43" (1/3) ... [2024-10-15 14:29:43,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@387dd76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:29:43, skipping insertion in model container [2024-10-15 14:29:43,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:29:43" (2/3) ... [2024-10-15 14:29:43,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@387dd76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:29:43, skipping insertion in model container [2024-10-15 14:29:43,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:29:43" (3/3) ... [2024-10-15 14:29:43,837 INFO L112 eAbstractionObserver]: Analyzing ICFG vnew2.c [2024-10-15 14:29:43,853 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:29:43,854 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 14:29:43,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:29:43,919 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=All, 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;@36d1326d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:29:43,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 14:29:43,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-15 14:29:43,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-15 14:29:43,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:29:43,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:29:43,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:29:43,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:29:43,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1596598777, now seen corresponding path program 1 times [2024-10-15 14:29:43,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:29:43,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564659536] [2024-10-15 14:29:43,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:29:43,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:29:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:29:44,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:29:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:29:44,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:29:44,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:29:44,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564659536] [2024-10-15 14:29:44,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564659536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:29:44,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:29:44,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:29:44,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416825871] [2024-10-15 14:29:44,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:29:44,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:29:44,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:29:44,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:29:44,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:29:44,470 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:29:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:29:44,618 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2024-10-15 14:29:44,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:29:44,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-15 14:29:44,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:29:44,625 INFO L225 Difference]: With dead ends: 38 [2024-10-15 14:29:44,625 INFO L226 Difference]: Without dead ends: 14 [2024-10-15 14:29:44,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:29:44,631 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:29:44,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 16 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:29:44,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-15 14:29:44,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-15 14:29:44,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:29:44,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-15 14:29:44,659 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2024-10-15 14:29:44,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:29:44,659 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-15 14:29:44,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:29:44,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:29:44,661 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-15 14:29:44,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-15 14:29:44,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:29:44,661 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:29:44,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:29:44,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:29:44,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:29:44,675 INFO L85 PathProgramCache]: Analyzing trace with hash -723821183, now seen corresponding path program 1 times [2024-10-15 14:29:44,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:29:44,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208166338] [2024-10-15 14:29:44,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:29:44,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:29:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:29:44,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1110494205] [2024-10-15 14:29:44,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:29:44,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:29:44,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:29:44,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:29:44,734 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 14:29:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:29:44,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-15 14:29:44,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:29:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:29:45,019 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:29:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:29:45,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:29:45,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208166338] [2024-10-15 14:29:45,457 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:29:45,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110494205] [2024-10-15 14:29:45,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110494205] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:29:45,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:29:45,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2024-10-15 14:29:45,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083330826] [2024-10-15 14:29:45,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:29:45,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-15 14:29:45,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:29:45,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-15 14:29:45,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-15 14:29:45,461 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 12 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-15 14:29:46,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:29:46,245 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2024-10-15 14:29:46,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-15 14:29:46,246 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 12 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2024-10-15 14:29:46,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:29:46,247 INFO L225 Difference]: With dead ends: 27 [2024-10-15 14:29:46,247 INFO L226 Difference]: Without dead ends: 17 [2024-10-15 14:29:46,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2024-10-15 14:29:46,250 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:29:46,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 34 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:29:46,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-15 14:29:46,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-15 14:29:46,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:29:46,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2024-10-15 14:29:46,259 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2024-10-15 14:29:46,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:29:46,260 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2024-10-15 14:29:46,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 12 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-15 14:29:46,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:29:46,261 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2024-10-15 14:29:46,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-15 14:29:46,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:29:46,261 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:29:46,278 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-15 14:29:46,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:29:46,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:29:46,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:29:46,463 INFO L85 PathProgramCache]: Analyzing trace with hash 968418439, now seen corresponding path program 2 times [2024-10-15 14:29:46,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:29:46,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721822461] [2024-10-15 14:29:46,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:29:46,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:29:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:29:46,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1125742735] [2024-10-15 14:29:46,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:29:46,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:29:46,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:29:46,538 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:29:46,539 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 14:29:46,603 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:29:46,603 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:29:46,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-15 14:29:46,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:29:46,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:29:46,848 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:29:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:29:47,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:29:47,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721822461] [2024-10-15 14:29:47,555 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:29:47,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125742735] [2024-10-15 14:29:47,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125742735] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:29:47,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:29:47,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-10-15 14:29:47,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468299052] [2024-10-15 14:29:47,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:29:47,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-15 14:29:47,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:29:47,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-15 14:29:47,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2024-10-15 14:29:47,557 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 17 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-15 14:29:57,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:30:19,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:30:19,531 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2024-10-15 14:30:19,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-15 14:30:19,532 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 17 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-10-15 14:30:19,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:30:19,533 INFO L225 Difference]: With dead ends: 37 [2024-10-15 14:30:19,533 INFO L226 Difference]: Without dead ends: 23 [2024-10-15 14:30:19,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=316, Invalid=872, Unknown=2, NotChecked=0, Total=1190 [2024-10-15 14:30:19,535 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 64 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-15 14:30:19,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 42 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-15 14:30:19,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-15 14:30:19,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-15 14:30:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:30:19,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-10-15 14:30:19,554 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 16 [2024-10-15 14:30:19,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:30:19,554 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-10-15 14:30:19,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 17 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-15 14:30:19,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:30:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-10-15 14:30:19,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-15 14:30:19,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:30:19,556 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:30:19,573 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-15 14:30:19,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:30:19,757 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:30:19,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:30:19,757 INFO L85 PathProgramCache]: Analyzing trace with hash 987652679, now seen corresponding path program 3 times [2024-10-15 14:30:19,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:30:19,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751225523] [2024-10-15 14:30:19,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:30:19,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:30:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:30:19,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [758036804] [2024-10-15 14:30:19,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 14:30:19,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:30:19,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:30:19,859 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:30:19,860 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 14:30:19,990 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-15 14:30:19,990 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:30:19,992 WARN L253 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-15 14:30:19,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:30:20,235 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:30:20,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:30:23,362 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:30:23,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:30:23,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751225523] [2024-10-15 14:30:23,362 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:30:23,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758036804] [2024-10-15 14:30:23,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758036804] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:30:23,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:30:23,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2024-10-15 14:30:23,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986736043] [2024-10-15 14:30:23,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:30:23,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-15 14:30:23,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:30:23,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-15 14:30:23,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2024-10-15 14:30:23,364 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 27 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-15 14:30:27,502 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (+ 15 c_main_~j~0) 4294967296)) (.cse6 (mod (+ c_main_~j~0 27) 4294967296)) (.cse9 (mod (+ 6 c_main_~j~0) 4294967296)) (.cse11 (mod (+ c_main_~i~0 3) 4294967296)) (.cse2 (mod (+ c_main_~i~0 18) 4294967296)) (.cse13 (mod (+ 21 c_main_~j~0) 4294967296)) (.cse16 (mod (+ c_main_~i~0 21) 4294967296)) (.cse14 (mod (+ 3 c_main_~j~0) 4294967296)) (.cse1 (mod (+ c_main_~j~0 24) 4294967296)) (.cse12 (mod (+ c_main_~i~0 24) 4294967296)) (.cse17 (mod (+ 9 c_main_~j~0) 4294967296)) (.cse18 (mod (+ c_main_~i~0 9) 4294967296)) (.cse19 (mod (+ c_main_~i~0 30) 4294967296)) (.cse8 (mod (+ 30 c_main_~j~0) 4294967296)) (.cse0 (mod (+ c_main_~j~0 12) 4294967296)) (.cse7 (mod (+ c_main_~i~0 27) 4294967296)) (.cse10 (mod (+ c_main_~i~0 6) 4294967296)) (.cse15 (mod (+ c_main_~j~0 18) 4294967296)) (.cse21 (mod (+ c_main_~i~0 12) 4294967296)) (.cse20 (mod c_main_~j~0 4294967296)) (.cse4 (mod (+ c_main_~i~0 15) 4294967296)) (.cse22 (mod c_main_~i~0 4294967296)) (.cse3 (mod (+ 2 c_~SIZE~0) 4294967296))) (and (= .cse0 (mod (+ 12 c_main_~k~0) 4294967296)) (= .cse1 (mod (+ c_main_~k~0 24) 4294967296)) (not (= (mod (mod .cse2 .cse3) 4294967296) 0)) (= .cse4 .cse5) (= .cse6 .cse7) (= .cse8 (mod (+ 30 c_main_~k~0) 4294967296)) (= .cse5 (mod (+ 15 c_main_~k~0) 4294967296)) (= (mod (+ 27 c_main_~k~0) 4294967296) .cse6) (= .cse9 .cse10) (not (= (mod (mod .cse11 .cse3) 4294967296) 0)) (not (= (mod (mod .cse12 .cse3) 4294967296) 0)) (= .cse13 (mod (+ 21 c_main_~k~0) 4294967296)) (= .cse9 (mod (+ 6 c_main_~k~0) 4294967296)) (= .cse14 .cse11) (= .cse2 .cse15) (not (= (mod (mod .cse16 .cse3) 4294967296) 0)) (= .cse17 (mod (+ 9 c_main_~k~0) 4294967296)) (= .cse13 .cse16) (= .cse14 (mod (+ 3 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse18 .cse3) 4294967296) 0)) (not (= (mod (mod .cse19 .cse3) 4294967296) 0)) (= .cse20 (mod c_main_~k~0 4294967296)) (= .cse1 .cse12) (= .cse17 .cse18) (= .cse19 .cse8) (= .cse0 .cse21) (= 20000001 c_~SIZE~0) (not (= (mod (mod .cse7 .cse3) 4294967296) 0)) (not (= (mod (mod .cse10 .cse3) 4294967296) 0)) (= .cse15 (mod (+ 18 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse21 .cse3) 4294967296) 0)) (= .cse20 .cse22) (not (= (mod (mod .cse4 .cse3) 4294967296) 0)) (not (= 0 (mod (mod .cse22 .cse3) 4294967296))))) is different from false [2024-10-15 14:30:43,501 WARN L286 SmtUtils]: Spent 14.23s on a formula simplification. DAG size of input: 136 DAG size of output: 82 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-15 14:31:20,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:31:20,149 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2024-10-15 14:31:20,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-15 14:31:20,150 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 27 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-10-15 14:31:20,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:31:20,151 INFO L225 Difference]: With dead ends: 63 [2024-10-15 14:31:20,151 INFO L226 Difference]: Without dead ends: 35 [2024-10-15 14:31:20,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 57.9s TimeCoverageRelationStatistics Valid=424, Invalid=1301, Unknown=1, NotChecked=80, Total=1806 [2024-10-15 14:31:20,153 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 98 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-15 14:31:20,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 98 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 292 Invalid, 0 Unknown, 47 Unchecked, 1.9s Time] [2024-10-15 14:31:20,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-15 14:31:20,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-15 14:31:20,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:20,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2024-10-15 14:31:20,171 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 22 [2024-10-15 14:31:20,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:31:20,171 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2024-10-15 14:31:20,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 27 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-15 14:31:20,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:20,172 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2024-10-15 14:31:20,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-15 14:31:20,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:31:20,175 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:31:20,189 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-15 14:31:20,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:31:20,376 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:31:20,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:20,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1911909831, now seen corresponding path program 4 times [2024-10-15 14:31:20,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:31:20,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437435514] [2024-10-15 14:31:20,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:20,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:31:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:31:20,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [705451833] [2024-10-15 14:31:20,528 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 14:31:20,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:31:20,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:31:20,530 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:31:20,531 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-15 14:31:20,683 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 14:31:20,683 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:31:20,687 WARN L253 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 146 conjuncts are in the unsatisfiable core [2024-10-15 14:31:20,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:31:21,419 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:31:21,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:31:24,419 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:31:24,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:31:24,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437435514] [2024-10-15 14:31:24,420 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:31:24,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705451833] [2024-10-15 14:31:24,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705451833] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:31:24,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:31:24,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 56 [2024-10-15 14:31:24,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170823572] [2024-10-15 14:31:24,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:31:24,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-10-15 14:31:24,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:31:24,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-10-15 14:31:24,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=789, Invalid=2291, Unknown=0, NotChecked=0, Total=3080 [2024-10-15 14:31:24,424 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 56 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-15 14:31:28,825 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (+ c_main_~i~0 30) 4294967296)) (.cse13 (mod (+ c_main_~i~0 27) 4294967296)) (.cse7 (mod (+ c_main_~i~0 63) 4294967296)) (.cse15 (mod (+ c_main_~i~0 51) 4294967296)) (.cse10 (mod (+ c_main_~i~0 3) 4294967296)) (.cse8 (mod (+ c_main_~i~0 60) 4294967296)) (.cse24 (mod (+ c_main_~i~0 42) 4294967296)) (.cse1 (mod (+ c_main_~i~0 39) 4294967296)) (.cse3 (mod (+ c_main_~i~0 36) 4294967296)) (.cse5 (mod (+ c_main_~i~0 33) 4294967296)) (.cse27 (mod (+ c_main_~i~0 6) 4294967296)) (.cse32 (mod (+ c_main_~i~0 21) 4294967296)) (.cse18 (mod (+ c_main_~i~0 24) 4294967296)) (.cse39 (mod c_main_~j~0 4294967296)) (.cse12 (mod c_main_~i~0 4294967296)) (.cse16 (mod (+ c_main_~i~0 48) 4294967296)) (.cse23 (mod (+ c_main_~i~0 45) 4294967296)) (.cse37 (mod (+ c_main_~i~0 12) 4294967296)) (.cse40 (mod (+ c_main_~i~0 9) 4294967296)) (.cse26 (mod (+ c_main_~i~0 54) 4294967296)) (.cse29 (mod (+ c_main_~i~0 57) 4294967296)) (.cse36 (mod (+ c_main_~i~0 15) 4294967296)) (.cse2 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse33 (mod (+ c_main_~i~0 18) 4294967296))) (and (or (let ((.cse0 (mod (+ 39 c_main_~j~0) 4294967296))) (and (= .cse0 .cse1) (not (= (mod (mod .cse1 .cse2) 4294967296) 0)) (= .cse0 (mod (+ 39 c_main_~k~0) 4294967296)))) (< .cse1 (+ .cse3 1))) (or (let ((.cse4 (mod (+ 33 c_main_~j~0) 4294967296))) (and (= .cse4 (mod (+ 33 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse5 .cse2) 4294967296) 0)) (= .cse4 .cse5))) (< .cse5 (+ .cse6 1))) (or (< .cse7 (+ .cse8 1)) (let ((.cse9 (mod (+ c_main_~j~0 63) 4294967296))) (and (= (mod (+ 63 c_main_~k~0) 4294967296) .cse9) (not (= (mod (mod .cse7 .cse2) 4294967296) 0)) (= .cse7 .cse9)))) (or (let ((.cse11 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse10 .cse2) 4294967296) 0)) (= .cse11 .cse10) (= .cse11 (mod (+ 3 c_main_~k~0) 4294967296)))) (< .cse10 (+ .cse12 1))) (or (< .cse6 (+ .cse13 1)) (let ((.cse14 (mod (+ 30 c_main_~j~0) 4294967296))) (and (= .cse14 (mod (+ 30 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse6 .cse2) 4294967296) 0)) (= .cse6 .cse14)))) (or (< .cse15 (+ .cse16 1)) (let ((.cse17 (mod (+ 51 c_main_~j~0) 4294967296))) (and (= .cse15 .cse17) (not (= (mod (mod .cse15 .cse2) 4294967296) 0)) (= (mod (+ 51 c_main_~k~0) 4294967296) .cse17)))) (or (< .cse13 (+ .cse18 1)) (let ((.cse19 (mod (+ c_main_~j~0 27) 4294967296))) (and (= .cse19 .cse13) (= (mod (+ 27 c_main_~k~0) 4294967296) .cse19) (not (= (mod (mod .cse13 .cse2) 4294967296) 0))))) (let ((.cse20 (mod (+ c_main_~i~0 66) 4294967296))) (or (let ((.cse21 (mod (+ 66 c_main_~j~0) 4294967296))) (and (= .cse20 .cse21) (= (mod (+ 66 c_main_~k~0) 4294967296) .cse21) (not (= (mod (mod .cse20 .cse2) 4294967296) 0)))) (< .cse20 (+ .cse7 1)))) (or (let ((.cse22 (mod (+ 45 c_main_~j~0) 4294967296))) (and (= (mod (+ 45 c_main_~k~0) 4294967296) .cse22) (not (= (mod (mod .cse23 .cse2) 4294967296) 0)) (= .cse23 .cse22))) (< .cse23 (+ .cse24 1))) (or (let ((.cse25 (mod (+ c_main_~j~0 54) 4294967296))) (and (= (mod (+ 54 c_main_~k~0) 4294967296) .cse25) (not (= (mod (mod .cse26 .cse2) 4294967296) 0)) (= .cse26 .cse25))) (< .cse26 (+ .cse15 1))) (or (< .cse27 (+ .cse10 1)) (let ((.cse28 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse28 .cse27) (= .cse28 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse27 .cse2) 4294967296) 0))))) (or (< .cse8 (+ .cse29 1)) (let ((.cse30 (mod (+ 60 c_main_~j~0) 4294967296))) (and (= .cse30 (mod (+ 60 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse8 .cse2) 4294967296) 0)) (= .cse30 .cse8)))) (or (let ((.cse31 (mod (+ 42 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse24 .cse2) 4294967296) 0)) (= (mod (+ 42 c_main_~k~0) 4294967296) .cse31) (= .cse24 .cse31))) (< .cse24 (+ .cse1 1))) (or (< .cse32 (+ .cse33 1)) (let ((.cse34 (mod (+ 21 c_main_~j~0) 4294967296))) (and (= .cse34 (mod (+ 21 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse32 .cse2) 4294967296) 0)) (= .cse34 .cse32)))) (or (let ((.cse35 (mod (+ c_main_~j~0 36) 4294967296))) (and (= .cse35 (mod (+ 36 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse3 .cse2) 4294967296) 0)) (= .cse3 .cse35))) (< .cse3 (+ .cse5 1))) (or (< .cse36 (+ .cse37 1)) (let ((.cse38 (mod (+ 15 c_main_~j~0) 4294967296))) (and (= .cse36 .cse38) (= .cse38 (mod (+ 15 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse36 .cse2) 4294967296) 0))))) (= .cse39 (mod c_main_~k~0 4294967296)) (= 20000001 c_~SIZE~0) (or (< .cse40 (+ .cse27 1)) (let ((.cse41 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse41 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse40 .cse2) 4294967296) 0)) (= .cse41 .cse40)))) (or (< .cse18 (+ 1 .cse32)) (let ((.cse42 (mod (+ c_main_~j~0 24) 4294967296))) (and (= .cse42 (mod (+ c_main_~k~0 24) 4294967296)) (not (= (mod (mod .cse18 .cse2) 4294967296) 0)) (= .cse42 .cse18)))) (= .cse39 .cse12) (not (= 0 (mod (mod .cse12 .cse2) 4294967296))) (or (let ((.cse43 (mod (+ 48 c_main_~j~0) 4294967296))) (and (= .cse16 .cse43) (not (= (mod (mod .cse16 .cse2) 4294967296) 0)) (= (mod (+ 48 c_main_~k~0) 4294967296) .cse43))) (< .cse16 (+ .cse23 1))) (or (let ((.cse44 (mod (+ c_main_~j~0 12) 4294967296))) (and (= .cse44 (mod (+ 12 c_main_~k~0) 4294967296)) (= .cse44 .cse37) (not (= (mod (mod .cse37 .cse2) 4294967296) 0)))) (< .cse37 (+ .cse40 1))) (or (< .cse29 (+ .cse26 1)) (let ((.cse45 (mod (+ 57 c_main_~j~0) 4294967296))) (and (= .cse29 .cse45) (not (= (mod (mod .cse29 .cse2) 4294967296) 0)) (= .cse45 (mod (+ 57 c_main_~k~0) 4294967296))))) (or (< .cse33 (+ .cse36 1)) (let ((.cse46 (mod (+ c_main_~j~0 18) 4294967296))) (and (not (= (mod (mod .cse33 .cse2) 4294967296) 0)) (= .cse33 .cse46) (= .cse46 (mod (+ 18 c_main_~k~0) 4294967296))))))) is different from false [2024-10-15 14:31:32,860 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (+ c_main_~i~0 30) 4294967296)) (.cse13 (mod (+ c_main_~i~0 27) 4294967296)) (.cse15 (mod (+ c_main_~i~0 51) 4294967296)) (.cse10 (mod (+ c_main_~i~0 3) 4294967296)) (.cse8 (mod (+ c_main_~i~0 60) 4294967296)) (.cse22 (mod (+ c_main_~i~0 42) 4294967296)) (.cse1 (mod (+ c_main_~i~0 39) 4294967296)) (.cse3 (mod (+ c_main_~i~0 36) 4294967296)) (.cse5 (mod (+ c_main_~i~0 33) 4294967296)) (.cse25 (mod (+ c_main_~i~0 6) 4294967296)) (.cse30 (mod (+ c_main_~i~0 21) 4294967296)) (.cse18 (mod (+ c_main_~i~0 24) 4294967296)) (.cse12 (mod c_main_~i~0 4294967296)) (.cse16 (mod (+ c_main_~i~0 48) 4294967296)) (.cse21 (mod (+ c_main_~i~0 45) 4294967296)) (.cse35 (mod (+ c_main_~i~0 12) 4294967296)) (.cse37 (mod (+ c_main_~i~0 9) 4294967296)) (.cse24 (mod (+ c_main_~i~0 54) 4294967296)) (.cse27 (mod (+ c_main_~i~0 57) 4294967296)) (.cse34 (mod (+ c_main_~i~0 15) 4294967296)) (.cse2 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse31 (mod (+ c_main_~i~0 18) 4294967296))) (and (or (let ((.cse0 (mod (+ 39 c_main_~j~0) 4294967296))) (and (= .cse0 .cse1) (not (= (mod (mod .cse1 .cse2) 4294967296) 0)) (= .cse0 (mod (+ 39 c_main_~k~0) 4294967296)))) (< .cse1 (+ .cse3 1))) (or (let ((.cse4 (mod (+ 33 c_main_~j~0) 4294967296))) (and (= .cse4 (mod (+ 33 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse5 .cse2) 4294967296) 0)) (= .cse4 .cse5))) (< .cse5 (+ .cse6 1))) (let ((.cse7 (mod (+ c_main_~i~0 63) 4294967296))) (or (< .cse7 (+ .cse8 1)) (let ((.cse9 (mod (+ c_main_~j~0 63) 4294967296))) (and (= (mod (+ 63 c_main_~k~0) 4294967296) .cse9) (not (= (mod (mod .cse7 .cse2) 4294967296) 0)) (= .cse7 .cse9))))) (or (let ((.cse11 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse10 .cse2) 4294967296) 0)) (= .cse11 .cse10) (= .cse11 (mod (+ 3 c_main_~k~0) 4294967296)))) (< .cse10 (+ .cse12 1))) (or (< .cse6 (+ .cse13 1)) (let ((.cse14 (mod (+ 30 c_main_~j~0) 4294967296))) (and (= .cse14 (mod (+ 30 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse6 .cse2) 4294967296) 0)) (= .cse6 .cse14)))) (or (< .cse15 (+ .cse16 1)) (let ((.cse17 (mod (+ 51 c_main_~j~0) 4294967296))) (and (= .cse15 .cse17) (not (= (mod (mod .cse15 .cse2) 4294967296) 0)) (= (mod (+ 51 c_main_~k~0) 4294967296) .cse17)))) (or (< .cse13 (+ .cse18 1)) (let ((.cse19 (mod (+ c_main_~j~0 27) 4294967296))) (and (= .cse19 .cse13) (= (mod (+ 27 c_main_~k~0) 4294967296) .cse19) (not (= (mod (mod .cse13 .cse2) 4294967296) 0))))) (or (let ((.cse20 (mod (+ 45 c_main_~j~0) 4294967296))) (and (= (mod (+ 45 c_main_~k~0) 4294967296) .cse20) (not (= (mod (mod .cse21 .cse2) 4294967296) 0)) (= .cse21 .cse20))) (< .cse21 (+ .cse22 1))) (or (let ((.cse23 (mod (+ c_main_~j~0 54) 4294967296))) (and (= (mod (+ 54 c_main_~k~0) 4294967296) .cse23) (not (= (mod (mod .cse24 .cse2) 4294967296) 0)) (= .cse24 .cse23))) (< .cse24 (+ .cse15 1))) (or (< .cse25 (+ .cse10 1)) (let ((.cse26 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse26 .cse25) (= .cse26 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse25 .cse2) 4294967296) 0))))) (or (< .cse8 (+ .cse27 1)) (let ((.cse28 (mod (+ 60 c_main_~j~0) 4294967296))) (and (= .cse28 (mod (+ 60 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse8 .cse2) 4294967296) 0)) (= .cse28 .cse8)))) (or (let ((.cse29 (mod (+ 42 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse22 .cse2) 4294967296) 0)) (= (mod (+ 42 c_main_~k~0) 4294967296) .cse29) (= .cse22 .cse29))) (< .cse22 (+ .cse1 1))) (or (< .cse30 (+ .cse31 1)) (let ((.cse32 (mod (+ 21 c_main_~j~0) 4294967296))) (and (= .cse32 (mod (+ 21 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse30 .cse2) 4294967296) 0)) (= .cse32 .cse30)))) (or (let ((.cse33 (mod (+ c_main_~j~0 36) 4294967296))) (and (= .cse33 (mod (+ 36 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse3 .cse2) 4294967296) 0)) (= .cse3 .cse33))) (< .cse3 (+ .cse5 1))) (or (< .cse34 (+ .cse35 1)) (let ((.cse36 (mod (+ 15 c_main_~j~0) 4294967296))) (and (= .cse34 .cse36) (= .cse36 (mod (+ 15 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse34 .cse2) 4294967296) 0))))) (or (< .cse37 (+ .cse25 1)) (let ((.cse38 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse38 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse37 .cse2) 4294967296) 0)) (= .cse38 .cse37)))) (or (< .cse18 (+ 1 .cse30)) (let ((.cse39 (mod (+ c_main_~j~0 24) 4294967296))) (and (= .cse39 (mod (+ c_main_~k~0 24) 4294967296)) (not (= (mod (mod .cse18 .cse2) 4294967296) 0)) (= .cse39 .cse18)))) (let ((.cse40 (mod c_main_~n~0 4294967296))) (or (< .cse12 .cse40) (let ((.cse41 (mod c_main_~j~0 4294967296))) (and (= .cse41 (mod c_main_~k~0 4294967296)) (= .cse41 .cse12) (not (= 0 (mod (mod .cse12 .cse2) 4294967296))))) (< .cse40 1))) (or (let ((.cse42 (mod (+ 48 c_main_~j~0) 4294967296))) (and (= .cse16 .cse42) (not (= (mod (mod .cse16 .cse2) 4294967296) 0)) (= (mod (+ 48 c_main_~k~0) 4294967296) .cse42))) (< .cse16 (+ .cse21 1))) (or (let ((.cse43 (mod (+ c_main_~j~0 12) 4294967296))) (and (= .cse43 (mod (+ 12 c_main_~k~0) 4294967296)) (= .cse43 .cse35) (not (= (mod (mod .cse35 .cse2) 4294967296) 0)))) (< .cse35 (+ .cse37 1))) (or (< .cse27 (+ .cse24 1)) (let ((.cse44 (mod (+ 57 c_main_~j~0) 4294967296))) (and (= .cse27 .cse44) (not (= (mod (mod .cse27 .cse2) 4294967296) 0)) (= .cse44 (mod (+ 57 c_main_~k~0) 4294967296))))) (or (< .cse31 (+ .cse34 1)) (let ((.cse45 (mod (+ c_main_~j~0 18) 4294967296))) (and (not (= (mod (mod .cse31 .cse2) 4294967296) 0)) (= .cse31 .cse45) (= .cse45 (mod (+ 18 c_main_~k~0) 4294967296))))))) is different from false [2024-10-15 14:31:38,096 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (+ c_main_~i~0 30) 4294967296)) (.cse10 (mod (+ c_main_~i~0 27) 4294967296)) (.cse12 (mod (+ c_main_~i~0 51) 4294967296)) (.cse7 (mod (+ c_main_~i~0 3) 4294967296)) (.cse19 (mod (+ c_main_~i~0 42) 4294967296)) (.cse1 (mod (+ c_main_~i~0 39) 4294967296)) (.cse3 (mod (+ c_main_~i~0 36) 4294967296)) (.cse5 (mod (+ c_main_~i~0 33) 4294967296)) (.cse22 (mod (+ c_main_~i~0 6) 4294967296)) (.cse28 (mod (+ c_main_~i~0 21) 4294967296)) (.cse15 (mod (+ c_main_~i~0 24) 4294967296)) (.cse9 (mod c_main_~i~0 4294967296)) (.cse13 (mod (+ c_main_~i~0 48) 4294967296)) (.cse18 (mod (+ c_main_~i~0 45) 4294967296)) (.cse33 (mod (+ c_main_~i~0 12) 4294967296)) (.cse35 (mod (+ c_main_~i~0 9) 4294967296)) (.cse21 (mod (+ c_main_~i~0 54) 4294967296)) (.cse25 (mod (+ c_main_~i~0 57) 4294967296)) (.cse32 (mod (+ c_main_~i~0 15) 4294967296)) (.cse2 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse29 (mod (+ c_main_~i~0 18) 4294967296))) (and (or (let ((.cse0 (mod (+ 39 c_main_~j~0) 4294967296))) (and (= .cse0 .cse1) (not (= (mod (mod .cse1 .cse2) 4294967296) 0)) (= .cse0 (mod (+ 39 c_main_~k~0) 4294967296)))) (< .cse1 (+ .cse3 1))) (or (let ((.cse4 (mod (+ 33 c_main_~j~0) 4294967296))) (and (= .cse4 (mod (+ 33 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse5 .cse2) 4294967296) 0)) (= .cse4 .cse5))) (< .cse5 (+ .cse6 1))) (or (let ((.cse8 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse7 .cse2) 4294967296) 0)) (= .cse8 .cse7) (= .cse8 (mod (+ 3 c_main_~k~0) 4294967296)))) (< .cse7 (+ .cse9 1))) (or (< .cse6 (+ .cse10 1)) (let ((.cse11 (mod (+ 30 c_main_~j~0) 4294967296))) (and (= .cse11 (mod (+ 30 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse6 .cse2) 4294967296) 0)) (= .cse6 .cse11)))) (or (< .cse12 (+ .cse13 1)) (let ((.cse14 (mod (+ 51 c_main_~j~0) 4294967296))) (and (= .cse12 .cse14) (not (= (mod (mod .cse12 .cse2) 4294967296) 0)) (= (mod (+ 51 c_main_~k~0) 4294967296) .cse14)))) (or (< .cse10 (+ .cse15 1)) (let ((.cse16 (mod (+ c_main_~j~0 27) 4294967296))) (and (= .cse16 .cse10) (= (mod (+ 27 c_main_~k~0) 4294967296) .cse16) (not (= (mod (mod .cse10 .cse2) 4294967296) 0))))) (or (let ((.cse17 (mod (+ 45 c_main_~j~0) 4294967296))) (and (= (mod (+ 45 c_main_~k~0) 4294967296) .cse17) (not (= (mod (mod .cse18 .cse2) 4294967296) 0)) (= .cse18 .cse17))) (< .cse18 (+ .cse19 1))) (or (let ((.cse20 (mod (+ c_main_~j~0 54) 4294967296))) (and (= (mod (+ 54 c_main_~k~0) 4294967296) .cse20) (not (= (mod (mod .cse21 .cse2) 4294967296) 0)) (= .cse21 .cse20))) (< .cse21 (+ .cse12 1))) (or (< .cse22 (+ .cse7 1)) (let ((.cse23 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse23 .cse22) (= .cse23 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse22 .cse2) 4294967296) 0))))) (let ((.cse24 (mod (+ c_main_~i~0 60) 4294967296))) (or (< .cse24 (+ .cse25 1)) (let ((.cse26 (mod (+ 60 c_main_~j~0) 4294967296))) (and (= .cse26 (mod (+ 60 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse24 .cse2) 4294967296) 0)) (= .cse26 .cse24))))) (or (let ((.cse27 (mod (+ 42 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse19 .cse2) 4294967296) 0)) (= (mod (+ 42 c_main_~k~0) 4294967296) .cse27) (= .cse19 .cse27))) (< .cse19 (+ .cse1 1))) (or (< .cse28 (+ .cse29 1)) (let ((.cse30 (mod (+ 21 c_main_~j~0) 4294967296))) (and (= .cse30 (mod (+ 21 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse28 .cse2) 4294967296) 0)) (= .cse30 .cse28)))) (or (let ((.cse31 (mod (+ c_main_~j~0 36) 4294967296))) (and (= .cse31 (mod (+ 36 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse3 .cse2) 4294967296) 0)) (= .cse3 .cse31))) (< .cse3 (+ .cse5 1))) (or (< .cse32 (+ .cse33 1)) (let ((.cse34 (mod (+ 15 c_main_~j~0) 4294967296))) (and (= .cse32 .cse34) (= .cse34 (mod (+ 15 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse32 .cse2) 4294967296) 0))))) (or (< .cse35 (+ .cse22 1)) (let ((.cse36 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse36 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse35 .cse2) 4294967296) 0)) (= .cse36 .cse35)))) (or (< .cse15 (+ 1 .cse28)) (let ((.cse37 (mod (+ c_main_~j~0 24) 4294967296))) (and (= .cse37 (mod (+ c_main_~k~0 24) 4294967296)) (not (= (mod (mod .cse15 .cse2) 4294967296) 0)) (= .cse37 .cse15)))) (let ((.cse38 (mod c_main_~n~0 4294967296))) (or (< .cse9 .cse38) (let ((.cse39 (mod c_main_~j~0 4294967296))) (and (= .cse39 (mod c_main_~k~0 4294967296)) (= .cse39 .cse9) (not (= 0 (mod (mod .cse9 .cse2) 4294967296))))) (< .cse38 1))) (or (let ((.cse40 (mod (+ 48 c_main_~j~0) 4294967296))) (and (= .cse13 .cse40) (not (= (mod (mod .cse13 .cse2) 4294967296) 0)) (= (mod (+ 48 c_main_~k~0) 4294967296) .cse40))) (< .cse13 (+ .cse18 1))) (or (let ((.cse41 (mod (+ c_main_~j~0 12) 4294967296))) (and (= .cse41 (mod (+ 12 c_main_~k~0) 4294967296)) (= .cse41 .cse33) (not (= (mod (mod .cse33 .cse2) 4294967296) 0)))) (< .cse33 (+ .cse35 1))) (or (< .cse25 (+ .cse21 1)) (let ((.cse42 (mod (+ 57 c_main_~j~0) 4294967296))) (and (= .cse25 .cse42) (not (= (mod (mod .cse25 .cse2) 4294967296) 0)) (= .cse42 (mod (+ 57 c_main_~k~0) 4294967296))))) (or (< .cse29 (+ .cse32 1)) (let ((.cse43 (mod (+ c_main_~j~0 18) 4294967296))) (and (not (= (mod (mod .cse29 .cse2) 4294967296) 0)) (= .cse29 .cse43) (= .cse43 (mod (+ 18 c_main_~k~0) 4294967296))))))) is different from false [2024-10-15 14:31:42,178 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (+ c_main_~i~0 30) 4294967296)) (.cse10 (mod (+ c_main_~i~0 27) 4294967296)) (.cse12 (mod (+ c_main_~i~0 51) 4294967296)) (.cse7 (mod (+ c_main_~i~0 3) 4294967296)) (.cse19 (mod (+ c_main_~i~0 42) 4294967296)) (.cse1 (mod (+ c_main_~i~0 39) 4294967296)) (.cse3 (mod (+ c_main_~i~0 36) 4294967296)) (.cse5 (mod (+ c_main_~i~0 33) 4294967296)) (.cse22 (mod (+ c_main_~i~0 6) 4294967296)) (.cse25 (mod (+ c_main_~i~0 21) 4294967296)) (.cse15 (mod (+ c_main_~i~0 24) 4294967296)) (.cse9 (mod c_main_~i~0 4294967296)) (.cse13 (mod (+ c_main_~i~0 48) 4294967296)) (.cse18 (mod (+ c_main_~i~0 45) 4294967296)) (.cse30 (mod (+ c_main_~i~0 12) 4294967296)) (.cse32 (mod (+ c_main_~i~0 9) 4294967296)) (.cse21 (mod (+ c_main_~i~0 54) 4294967296)) (.cse29 (mod (+ c_main_~i~0 15) 4294967296)) (.cse2 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse26 (mod (+ c_main_~i~0 18) 4294967296))) (and (or (let ((.cse0 (mod (+ 39 c_main_~j~0) 4294967296))) (and (= .cse0 .cse1) (not (= (mod (mod .cse1 .cse2) 4294967296) 0)) (= .cse0 (mod (+ 39 c_main_~k~0) 4294967296)))) (< .cse1 (+ .cse3 1))) (or (let ((.cse4 (mod (+ 33 c_main_~j~0) 4294967296))) (and (= .cse4 (mod (+ 33 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse5 .cse2) 4294967296) 0)) (= .cse4 .cse5))) (< .cse5 (+ .cse6 1))) (or (let ((.cse8 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse7 .cse2) 4294967296) 0)) (= .cse8 .cse7) (= .cse8 (mod (+ 3 c_main_~k~0) 4294967296)))) (< .cse7 (+ .cse9 1))) (or (< .cse6 (+ .cse10 1)) (let ((.cse11 (mod (+ 30 c_main_~j~0) 4294967296))) (and (= .cse11 (mod (+ 30 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse6 .cse2) 4294967296) 0)) (= .cse6 .cse11)))) (or (< .cse12 (+ .cse13 1)) (let ((.cse14 (mod (+ 51 c_main_~j~0) 4294967296))) (and (= .cse12 .cse14) (not (= (mod (mod .cse12 .cse2) 4294967296) 0)) (= (mod (+ 51 c_main_~k~0) 4294967296) .cse14)))) (or (< .cse10 (+ .cse15 1)) (let ((.cse16 (mod (+ c_main_~j~0 27) 4294967296))) (and (= .cse16 .cse10) (= (mod (+ 27 c_main_~k~0) 4294967296) .cse16) (not (= (mod (mod .cse10 .cse2) 4294967296) 0))))) (or (let ((.cse17 (mod (+ 45 c_main_~j~0) 4294967296))) (and (= (mod (+ 45 c_main_~k~0) 4294967296) .cse17) (not (= (mod (mod .cse18 .cse2) 4294967296) 0)) (= .cse18 .cse17))) (< .cse18 (+ .cse19 1))) (or (let ((.cse20 (mod (+ c_main_~j~0 54) 4294967296))) (and (= (mod (+ 54 c_main_~k~0) 4294967296) .cse20) (not (= (mod (mod .cse21 .cse2) 4294967296) 0)) (= .cse21 .cse20))) (< .cse21 (+ .cse12 1))) (or (< .cse22 (+ .cse7 1)) (let ((.cse23 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse23 .cse22) (= .cse23 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse22 .cse2) 4294967296) 0))))) (or (let ((.cse24 (mod (+ 42 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse19 .cse2) 4294967296) 0)) (= (mod (+ 42 c_main_~k~0) 4294967296) .cse24) (= .cse19 .cse24))) (< .cse19 (+ .cse1 1))) (or (< .cse25 (+ .cse26 1)) (let ((.cse27 (mod (+ 21 c_main_~j~0) 4294967296))) (and (= .cse27 (mod (+ 21 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse25 .cse2) 4294967296) 0)) (= .cse27 .cse25)))) (or (let ((.cse28 (mod (+ c_main_~j~0 36) 4294967296))) (and (= .cse28 (mod (+ 36 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse3 .cse2) 4294967296) 0)) (= .cse3 .cse28))) (< .cse3 (+ .cse5 1))) (or (< .cse29 (+ .cse30 1)) (let ((.cse31 (mod (+ 15 c_main_~j~0) 4294967296))) (and (= .cse29 .cse31) (= .cse31 (mod (+ 15 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse29 .cse2) 4294967296) 0))))) (or (< .cse32 (+ .cse22 1)) (let ((.cse33 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse33 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse32 .cse2) 4294967296) 0)) (= .cse33 .cse32)))) (or (< .cse15 (+ 1 .cse25)) (let ((.cse34 (mod (+ c_main_~j~0 24) 4294967296))) (and (= .cse34 (mod (+ c_main_~k~0 24) 4294967296)) (not (= (mod (mod .cse15 .cse2) 4294967296) 0)) (= .cse34 .cse15)))) (let ((.cse35 (mod c_main_~n~0 4294967296))) (or (< .cse9 .cse35) (let ((.cse36 (mod c_main_~j~0 4294967296))) (and (= .cse36 (mod c_main_~k~0 4294967296)) (= .cse36 .cse9) (not (= 0 (mod (mod .cse9 .cse2) 4294967296))))) (< .cse35 1))) (or (let ((.cse37 (mod (+ 48 c_main_~j~0) 4294967296))) (and (= .cse13 .cse37) (not (= (mod (mod .cse13 .cse2) 4294967296) 0)) (= (mod (+ 48 c_main_~k~0) 4294967296) .cse37))) (< .cse13 (+ .cse18 1))) (or (let ((.cse38 (mod (+ c_main_~j~0 12) 4294967296))) (and (= .cse38 (mod (+ 12 c_main_~k~0) 4294967296)) (= .cse38 .cse30) (not (= (mod (mod .cse30 .cse2) 4294967296) 0)))) (< .cse30 (+ .cse32 1))) (let ((.cse39 (mod (+ c_main_~i~0 57) 4294967296))) (or (< .cse39 (+ .cse21 1)) (let ((.cse40 (mod (+ 57 c_main_~j~0) 4294967296))) (and (= .cse39 .cse40) (not (= (mod (mod .cse39 .cse2) 4294967296) 0)) (= .cse40 (mod (+ 57 c_main_~k~0) 4294967296)))))) (or (< .cse26 (+ .cse29 1)) (let ((.cse41 (mod (+ c_main_~j~0 18) 4294967296))) (and (not (= (mod (mod .cse26 .cse2) 4294967296) 0)) (= .cse26 .cse41) (= .cse41 (mod (+ 18 c_main_~k~0) 4294967296))))))) is different from false [2024-10-15 14:31:46,226 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (+ c_main_~i~0 30) 4294967296)) (.cse10 (mod (+ c_main_~i~0 27) 4294967296)) (.cse12 (mod (+ c_main_~i~0 51) 4294967296)) (.cse7 (mod (+ c_main_~i~0 3) 4294967296)) (.cse19 (mod (+ c_main_~i~0 42) 4294967296)) (.cse1 (mod (+ c_main_~i~0 39) 4294967296)) (.cse3 (mod (+ c_main_~i~0 36) 4294967296)) (.cse5 (mod (+ c_main_~i~0 33) 4294967296)) (.cse22 (mod (+ c_main_~i~0 6) 4294967296)) (.cse25 (mod (+ c_main_~i~0 21) 4294967296)) (.cse15 (mod (+ c_main_~i~0 24) 4294967296)) (.cse9 (mod c_main_~i~0 4294967296)) (.cse13 (mod (+ c_main_~i~0 48) 4294967296)) (.cse18 (mod (+ c_main_~i~0 45) 4294967296)) (.cse30 (mod (+ c_main_~i~0 12) 4294967296)) (.cse32 (mod (+ c_main_~i~0 9) 4294967296)) (.cse29 (mod (+ c_main_~i~0 15) 4294967296)) (.cse2 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse26 (mod (+ c_main_~i~0 18) 4294967296))) (and (or (let ((.cse0 (mod (+ 39 c_main_~j~0) 4294967296))) (and (= .cse0 .cse1) (not (= (mod (mod .cse1 .cse2) 4294967296) 0)) (= .cse0 (mod (+ 39 c_main_~k~0) 4294967296)))) (< .cse1 (+ .cse3 1))) (or (let ((.cse4 (mod (+ 33 c_main_~j~0) 4294967296))) (and (= .cse4 (mod (+ 33 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse5 .cse2) 4294967296) 0)) (= .cse4 .cse5))) (< .cse5 (+ .cse6 1))) (or (let ((.cse8 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse7 .cse2) 4294967296) 0)) (= .cse8 .cse7) (= .cse8 (mod (+ 3 c_main_~k~0) 4294967296)))) (< .cse7 (+ .cse9 1))) (or (< .cse6 (+ .cse10 1)) (let ((.cse11 (mod (+ 30 c_main_~j~0) 4294967296))) (and (= .cse11 (mod (+ 30 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse6 .cse2) 4294967296) 0)) (= .cse6 .cse11)))) (or (< .cse12 (+ .cse13 1)) (let ((.cse14 (mod (+ 51 c_main_~j~0) 4294967296))) (and (= .cse12 .cse14) (not (= (mod (mod .cse12 .cse2) 4294967296) 0)) (= (mod (+ 51 c_main_~k~0) 4294967296) .cse14)))) (or (< .cse10 (+ .cse15 1)) (let ((.cse16 (mod (+ c_main_~j~0 27) 4294967296))) (and (= .cse16 .cse10) (= (mod (+ 27 c_main_~k~0) 4294967296) .cse16) (not (= (mod (mod .cse10 .cse2) 4294967296) 0))))) (or (let ((.cse17 (mod (+ 45 c_main_~j~0) 4294967296))) (and (= (mod (+ 45 c_main_~k~0) 4294967296) .cse17) (not (= (mod (mod .cse18 .cse2) 4294967296) 0)) (= .cse18 .cse17))) (< .cse18 (+ .cse19 1))) (let ((.cse21 (mod (+ c_main_~i~0 54) 4294967296))) (or (let ((.cse20 (mod (+ c_main_~j~0 54) 4294967296))) (and (= (mod (+ 54 c_main_~k~0) 4294967296) .cse20) (not (= (mod (mod .cse21 .cse2) 4294967296) 0)) (= .cse21 .cse20))) (< .cse21 (+ .cse12 1)))) (or (< .cse22 (+ .cse7 1)) (let ((.cse23 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse23 .cse22) (= .cse23 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse22 .cse2) 4294967296) 0))))) (or (let ((.cse24 (mod (+ 42 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse19 .cse2) 4294967296) 0)) (= (mod (+ 42 c_main_~k~0) 4294967296) .cse24) (= .cse19 .cse24))) (< .cse19 (+ .cse1 1))) (or (< .cse25 (+ .cse26 1)) (let ((.cse27 (mod (+ 21 c_main_~j~0) 4294967296))) (and (= .cse27 (mod (+ 21 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse25 .cse2) 4294967296) 0)) (= .cse27 .cse25)))) (or (let ((.cse28 (mod (+ c_main_~j~0 36) 4294967296))) (and (= .cse28 (mod (+ 36 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse3 .cse2) 4294967296) 0)) (= .cse3 .cse28))) (< .cse3 (+ .cse5 1))) (or (< .cse29 (+ .cse30 1)) (let ((.cse31 (mod (+ 15 c_main_~j~0) 4294967296))) (and (= .cse29 .cse31) (= .cse31 (mod (+ 15 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse29 .cse2) 4294967296) 0))))) (or (< .cse32 (+ .cse22 1)) (let ((.cse33 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse33 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse32 .cse2) 4294967296) 0)) (= .cse33 .cse32)))) (or (< .cse15 (+ 1 .cse25)) (let ((.cse34 (mod (+ c_main_~j~0 24) 4294967296))) (and (= .cse34 (mod (+ c_main_~k~0 24) 4294967296)) (not (= (mod (mod .cse15 .cse2) 4294967296) 0)) (= .cse34 .cse15)))) (let ((.cse35 (mod c_main_~n~0 4294967296))) (or (< .cse9 .cse35) (let ((.cse36 (mod c_main_~j~0 4294967296))) (and (= .cse36 (mod c_main_~k~0 4294967296)) (= .cse36 .cse9) (not (= 0 (mod (mod .cse9 .cse2) 4294967296))))) (< .cse35 1))) (or (let ((.cse37 (mod (+ 48 c_main_~j~0) 4294967296))) (and (= .cse13 .cse37) (not (= (mod (mod .cse13 .cse2) 4294967296) 0)) (= (mod (+ 48 c_main_~k~0) 4294967296) .cse37))) (< .cse13 (+ .cse18 1))) (or (let ((.cse38 (mod (+ c_main_~j~0 12) 4294967296))) (and (= .cse38 (mod (+ 12 c_main_~k~0) 4294967296)) (= .cse38 .cse30) (not (= (mod (mod .cse30 .cse2) 4294967296) 0)))) (< .cse30 (+ .cse32 1))) (or (< .cse26 (+ .cse29 1)) (let ((.cse39 (mod (+ c_main_~j~0 18) 4294967296))) (and (not (= (mod (mod .cse26 .cse2) 4294967296) 0)) (= .cse26 .cse39) (= .cse39 (mod (+ 18 c_main_~k~0) 4294967296))))))) is different from false [2024-10-15 14:31:50,249 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (+ c_main_~i~0 30) 4294967296)) (.cse10 (mod (+ c_main_~i~0 27) 4294967296)) (.cse7 (mod (+ c_main_~i~0 3) 4294967296)) (.cse19 (mod (+ c_main_~i~0 42) 4294967296)) (.cse1 (mod (+ c_main_~i~0 39) 4294967296)) (.cse3 (mod (+ c_main_~i~0 36) 4294967296)) (.cse5 (mod (+ c_main_~i~0 33) 4294967296)) (.cse20 (mod (+ c_main_~i~0 6) 4294967296)) (.cse23 (mod (+ c_main_~i~0 21) 4294967296)) (.cse15 (mod (+ c_main_~i~0 24) 4294967296)) (.cse9 (mod c_main_~i~0 4294967296)) (.cse13 (mod (+ c_main_~i~0 48) 4294967296)) (.cse18 (mod (+ c_main_~i~0 45) 4294967296)) (.cse28 (mod (+ c_main_~i~0 12) 4294967296)) (.cse30 (mod (+ c_main_~i~0 9) 4294967296)) (.cse27 (mod (+ c_main_~i~0 15) 4294967296)) (.cse2 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse24 (mod (+ c_main_~i~0 18) 4294967296))) (and (or (let ((.cse0 (mod (+ 39 c_main_~j~0) 4294967296))) (and (= .cse0 .cse1) (not (= (mod (mod .cse1 .cse2) 4294967296) 0)) (= .cse0 (mod (+ 39 c_main_~k~0) 4294967296)))) (< .cse1 (+ .cse3 1))) (or (let ((.cse4 (mod (+ 33 c_main_~j~0) 4294967296))) (and (= .cse4 (mod (+ 33 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse5 .cse2) 4294967296) 0)) (= .cse4 .cse5))) (< .cse5 (+ .cse6 1))) (or (let ((.cse8 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse7 .cse2) 4294967296) 0)) (= .cse8 .cse7) (= .cse8 (mod (+ 3 c_main_~k~0) 4294967296)))) (< .cse7 (+ .cse9 1))) (or (< .cse6 (+ .cse10 1)) (let ((.cse11 (mod (+ 30 c_main_~j~0) 4294967296))) (and (= .cse11 (mod (+ 30 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse6 .cse2) 4294967296) 0)) (= .cse6 .cse11)))) (let ((.cse12 (mod (+ c_main_~i~0 51) 4294967296))) (or (< .cse12 (+ .cse13 1)) (let ((.cse14 (mod (+ 51 c_main_~j~0) 4294967296))) (and (= .cse12 .cse14) (not (= (mod (mod .cse12 .cse2) 4294967296) 0)) (= (mod (+ 51 c_main_~k~0) 4294967296) .cse14))))) (or (< .cse10 (+ .cse15 1)) (let ((.cse16 (mod (+ c_main_~j~0 27) 4294967296))) (and (= .cse16 .cse10) (= (mod (+ 27 c_main_~k~0) 4294967296) .cse16) (not (= (mod (mod .cse10 .cse2) 4294967296) 0))))) (or (let ((.cse17 (mod (+ 45 c_main_~j~0) 4294967296))) (and (= (mod (+ 45 c_main_~k~0) 4294967296) .cse17) (not (= (mod (mod .cse18 .cse2) 4294967296) 0)) (= .cse18 .cse17))) (< .cse18 (+ .cse19 1))) (or (< .cse20 (+ .cse7 1)) (let ((.cse21 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse21 .cse20) (= .cse21 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse20 .cse2) 4294967296) 0))))) (or (let ((.cse22 (mod (+ 42 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse19 .cse2) 4294967296) 0)) (= (mod (+ 42 c_main_~k~0) 4294967296) .cse22) (= .cse19 .cse22))) (< .cse19 (+ .cse1 1))) (or (< .cse23 (+ .cse24 1)) (let ((.cse25 (mod (+ 21 c_main_~j~0) 4294967296))) (and (= .cse25 (mod (+ 21 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse23 .cse2) 4294967296) 0)) (= .cse25 .cse23)))) (or (let ((.cse26 (mod (+ c_main_~j~0 36) 4294967296))) (and (= .cse26 (mod (+ 36 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse3 .cse2) 4294967296) 0)) (= .cse3 .cse26))) (< .cse3 (+ .cse5 1))) (or (< .cse27 (+ .cse28 1)) (let ((.cse29 (mod (+ 15 c_main_~j~0) 4294967296))) (and (= .cse27 .cse29) (= .cse29 (mod (+ 15 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse27 .cse2) 4294967296) 0))))) (or (< .cse30 (+ .cse20 1)) (let ((.cse31 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse31 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse30 .cse2) 4294967296) 0)) (= .cse31 .cse30)))) (or (< .cse15 (+ 1 .cse23)) (let ((.cse32 (mod (+ c_main_~j~0 24) 4294967296))) (and (= .cse32 (mod (+ c_main_~k~0 24) 4294967296)) (not (= (mod (mod .cse15 .cse2) 4294967296) 0)) (= .cse32 .cse15)))) (let ((.cse33 (mod c_main_~n~0 4294967296))) (or (< .cse9 .cse33) (let ((.cse34 (mod c_main_~j~0 4294967296))) (and (= .cse34 (mod c_main_~k~0 4294967296)) (= .cse34 .cse9) (not (= 0 (mod (mod .cse9 .cse2) 4294967296))))) (< .cse33 1))) (or (let ((.cse35 (mod (+ 48 c_main_~j~0) 4294967296))) (and (= .cse13 .cse35) (not (= (mod (mod .cse13 .cse2) 4294967296) 0)) (= (mod (+ 48 c_main_~k~0) 4294967296) .cse35))) (< .cse13 (+ .cse18 1))) (or (let ((.cse36 (mod (+ c_main_~j~0 12) 4294967296))) (and (= .cse36 (mod (+ 12 c_main_~k~0) 4294967296)) (= .cse36 .cse28) (not (= (mod (mod .cse28 .cse2) 4294967296) 0)))) (< .cse28 (+ .cse30 1))) (or (< .cse24 (+ .cse27 1)) (let ((.cse37 (mod (+ c_main_~j~0 18) 4294967296))) (and (not (= (mod (mod .cse24 .cse2) 4294967296) 0)) (= .cse24 .cse37) (= .cse37 (mod (+ 18 c_main_~k~0) 4294967296))))))) is different from false [2024-10-15 14:31:54,269 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (+ c_main_~i~0 30) 4294967296)) (.cse10 (mod (+ c_main_~i~0 27) 4294967296)) (.cse7 (mod (+ c_main_~i~0 3) 4294967296)) (.cse16 (mod (+ c_main_~i~0 42) 4294967296)) (.cse1 (mod (+ c_main_~i~0 39) 4294967296)) (.cse3 (mod (+ c_main_~i~0 36) 4294967296)) (.cse5 (mod (+ c_main_~i~0 33) 4294967296)) (.cse17 (mod (+ c_main_~i~0 6) 4294967296)) (.cse20 (mod (+ c_main_~i~0 21) 4294967296)) (.cse12 (mod (+ c_main_~i~0 24) 4294967296)) (.cse9 (mod c_main_~i~0 4294967296)) (.cse15 (mod (+ c_main_~i~0 45) 4294967296)) (.cse25 (mod (+ c_main_~i~0 12) 4294967296)) (.cse27 (mod (+ c_main_~i~0 9) 4294967296)) (.cse24 (mod (+ c_main_~i~0 15) 4294967296)) (.cse2 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse21 (mod (+ c_main_~i~0 18) 4294967296))) (and (or (let ((.cse0 (mod (+ 39 c_main_~j~0) 4294967296))) (and (= .cse0 .cse1) (not (= (mod (mod .cse1 .cse2) 4294967296) 0)) (= .cse0 (mod (+ 39 c_main_~k~0) 4294967296)))) (< .cse1 (+ .cse3 1))) (or (let ((.cse4 (mod (+ 33 c_main_~j~0) 4294967296))) (and (= .cse4 (mod (+ 33 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse5 .cse2) 4294967296) 0)) (= .cse4 .cse5))) (< .cse5 (+ .cse6 1))) (or (let ((.cse8 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse7 .cse2) 4294967296) 0)) (= .cse8 .cse7) (= .cse8 (mod (+ 3 c_main_~k~0) 4294967296)))) (< .cse7 (+ .cse9 1))) (or (< .cse6 (+ .cse10 1)) (let ((.cse11 (mod (+ 30 c_main_~j~0) 4294967296))) (and (= .cse11 (mod (+ 30 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse6 .cse2) 4294967296) 0)) (= .cse6 .cse11)))) (or (< .cse10 (+ .cse12 1)) (let ((.cse13 (mod (+ c_main_~j~0 27) 4294967296))) (and (= .cse13 .cse10) (= (mod (+ 27 c_main_~k~0) 4294967296) .cse13) (not (= (mod (mod .cse10 .cse2) 4294967296) 0))))) (or (let ((.cse14 (mod (+ 45 c_main_~j~0) 4294967296))) (and (= (mod (+ 45 c_main_~k~0) 4294967296) .cse14) (not (= (mod (mod .cse15 .cse2) 4294967296) 0)) (= .cse15 .cse14))) (< .cse15 (+ .cse16 1))) (or (< .cse17 (+ .cse7 1)) (let ((.cse18 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse18 .cse17) (= .cse18 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse17 .cse2) 4294967296) 0))))) (or (let ((.cse19 (mod (+ 42 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse16 .cse2) 4294967296) 0)) (= (mod (+ 42 c_main_~k~0) 4294967296) .cse19) (= .cse16 .cse19))) (< .cse16 (+ .cse1 1))) (or (< .cse20 (+ .cse21 1)) (let ((.cse22 (mod (+ 21 c_main_~j~0) 4294967296))) (and (= .cse22 (mod (+ 21 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse20 .cse2) 4294967296) 0)) (= .cse22 .cse20)))) (or (let ((.cse23 (mod (+ c_main_~j~0 36) 4294967296))) (and (= .cse23 (mod (+ 36 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse3 .cse2) 4294967296) 0)) (= .cse3 .cse23))) (< .cse3 (+ .cse5 1))) (or (< .cse24 (+ .cse25 1)) (let ((.cse26 (mod (+ 15 c_main_~j~0) 4294967296))) (and (= .cse24 .cse26) (= .cse26 (mod (+ 15 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse24 .cse2) 4294967296) 0))))) (or (< .cse27 (+ .cse17 1)) (let ((.cse28 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse28 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse27 .cse2) 4294967296) 0)) (= .cse28 .cse27)))) (or (< .cse12 (+ 1 .cse20)) (let ((.cse29 (mod (+ c_main_~j~0 24) 4294967296))) (and (= .cse29 (mod (+ c_main_~k~0 24) 4294967296)) (not (= (mod (mod .cse12 .cse2) 4294967296) 0)) (= .cse29 .cse12)))) (let ((.cse30 (mod c_main_~n~0 4294967296))) (or (< .cse9 .cse30) (let ((.cse31 (mod c_main_~j~0 4294967296))) (and (= .cse31 (mod c_main_~k~0 4294967296)) (= .cse31 .cse9) (not (= 0 (mod (mod .cse9 .cse2) 4294967296))))) (< .cse30 1))) (let ((.cse32 (mod (+ c_main_~i~0 48) 4294967296))) (or (let ((.cse33 (mod (+ 48 c_main_~j~0) 4294967296))) (and (= .cse32 .cse33) (not (= (mod (mod .cse32 .cse2) 4294967296) 0)) (= (mod (+ 48 c_main_~k~0) 4294967296) .cse33))) (< .cse32 (+ .cse15 1)))) (or (let ((.cse34 (mod (+ c_main_~j~0 12) 4294967296))) (and (= .cse34 (mod (+ 12 c_main_~k~0) 4294967296)) (= .cse34 .cse25) (not (= (mod (mod .cse25 .cse2) 4294967296) 0)))) (< .cse25 (+ .cse27 1))) (or (< .cse21 (+ .cse24 1)) (let ((.cse35 (mod (+ c_main_~j~0 18) 4294967296))) (and (not (= (mod (mod .cse21 .cse2) 4294967296) 0)) (= .cse21 .cse35) (= .cse35 (mod (+ 18 c_main_~k~0) 4294967296))))))) is different from false [2024-10-15 14:31:58,288 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (+ c_main_~i~0 30) 4294967296)) (.cse10 (mod (+ c_main_~i~0 27) 4294967296)) (.cse7 (mod (+ c_main_~i~0 3) 4294967296)) (.cse16 (mod (+ c_main_~i~0 42) 4294967296)) (.cse1 (mod (+ c_main_~i~0 39) 4294967296)) (.cse3 (mod (+ c_main_~i~0 36) 4294967296)) (.cse5 (mod (+ c_main_~i~0 33) 4294967296)) (.cse17 (mod (+ c_main_~i~0 6) 4294967296)) (.cse20 (mod (+ c_main_~i~0 21) 4294967296)) (.cse12 (mod (+ c_main_~i~0 24) 4294967296)) (.cse9 (mod c_main_~i~0 4294967296)) (.cse25 (mod (+ c_main_~i~0 12) 4294967296)) (.cse27 (mod (+ c_main_~i~0 9) 4294967296)) (.cse24 (mod (+ c_main_~i~0 15) 4294967296)) (.cse2 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse21 (mod (+ c_main_~i~0 18) 4294967296))) (and (or (let ((.cse0 (mod (+ 39 c_main_~j~0) 4294967296))) (and (= .cse0 .cse1) (not (= (mod (mod .cse1 .cse2) 4294967296) 0)) (= .cse0 (mod (+ 39 c_main_~k~0) 4294967296)))) (< .cse1 (+ .cse3 1))) (or (let ((.cse4 (mod (+ 33 c_main_~j~0) 4294967296))) (and (= .cse4 (mod (+ 33 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse5 .cse2) 4294967296) 0)) (= .cse4 .cse5))) (< .cse5 (+ .cse6 1))) (or (let ((.cse8 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse7 .cse2) 4294967296) 0)) (= .cse8 .cse7) (= .cse8 (mod (+ 3 c_main_~k~0) 4294967296)))) (< .cse7 (+ .cse9 1))) (or (< .cse6 (+ .cse10 1)) (let ((.cse11 (mod (+ 30 c_main_~j~0) 4294967296))) (and (= .cse11 (mod (+ 30 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse6 .cse2) 4294967296) 0)) (= .cse6 .cse11)))) (or (< .cse10 (+ .cse12 1)) (let ((.cse13 (mod (+ c_main_~j~0 27) 4294967296))) (and (= .cse13 .cse10) (= (mod (+ 27 c_main_~k~0) 4294967296) .cse13) (not (= (mod (mod .cse10 .cse2) 4294967296) 0))))) (let ((.cse15 (mod (+ c_main_~i~0 45) 4294967296))) (or (let ((.cse14 (mod (+ 45 c_main_~j~0) 4294967296))) (and (= (mod (+ 45 c_main_~k~0) 4294967296) .cse14) (not (= (mod (mod .cse15 .cse2) 4294967296) 0)) (= .cse15 .cse14))) (< .cse15 (+ .cse16 1)))) (or (< .cse17 (+ .cse7 1)) (let ((.cse18 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse18 .cse17) (= .cse18 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse17 .cse2) 4294967296) 0))))) (or (let ((.cse19 (mod (+ 42 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse16 .cse2) 4294967296) 0)) (= (mod (+ 42 c_main_~k~0) 4294967296) .cse19) (= .cse16 .cse19))) (< .cse16 (+ .cse1 1))) (or (< .cse20 (+ .cse21 1)) (let ((.cse22 (mod (+ 21 c_main_~j~0) 4294967296))) (and (= .cse22 (mod (+ 21 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse20 .cse2) 4294967296) 0)) (= .cse22 .cse20)))) (or (let ((.cse23 (mod (+ c_main_~j~0 36) 4294967296))) (and (= .cse23 (mod (+ 36 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse3 .cse2) 4294967296) 0)) (= .cse3 .cse23))) (< .cse3 (+ .cse5 1))) (or (< .cse24 (+ .cse25 1)) (let ((.cse26 (mod (+ 15 c_main_~j~0) 4294967296))) (and (= .cse24 .cse26) (= .cse26 (mod (+ 15 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse24 .cse2) 4294967296) 0))))) (or (< .cse27 (+ .cse17 1)) (let ((.cse28 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse28 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse27 .cse2) 4294967296) 0)) (= .cse28 .cse27)))) (or (< .cse12 (+ 1 .cse20)) (let ((.cse29 (mod (+ c_main_~j~0 24) 4294967296))) (and (= .cse29 (mod (+ c_main_~k~0 24) 4294967296)) (not (= (mod (mod .cse12 .cse2) 4294967296) 0)) (= .cse29 .cse12)))) (let ((.cse30 (mod c_main_~n~0 4294967296))) (or (< .cse9 .cse30) (let ((.cse31 (mod c_main_~j~0 4294967296))) (and (= .cse31 (mod c_main_~k~0 4294967296)) (= .cse31 .cse9) (not (= 0 (mod (mod .cse9 .cse2) 4294967296))))) (< .cse30 1))) (or (let ((.cse32 (mod (+ c_main_~j~0 12) 4294967296))) (and (= .cse32 (mod (+ 12 c_main_~k~0) 4294967296)) (= .cse32 .cse25) (not (= (mod (mod .cse25 .cse2) 4294967296) 0)))) (< .cse25 (+ .cse27 1))) (or (< .cse21 (+ .cse24 1)) (let ((.cse33 (mod (+ c_main_~j~0 18) 4294967296))) (and (not (= (mod (mod .cse21 .cse2) 4294967296) 0)) (= .cse21 .cse33) (= .cse33 (mod (+ 18 c_main_~k~0) 4294967296))))))) is different from false [2024-10-15 14:32:02,307 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (+ c_main_~i~0 30) 4294967296)) (.cse10 (mod (+ c_main_~i~0 27) 4294967296)) (.cse7 (mod (+ c_main_~i~0 3) 4294967296)) (.cse1 (mod (+ c_main_~i~0 39) 4294967296)) (.cse3 (mod (+ c_main_~i~0 36) 4294967296)) (.cse5 (mod (+ c_main_~i~0 33) 4294967296)) (.cse14 (mod (+ c_main_~i~0 6) 4294967296)) (.cse18 (mod (+ c_main_~i~0 21) 4294967296)) (.cse12 (mod (+ c_main_~i~0 24) 4294967296)) (.cse9 (mod c_main_~i~0 4294967296)) (.cse23 (mod (+ c_main_~i~0 12) 4294967296)) (.cse25 (mod (+ c_main_~i~0 9) 4294967296)) (.cse22 (mod (+ c_main_~i~0 15) 4294967296)) (.cse2 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse19 (mod (+ c_main_~i~0 18) 4294967296))) (and (or (let ((.cse0 (mod (+ 39 c_main_~j~0) 4294967296))) (and (= .cse0 .cse1) (not (= (mod (mod .cse1 .cse2) 4294967296) 0)) (= .cse0 (mod (+ 39 c_main_~k~0) 4294967296)))) (< .cse1 (+ .cse3 1))) (or (let ((.cse4 (mod (+ 33 c_main_~j~0) 4294967296))) (and (= .cse4 (mod (+ 33 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse5 .cse2) 4294967296) 0)) (= .cse4 .cse5))) (< .cse5 (+ .cse6 1))) (or (let ((.cse8 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse7 .cse2) 4294967296) 0)) (= .cse8 .cse7) (= .cse8 (mod (+ 3 c_main_~k~0) 4294967296)))) (< .cse7 (+ .cse9 1))) (or (< .cse6 (+ .cse10 1)) (let ((.cse11 (mod (+ 30 c_main_~j~0) 4294967296))) (and (= .cse11 (mod (+ 30 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse6 .cse2) 4294967296) 0)) (= .cse6 .cse11)))) (or (< .cse10 (+ .cse12 1)) (let ((.cse13 (mod (+ c_main_~j~0 27) 4294967296))) (and (= .cse13 .cse10) (= (mod (+ 27 c_main_~k~0) 4294967296) .cse13) (not (= (mod (mod .cse10 .cse2) 4294967296) 0))))) (or (< .cse14 (+ .cse7 1)) (let ((.cse15 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse15 .cse14) (= .cse15 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse14 .cse2) 4294967296) 0))))) (let ((.cse16 (mod (+ c_main_~i~0 42) 4294967296))) (or (let ((.cse17 (mod (+ 42 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse16 .cse2) 4294967296) 0)) (= (mod (+ 42 c_main_~k~0) 4294967296) .cse17) (= .cse16 .cse17))) (< .cse16 (+ .cse1 1)))) (or (< .cse18 (+ .cse19 1)) (let ((.cse20 (mod (+ 21 c_main_~j~0) 4294967296))) (and (= .cse20 (mod (+ 21 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse18 .cse2) 4294967296) 0)) (= .cse20 .cse18)))) (or (let ((.cse21 (mod (+ c_main_~j~0 36) 4294967296))) (and (= .cse21 (mod (+ 36 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse3 .cse2) 4294967296) 0)) (= .cse3 .cse21))) (< .cse3 (+ .cse5 1))) (or (< .cse22 (+ .cse23 1)) (let ((.cse24 (mod (+ 15 c_main_~j~0) 4294967296))) (and (= .cse22 .cse24) (= .cse24 (mod (+ 15 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse22 .cse2) 4294967296) 0))))) (or (< .cse25 (+ .cse14 1)) (let ((.cse26 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse26 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse25 .cse2) 4294967296) 0)) (= .cse26 .cse25)))) (or (< .cse12 (+ 1 .cse18)) (let ((.cse27 (mod (+ c_main_~j~0 24) 4294967296))) (and (= .cse27 (mod (+ c_main_~k~0 24) 4294967296)) (not (= (mod (mod .cse12 .cse2) 4294967296) 0)) (= .cse27 .cse12)))) (let ((.cse28 (mod c_main_~n~0 4294967296))) (or (< .cse9 .cse28) (let ((.cse29 (mod c_main_~j~0 4294967296))) (and (= .cse29 (mod c_main_~k~0 4294967296)) (= .cse29 .cse9) (not (= 0 (mod (mod .cse9 .cse2) 4294967296))))) (< .cse28 1))) (or (let ((.cse30 (mod (+ c_main_~j~0 12) 4294967296))) (and (= .cse30 (mod (+ 12 c_main_~k~0) 4294967296)) (= .cse30 .cse23) (not (= (mod (mod .cse23 .cse2) 4294967296) 0)))) (< .cse23 (+ .cse25 1))) (or (< .cse19 (+ .cse22 1)) (let ((.cse31 (mod (+ c_main_~j~0 18) 4294967296))) (and (not (= (mod (mod .cse19 .cse2) 4294967296) 0)) (= .cse19 .cse31) (= .cse31 (mod (+ 18 c_main_~k~0) 4294967296))))))) is different from false [2024-10-15 14:32:06,329 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (+ c_main_~i~0 30) 4294967296)) (.cse10 (mod (+ c_main_~i~0 27) 4294967296)) (.cse7 (mod (+ c_main_~i~0 3) 4294967296)) (.cse3 (mod (+ c_main_~i~0 36) 4294967296)) (.cse5 (mod (+ c_main_~i~0 33) 4294967296)) (.cse14 (mod (+ c_main_~i~0 6) 4294967296)) (.cse16 (mod (+ c_main_~i~0 21) 4294967296)) (.cse12 (mod (+ c_main_~i~0 24) 4294967296)) (.cse9 (mod c_main_~i~0 4294967296)) (.cse21 (mod (+ c_main_~i~0 12) 4294967296)) (.cse23 (mod (+ c_main_~i~0 9) 4294967296)) (.cse20 (mod (+ c_main_~i~0 15) 4294967296)) (.cse2 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse17 (mod (+ c_main_~i~0 18) 4294967296))) (and (let ((.cse1 (mod (+ c_main_~i~0 39) 4294967296))) (or (let ((.cse0 (mod (+ 39 c_main_~j~0) 4294967296))) (and (= .cse0 .cse1) (not (= (mod (mod .cse1 .cse2) 4294967296) 0)) (= .cse0 (mod (+ 39 c_main_~k~0) 4294967296)))) (< .cse1 (+ .cse3 1)))) (or (let ((.cse4 (mod (+ 33 c_main_~j~0) 4294967296))) (and (= .cse4 (mod (+ 33 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse5 .cse2) 4294967296) 0)) (= .cse4 .cse5))) (< .cse5 (+ .cse6 1))) (or (let ((.cse8 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse7 .cse2) 4294967296) 0)) (= .cse8 .cse7) (= .cse8 (mod (+ 3 c_main_~k~0) 4294967296)))) (< .cse7 (+ .cse9 1))) (or (< .cse6 (+ .cse10 1)) (let ((.cse11 (mod (+ 30 c_main_~j~0) 4294967296))) (and (= .cse11 (mod (+ 30 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse6 .cse2) 4294967296) 0)) (= .cse6 .cse11)))) (or (< .cse10 (+ .cse12 1)) (let ((.cse13 (mod (+ c_main_~j~0 27) 4294967296))) (and (= .cse13 .cse10) (= (mod (+ 27 c_main_~k~0) 4294967296) .cse13) (not (= (mod (mod .cse10 .cse2) 4294967296) 0))))) (or (< .cse14 (+ .cse7 1)) (let ((.cse15 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse15 .cse14) (= .cse15 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse14 .cse2) 4294967296) 0))))) (or (< .cse16 (+ .cse17 1)) (let ((.cse18 (mod (+ 21 c_main_~j~0) 4294967296))) (and (= .cse18 (mod (+ 21 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse16 .cse2) 4294967296) 0)) (= .cse18 .cse16)))) (or (let ((.cse19 (mod (+ c_main_~j~0 36) 4294967296))) (and (= .cse19 (mod (+ 36 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse3 .cse2) 4294967296) 0)) (= .cse3 .cse19))) (< .cse3 (+ .cse5 1))) (or (< .cse20 (+ .cse21 1)) (let ((.cse22 (mod (+ 15 c_main_~j~0) 4294967296))) (and (= .cse20 .cse22) (= .cse22 (mod (+ 15 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse20 .cse2) 4294967296) 0))))) (or (< .cse23 (+ .cse14 1)) (let ((.cse24 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse24 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse23 .cse2) 4294967296) 0)) (= .cse24 .cse23)))) (or (< .cse12 (+ 1 .cse16)) (let ((.cse25 (mod (+ c_main_~j~0 24) 4294967296))) (and (= .cse25 (mod (+ c_main_~k~0 24) 4294967296)) (not (= (mod (mod .cse12 .cse2) 4294967296) 0)) (= .cse25 .cse12)))) (let ((.cse26 (mod c_main_~n~0 4294967296))) (or (< .cse9 .cse26) (let ((.cse27 (mod c_main_~j~0 4294967296))) (and (= .cse27 (mod c_main_~k~0 4294967296)) (= .cse27 .cse9) (not (= 0 (mod (mod .cse9 .cse2) 4294967296))))) (< .cse26 1))) (or (let ((.cse28 (mod (+ c_main_~j~0 12) 4294967296))) (and (= .cse28 (mod (+ 12 c_main_~k~0) 4294967296)) (= .cse28 .cse21) (not (= (mod (mod .cse21 .cse2) 4294967296) 0)))) (< .cse21 (+ .cse23 1))) (or (< .cse17 (+ .cse20 1)) (let ((.cse29 (mod (+ c_main_~j~0 18) 4294967296))) (and (not (= (mod (mod .cse17 .cse2) 4294967296) 0)) (= .cse17 .cse29) (= .cse29 (mod (+ 18 c_main_~k~0) 4294967296))))))) is different from false [2024-10-15 14:32:10,344 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ c_main_~i~0 30) 4294967296)) (.cse7 (mod (+ c_main_~i~0 27) 4294967296)) (.cse4 (mod (+ c_main_~i~0 3) 4294967296)) (.cse1 (mod (+ c_main_~i~0 33) 4294967296)) (.cse11 (mod (+ c_main_~i~0 6) 4294967296)) (.cse13 (mod (+ c_main_~i~0 21) 4294967296)) (.cse9 (mod (+ c_main_~i~0 24) 4294967296)) (.cse6 (mod c_main_~i~0 4294967296)) (.cse19 (mod (+ c_main_~i~0 12) 4294967296)) (.cse21 (mod (+ c_main_~i~0 9) 4294967296)) (.cse18 (mod (+ c_main_~i~0 15) 4294967296)) (.cse2 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse14 (mod (+ c_main_~i~0 18) 4294967296))) (and (or (let ((.cse0 (mod (+ 33 c_main_~j~0) 4294967296))) (and (= .cse0 (mod (+ 33 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse1 .cse2) 4294967296) 0)) (= .cse0 .cse1))) (< .cse1 (+ .cse3 1))) (or (let ((.cse5 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse4 .cse2) 4294967296) 0)) (= .cse5 .cse4) (= .cse5 (mod (+ 3 c_main_~k~0) 4294967296)))) (< .cse4 (+ .cse6 1))) (or (< .cse3 (+ .cse7 1)) (let ((.cse8 (mod (+ 30 c_main_~j~0) 4294967296))) (and (= .cse8 (mod (+ 30 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse3 .cse2) 4294967296) 0)) (= .cse3 .cse8)))) (or (< .cse7 (+ .cse9 1)) (let ((.cse10 (mod (+ c_main_~j~0 27) 4294967296))) (and (= .cse10 .cse7) (= (mod (+ 27 c_main_~k~0) 4294967296) .cse10) (not (= (mod (mod .cse7 .cse2) 4294967296) 0))))) (or (< .cse11 (+ .cse4 1)) (let ((.cse12 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse12 .cse11) (= .cse12 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse11 .cse2) 4294967296) 0))))) (or (< .cse13 (+ .cse14 1)) (let ((.cse15 (mod (+ 21 c_main_~j~0) 4294967296))) (and (= .cse15 (mod (+ 21 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse13 .cse2) 4294967296) 0)) (= .cse15 .cse13)))) (let ((.cse17 (mod (+ c_main_~i~0 36) 4294967296))) (or (let ((.cse16 (mod (+ c_main_~j~0 36) 4294967296))) (and (= .cse16 (mod (+ 36 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse17 .cse2) 4294967296) 0)) (= .cse17 .cse16))) (< .cse17 (+ .cse1 1)))) (or (< .cse18 (+ .cse19 1)) (let ((.cse20 (mod (+ 15 c_main_~j~0) 4294967296))) (and (= .cse18 .cse20) (= .cse20 (mod (+ 15 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse18 .cse2) 4294967296) 0))))) (or (< .cse21 (+ .cse11 1)) (let ((.cse22 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse22 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse21 .cse2) 4294967296) 0)) (= .cse22 .cse21)))) (or (< .cse9 (+ 1 .cse13)) (let ((.cse23 (mod (+ c_main_~j~0 24) 4294967296))) (and (= .cse23 (mod (+ c_main_~k~0 24) 4294967296)) (not (= (mod (mod .cse9 .cse2) 4294967296) 0)) (= .cse23 .cse9)))) (let ((.cse24 (mod c_main_~n~0 4294967296))) (or (< .cse6 .cse24) (let ((.cse25 (mod c_main_~j~0 4294967296))) (and (= .cse25 (mod c_main_~k~0 4294967296)) (= .cse25 .cse6) (not (= 0 (mod (mod .cse6 .cse2) 4294967296))))) (< .cse24 1))) (or (let ((.cse26 (mod (+ c_main_~j~0 12) 4294967296))) (and (= .cse26 (mod (+ 12 c_main_~k~0) 4294967296)) (= .cse26 .cse19) (not (= (mod (mod .cse19 .cse2) 4294967296) 0)))) (< .cse19 (+ .cse21 1))) (or (< .cse14 (+ .cse18 1)) (let ((.cse27 (mod (+ c_main_~j~0 18) 4294967296))) (and (not (= (mod (mod .cse14 .cse2) 4294967296) 0)) (= .cse14 .cse27) (= .cse27 (mod (+ 18 c_main_~k~0) 4294967296))))))) is different from false [2024-10-15 14:32:14,360 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ c_main_~i~0 30) 4294967296)) (.cse7 (mod (+ c_main_~i~0 27) 4294967296)) (.cse4 (mod (+ c_main_~i~0 3) 4294967296)) (.cse11 (mod (+ c_main_~i~0 6) 4294967296)) (.cse13 (mod (+ c_main_~i~0 21) 4294967296)) (.cse9 (mod (+ c_main_~i~0 24) 4294967296)) (.cse6 (mod c_main_~i~0 4294967296)) (.cse17 (mod (+ c_main_~i~0 12) 4294967296)) (.cse19 (mod (+ c_main_~i~0 9) 4294967296)) (.cse16 (mod (+ c_main_~i~0 15) 4294967296)) (.cse2 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse14 (mod (+ c_main_~i~0 18) 4294967296))) (and (let ((.cse1 (mod (+ c_main_~i~0 33) 4294967296))) (or (let ((.cse0 (mod (+ 33 c_main_~j~0) 4294967296))) (and (= .cse0 (mod (+ 33 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse1 .cse2) 4294967296) 0)) (= .cse0 .cse1))) (< .cse1 (+ .cse3 1)))) (or (let ((.cse5 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse4 .cse2) 4294967296) 0)) (= .cse5 .cse4) (= .cse5 (mod (+ 3 c_main_~k~0) 4294967296)))) (< .cse4 (+ .cse6 1))) (or (< .cse3 (+ .cse7 1)) (let ((.cse8 (mod (+ 30 c_main_~j~0) 4294967296))) (and (= .cse8 (mod (+ 30 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse3 .cse2) 4294967296) 0)) (= .cse3 .cse8)))) (or (< .cse7 (+ .cse9 1)) (let ((.cse10 (mod (+ c_main_~j~0 27) 4294967296))) (and (= .cse10 .cse7) (= (mod (+ 27 c_main_~k~0) 4294967296) .cse10) (not (= (mod (mod .cse7 .cse2) 4294967296) 0))))) (or (< .cse11 (+ .cse4 1)) (let ((.cse12 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse12 .cse11) (= .cse12 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse11 .cse2) 4294967296) 0))))) (or (< .cse13 (+ .cse14 1)) (let ((.cse15 (mod (+ 21 c_main_~j~0) 4294967296))) (and (= .cse15 (mod (+ 21 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse13 .cse2) 4294967296) 0)) (= .cse15 .cse13)))) (or (< .cse16 (+ .cse17 1)) (let ((.cse18 (mod (+ 15 c_main_~j~0) 4294967296))) (and (= .cse16 .cse18) (= .cse18 (mod (+ 15 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse16 .cse2) 4294967296) 0))))) (or (< .cse19 (+ .cse11 1)) (let ((.cse20 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse20 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse19 .cse2) 4294967296) 0)) (= .cse20 .cse19)))) (or (< .cse9 (+ 1 .cse13)) (let ((.cse21 (mod (+ c_main_~j~0 24) 4294967296))) (and (= .cse21 (mod (+ c_main_~k~0 24) 4294967296)) (not (= (mod (mod .cse9 .cse2) 4294967296) 0)) (= .cse21 .cse9)))) (let ((.cse22 (mod c_main_~n~0 4294967296))) (or (< .cse6 .cse22) (let ((.cse23 (mod c_main_~j~0 4294967296))) (and (= .cse23 (mod c_main_~k~0 4294967296)) (= .cse23 .cse6) (not (= 0 (mod (mod .cse6 .cse2) 4294967296))))) (< .cse22 1))) (or (let ((.cse24 (mod (+ c_main_~j~0 12) 4294967296))) (and (= .cse24 (mod (+ 12 c_main_~k~0) 4294967296)) (= .cse24 .cse17) (not (= (mod (mod .cse17 .cse2) 4294967296) 0)))) (< .cse17 (+ .cse19 1))) (or (< .cse14 (+ .cse16 1)) (let ((.cse25 (mod (+ c_main_~j~0 18) 4294967296))) (and (not (= (mod (mod .cse14 .cse2) 4294967296) 0)) (= .cse14 .cse25) (= .cse25 (mod (+ 18 c_main_~k~0) 4294967296))))))) is different from false [2024-10-15 14:32:18,392 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (+ c_main_~i~0 27) 4294967296)) (.cse0 (mod (+ c_main_~i~0 3) 4294967296)) (.cse9 (mod (+ c_main_~i~0 6) 4294967296)) (.cse11 (mod (+ c_main_~i~0 21) 4294967296)) (.cse7 (mod (+ c_main_~i~0 24) 4294967296)) (.cse3 (mod c_main_~i~0 4294967296)) (.cse15 (mod (+ c_main_~i~0 12) 4294967296)) (.cse17 (mod (+ c_main_~i~0 9) 4294967296)) (.cse14 (mod (+ c_main_~i~0 15) 4294967296)) (.cse1 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse12 (mod (+ c_main_~i~0 18) 4294967296))) (and (or (let ((.cse2 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse0 .cse1) 4294967296) 0)) (= .cse2 .cse0) (= .cse2 (mod (+ 3 c_main_~k~0) 4294967296)))) (< .cse0 (+ .cse3 1))) (let ((.cse4 (mod (+ c_main_~i~0 30) 4294967296))) (or (< .cse4 (+ .cse5 1)) (let ((.cse6 (mod (+ 30 c_main_~j~0) 4294967296))) (and (= .cse6 (mod (+ 30 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse4 .cse1) 4294967296) 0)) (= .cse4 .cse6))))) (or (< .cse5 (+ .cse7 1)) (let ((.cse8 (mod (+ c_main_~j~0 27) 4294967296))) (and (= .cse8 .cse5) (= (mod (+ 27 c_main_~k~0) 4294967296) .cse8) (not (= (mod (mod .cse5 .cse1) 4294967296) 0))))) (or (< .cse9 (+ .cse0 1)) (let ((.cse10 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse10 .cse9) (= .cse10 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse9 .cse1) 4294967296) 0))))) (or (< .cse11 (+ .cse12 1)) (let ((.cse13 (mod (+ 21 c_main_~j~0) 4294967296))) (and (= .cse13 (mod (+ 21 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse11 .cse1) 4294967296) 0)) (= .cse13 .cse11)))) (or (< .cse14 (+ .cse15 1)) (let ((.cse16 (mod (+ 15 c_main_~j~0) 4294967296))) (and (= .cse14 .cse16) (= .cse16 (mod (+ 15 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse14 .cse1) 4294967296) 0))))) (or (< .cse17 (+ .cse9 1)) (let ((.cse18 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse18 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse17 .cse1) 4294967296) 0)) (= .cse18 .cse17)))) (or (< .cse7 (+ 1 .cse11)) (let ((.cse19 (mod (+ c_main_~j~0 24) 4294967296))) (and (= .cse19 (mod (+ c_main_~k~0 24) 4294967296)) (not (= (mod (mod .cse7 .cse1) 4294967296) 0)) (= .cse19 .cse7)))) (let ((.cse20 (mod c_main_~n~0 4294967296))) (or (< .cse3 .cse20) (let ((.cse21 (mod c_main_~j~0 4294967296))) (and (= .cse21 (mod c_main_~k~0 4294967296)) (= .cse21 .cse3) (not (= 0 (mod (mod .cse3 .cse1) 4294967296))))) (< .cse20 1))) (or (let ((.cse22 (mod (+ c_main_~j~0 12) 4294967296))) (and (= .cse22 (mod (+ 12 c_main_~k~0) 4294967296)) (= .cse22 .cse15) (not (= (mod (mod .cse15 .cse1) 4294967296) 0)))) (< .cse15 (+ .cse17 1))) (or (< .cse12 (+ .cse14 1)) (let ((.cse23 (mod (+ c_main_~j~0 18) 4294967296))) (and (not (= (mod (mod .cse12 .cse1) 4294967296) 0)) (= .cse12 .cse23) (= .cse23 (mod (+ 18 c_main_~k~0) 4294967296))))))) is different from false [2024-10-15 14:32:22,407 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_main_~i~0 3) 4294967296)) (.cse7 (mod (+ c_main_~i~0 6) 4294967296)) (.cse9 (mod (+ c_main_~i~0 21) 4294967296)) (.cse5 (mod (+ c_main_~i~0 24) 4294967296)) (.cse3 (mod c_main_~i~0 4294967296)) (.cse13 (mod (+ c_main_~i~0 12) 4294967296)) (.cse15 (mod (+ c_main_~i~0 9) 4294967296)) (.cse12 (mod (+ c_main_~i~0 15) 4294967296)) (.cse1 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse10 (mod (+ c_main_~i~0 18) 4294967296))) (and (or (let ((.cse2 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse0 .cse1) 4294967296) 0)) (= .cse2 .cse0) (= .cse2 (mod (+ 3 c_main_~k~0) 4294967296)))) (< .cse0 (+ .cse3 1))) (let ((.cse4 (mod (+ c_main_~i~0 27) 4294967296))) (or (< .cse4 (+ .cse5 1)) (let ((.cse6 (mod (+ c_main_~j~0 27) 4294967296))) (and (= .cse6 .cse4) (= (mod (+ 27 c_main_~k~0) 4294967296) .cse6) (not (= (mod (mod .cse4 .cse1) 4294967296) 0)))))) (or (< .cse7 (+ .cse0 1)) (let ((.cse8 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse8 .cse7) (= .cse8 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse7 .cse1) 4294967296) 0))))) (or (< .cse9 (+ .cse10 1)) (let ((.cse11 (mod (+ 21 c_main_~j~0) 4294967296))) (and (= .cse11 (mod (+ 21 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse9 .cse1) 4294967296) 0)) (= .cse11 .cse9)))) (or (< .cse12 (+ .cse13 1)) (let ((.cse14 (mod (+ 15 c_main_~j~0) 4294967296))) (and (= .cse12 .cse14) (= .cse14 (mod (+ 15 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse12 .cse1) 4294967296) 0))))) (or (< .cse15 (+ .cse7 1)) (let ((.cse16 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse16 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse15 .cse1) 4294967296) 0)) (= .cse16 .cse15)))) (or (< .cse5 (+ 1 .cse9)) (let ((.cse17 (mod (+ c_main_~j~0 24) 4294967296))) (and (= .cse17 (mod (+ c_main_~k~0 24) 4294967296)) (not (= (mod (mod .cse5 .cse1) 4294967296) 0)) (= .cse17 .cse5)))) (let ((.cse18 (mod c_main_~n~0 4294967296))) (or (< .cse3 .cse18) (let ((.cse19 (mod c_main_~j~0 4294967296))) (and (= .cse19 (mod c_main_~k~0 4294967296)) (= .cse19 .cse3) (not (= 0 (mod (mod .cse3 .cse1) 4294967296))))) (< .cse18 1))) (or (let ((.cse20 (mod (+ c_main_~j~0 12) 4294967296))) (and (= .cse20 (mod (+ 12 c_main_~k~0) 4294967296)) (= .cse20 .cse13) (not (= (mod (mod .cse13 .cse1) 4294967296) 0)))) (< .cse13 (+ .cse15 1))) (or (< .cse10 (+ .cse12 1)) (let ((.cse21 (mod (+ c_main_~j~0 18) 4294967296))) (and (not (= (mod (mod .cse10 .cse1) 4294967296) 0)) (= .cse10 .cse21) (= .cse21 (mod (+ 18 c_main_~k~0) 4294967296))))))) is different from false [2024-10-15 14:32:26,419 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_main_~i~0 3) 4294967296)) (.cse4 (mod (+ c_main_~i~0 6) 4294967296)) (.cse6 (mod (+ c_main_~i~0 21) 4294967296)) (.cse3 (mod c_main_~i~0 4294967296)) (.cse10 (mod (+ c_main_~i~0 12) 4294967296)) (.cse12 (mod (+ c_main_~i~0 9) 4294967296)) (.cse9 (mod (+ c_main_~i~0 15) 4294967296)) (.cse1 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse7 (mod (+ c_main_~i~0 18) 4294967296))) (and (or (let ((.cse2 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse0 .cse1) 4294967296) 0)) (= .cse2 .cse0) (= .cse2 (mod (+ 3 c_main_~k~0) 4294967296)))) (< .cse0 (+ .cse3 1))) (or (< .cse4 (+ .cse0 1)) (let ((.cse5 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse5 .cse4) (= .cse5 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse4 .cse1) 4294967296) 0))))) (or (< .cse6 (+ .cse7 1)) (let ((.cse8 (mod (+ 21 c_main_~j~0) 4294967296))) (and (= .cse8 (mod (+ 21 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse6 .cse1) 4294967296) 0)) (= .cse8 .cse6)))) (or (< .cse9 (+ .cse10 1)) (let ((.cse11 (mod (+ 15 c_main_~j~0) 4294967296))) (and (= .cse9 .cse11) (= .cse11 (mod (+ 15 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse9 .cse1) 4294967296) 0))))) (or (< .cse12 (+ .cse4 1)) (let ((.cse13 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse13 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse12 .cse1) 4294967296) 0)) (= .cse13 .cse12)))) (let ((.cse14 (mod (+ c_main_~i~0 24) 4294967296))) (or (< .cse14 (+ 1 .cse6)) (let ((.cse15 (mod (+ c_main_~j~0 24) 4294967296))) (and (= .cse15 (mod (+ c_main_~k~0 24) 4294967296)) (not (= (mod (mod .cse14 .cse1) 4294967296) 0)) (= .cse15 .cse14))))) (let ((.cse16 (mod c_main_~n~0 4294967296))) (or (< .cse3 .cse16) (let ((.cse17 (mod c_main_~j~0 4294967296))) (and (= .cse17 (mod c_main_~k~0 4294967296)) (= .cse17 .cse3) (not (= 0 (mod (mod .cse3 .cse1) 4294967296))))) (< .cse16 1))) (or (let ((.cse18 (mod (+ c_main_~j~0 12) 4294967296))) (and (= .cse18 (mod (+ 12 c_main_~k~0) 4294967296)) (= .cse18 .cse10) (not (= (mod (mod .cse10 .cse1) 4294967296) 0)))) (< .cse10 (+ .cse12 1))) (or (< .cse7 (+ .cse9 1)) (let ((.cse19 (mod (+ c_main_~j~0 18) 4294967296))) (and (not (= (mod (mod .cse7 .cse1) 4294967296) 0)) (= .cse7 .cse19) (= .cse19 (mod (+ 18 c_main_~k~0) 4294967296))))))) is different from false [2024-10-15 14:32:30,430 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_main_~i~0 3) 4294967296)) (.cse4 (mod (+ c_main_~i~0 6) 4294967296)) (.cse3 (mod c_main_~i~0 4294967296)) (.cse10 (mod (+ c_main_~i~0 12) 4294967296)) (.cse12 (mod (+ c_main_~i~0 9) 4294967296)) (.cse9 (mod (+ c_main_~i~0 15) 4294967296)) (.cse1 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse7 (mod (+ c_main_~i~0 18) 4294967296))) (and (or (let ((.cse2 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse0 .cse1) 4294967296) 0)) (= .cse2 .cse0) (= .cse2 (mod (+ 3 c_main_~k~0) 4294967296)))) (< .cse0 (+ .cse3 1))) (or (< .cse4 (+ .cse0 1)) (let ((.cse5 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse5 .cse4) (= .cse5 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse4 .cse1) 4294967296) 0))))) (let ((.cse6 (mod (+ c_main_~i~0 21) 4294967296))) (or (< .cse6 (+ .cse7 1)) (let ((.cse8 (mod (+ 21 c_main_~j~0) 4294967296))) (and (= .cse8 (mod (+ 21 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse6 .cse1) 4294967296) 0)) (= .cse8 .cse6))))) (or (< .cse9 (+ .cse10 1)) (let ((.cse11 (mod (+ 15 c_main_~j~0) 4294967296))) (and (= .cse9 .cse11) (= .cse11 (mod (+ 15 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse9 .cse1) 4294967296) 0))))) (or (< .cse12 (+ .cse4 1)) (let ((.cse13 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse13 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse12 .cse1) 4294967296) 0)) (= .cse13 .cse12)))) (let ((.cse14 (mod c_main_~n~0 4294967296))) (or (< .cse3 .cse14) (let ((.cse15 (mod c_main_~j~0 4294967296))) (and (= .cse15 (mod c_main_~k~0 4294967296)) (= .cse15 .cse3) (not (= 0 (mod (mod .cse3 .cse1) 4294967296))))) (< .cse14 1))) (or (let ((.cse16 (mod (+ c_main_~j~0 12) 4294967296))) (and (= .cse16 (mod (+ 12 c_main_~k~0) 4294967296)) (= .cse16 .cse10) (not (= (mod (mod .cse10 .cse1) 4294967296) 0)))) (< .cse10 (+ .cse12 1))) (or (< .cse7 (+ .cse9 1)) (let ((.cse17 (mod (+ c_main_~j~0 18) 4294967296))) (and (not (= (mod (mod .cse7 .cse1) 4294967296) 0)) (= .cse7 .cse17) (= .cse17 (mod (+ 18 c_main_~k~0) 4294967296))))))) is different from false [2024-10-15 14:32:34,443 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_main_~i~0 3) 4294967296)) (.cse4 (mod (+ c_main_~i~0 6) 4294967296)) (.cse3 (mod c_main_~i~0 4294967296)) (.cse7 (mod (+ c_main_~i~0 12) 4294967296)) (.cse9 (mod (+ c_main_~i~0 9) 4294967296)) (.cse6 (mod (+ c_main_~i~0 15) 4294967296)) (.cse1 (mod (+ 2 c_~SIZE~0) 4294967296))) (and (or (let ((.cse2 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse0 .cse1) 4294967296) 0)) (= .cse2 .cse0) (= .cse2 (mod (+ 3 c_main_~k~0) 4294967296)))) (< .cse0 (+ .cse3 1))) (or (< .cse4 (+ .cse0 1)) (let ((.cse5 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse5 .cse4) (= .cse5 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse4 .cse1) 4294967296) 0))))) (or (< .cse6 (+ .cse7 1)) (let ((.cse8 (mod (+ 15 c_main_~j~0) 4294967296))) (and (= .cse6 .cse8) (= .cse8 (mod (+ 15 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse6 .cse1) 4294967296) 0))))) (or (< .cse9 (+ .cse4 1)) (let ((.cse10 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse10 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse9 .cse1) 4294967296) 0)) (= .cse10 .cse9)))) (let ((.cse11 (mod c_main_~n~0 4294967296))) (or (< .cse3 .cse11) (let ((.cse12 (mod c_main_~j~0 4294967296))) (and (= .cse12 (mod c_main_~k~0 4294967296)) (= .cse12 .cse3) (not (= 0 (mod (mod .cse3 .cse1) 4294967296))))) (< .cse11 1))) (or (let ((.cse13 (mod (+ c_main_~j~0 12) 4294967296))) (and (= .cse13 (mod (+ 12 c_main_~k~0) 4294967296)) (= .cse13 .cse7) (not (= (mod (mod .cse7 .cse1) 4294967296) 0)))) (< .cse7 (+ .cse9 1))) (let ((.cse14 (mod (+ c_main_~i~0 18) 4294967296))) (or (< .cse14 (+ .cse6 1)) (let ((.cse15 (mod (+ c_main_~j~0 18) 4294967296))) (and (not (= (mod (mod .cse14 .cse1) 4294967296) 0)) (= .cse14 .cse15) (= .cse15 (mod (+ 18 c_main_~k~0) 4294967296)))))))) is different from false [2024-10-15 14:32:38,453 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_main_~i~0 3) 4294967296)) (.cse4 (mod (+ c_main_~i~0 6) 4294967296)) (.cse3 (mod c_main_~i~0 4294967296)) (.cse1 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse7 (mod (+ c_main_~i~0 12) 4294967296)) (.cse9 (mod (+ c_main_~i~0 9) 4294967296))) (and (or (let ((.cse2 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse0 .cse1) 4294967296) 0)) (= .cse2 .cse0) (= .cse2 (mod (+ 3 c_main_~k~0) 4294967296)))) (< .cse0 (+ .cse3 1))) (or (< .cse4 (+ .cse0 1)) (let ((.cse5 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse5 .cse4) (= .cse5 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse4 .cse1) 4294967296) 0))))) (let ((.cse6 (mod (+ c_main_~i~0 15) 4294967296))) (or (< .cse6 (+ .cse7 1)) (let ((.cse8 (mod (+ 15 c_main_~j~0) 4294967296))) (and (= .cse6 .cse8) (= .cse8 (mod (+ 15 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse6 .cse1) 4294967296) 0)))))) (or (< .cse9 (+ .cse4 1)) (let ((.cse10 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse10 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse9 .cse1) 4294967296) 0)) (= .cse10 .cse9)))) (let ((.cse11 (mod c_main_~n~0 4294967296))) (or (< .cse3 .cse11) (let ((.cse12 (mod c_main_~j~0 4294967296))) (and (= .cse12 (mod c_main_~k~0 4294967296)) (= .cse12 .cse3) (not (= 0 (mod (mod .cse3 .cse1) 4294967296))))) (< .cse11 1))) (or (let ((.cse13 (mod (+ c_main_~j~0 12) 4294967296))) (and (= .cse13 (mod (+ 12 c_main_~k~0) 4294967296)) (= .cse13 .cse7) (not (= (mod (mod .cse7 .cse1) 4294967296) 0)))) (< .cse7 (+ .cse9 1))))) is different from false [2024-10-15 14:33:38,236 WARN L286 SmtUtils]: Spent 10.54s on a formula simplification. DAG size of input: 94 DAG size of output: 75 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-15 14:33:40,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:33:42,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:33:45,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:33:48,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []