./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-87.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 983db8b9d7b8c1a6cf88f0ccf9f67454cabc986e490bff9f0d35f6b76f68db9d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:16:26,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:16:26,330 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:16:26,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:16:26,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:16:26,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:16:26,381 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:16:26,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:16:26,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:16:26,383 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:16:26,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:16:26,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:16:26,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:16:26,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:16:26,387 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:16:26,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:16:26,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:16:26,388 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:16:26,389 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:16:26,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:16:26,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:16:26,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:16:26,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:16:26,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:16:26,394 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:16:26,394 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:16:26,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:16:26,395 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:16:26,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:16:26,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:16:26,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:16:26,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:16:26,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:16:26,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:16:26,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:16:26,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:16:26,399 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:16:26,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:16:26,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:16:26,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:16:26,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:16:26,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:16:26,402 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 983db8b9d7b8c1a6cf88f0ccf9f67454cabc986e490bff9f0d35f6b76f68db9d [2024-10-11 12:16:26,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:16:26,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:16:26,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:16:26,710 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:16:26,710 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:16:26,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-87.i [2024-10-11 12:16:28,227 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:16:28,463 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:16:28,465 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-87.i [2024-10-11 12:16:28,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d191353d3/386fc48d26334477b1234296380c61de/FLAGc0f8cee49 [2024-10-11 12:16:28,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d191353d3/386fc48d26334477b1234296380c61de [2024-10-11 12:16:28,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:16:28,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:16:28,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:16:28,820 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:16:28,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:16:28,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:16:28" (1/1) ... [2024-10-11 12:16:28,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63751f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:28, skipping insertion in model container [2024-10-11 12:16:28,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:16:28" (1/1) ... [2024-10-11 12:16:28,866 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:16:29,059 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-87.i[916,929] [2024-10-11 12:16:29,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:16:29,203 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:16:29,217 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-87.i[916,929] [2024-10-11 12:16:29,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:16:29,310 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:16:29,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:29 WrapperNode [2024-10-11 12:16:29,311 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:16:29,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:16:29,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:16:29,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:16:29,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:29" (1/1) ... [2024-10-11 12:16:29,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:29" (1/1) ... [2024-10-11 12:16:29,390 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2024-10-11 12:16:29,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:16:29,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:16:29,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:16:29,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:16:29,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:29" (1/1) ... [2024-10-11 12:16:29,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:29" (1/1) ... [2024-10-11 12:16:29,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:29" (1/1) ... [2024-10-11 12:16:29,437 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:16:29,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:29" (1/1) ... [2024-10-11 12:16:29,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:29" (1/1) ... [2024-10-11 12:16:29,451 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:29" (1/1) ... [2024-10-11 12:16:29,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:29" (1/1) ... [2024-10-11 12:16:29,465 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:29" (1/1) ... [2024-10-11 12:16:29,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:29" (1/1) ... [2024-10-11 12:16:29,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:16:29,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:16:29,481 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:16:29,481 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:16:29,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:29" (1/1) ... [2024-10-11 12:16:29,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:16:29,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:16:29,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:16:29,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:16:29,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:16:29,566 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:16:29,566 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:16:29,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:16:29,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:16:29,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:16:29,648 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:16:29,651 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:16:30,192 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-11 12:16:30,192 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:16:30,258 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:16:30,258 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:16:30,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:16:30 BoogieIcfgContainer [2024-10-11 12:16:30,259 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:16:30,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:16:30,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:16:30,268 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:16:30,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:16:28" (1/3) ... [2024-10-11 12:16:30,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@796e3de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:16:30, skipping insertion in model container [2024-10-11 12:16:30,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:29" (2/3) ... [2024-10-11 12:16:30,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@796e3de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:16:30, skipping insertion in model container [2024-10-11 12:16:30,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:16:30" (3/3) ... [2024-10-11 12:16:30,272 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-87.i [2024-10-11 12:16:30,291 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:16:30,291 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:16:30,369 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:16:30,378 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b5660a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:16:30,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:16:30,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 12:16:30,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-11 12:16:30,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:16:30,405 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:16:30,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:16:30,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:16:30,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1740645682, now seen corresponding path program 1 times [2024-10-11 12:16:30,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:16:30,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803850668] [2024-10-11 12:16:30,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:16:30,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:16:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:30,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:16:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:30,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:16:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:30,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:16:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:30,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:16:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:30,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:16:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:30,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 12:16:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:30,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:16:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:30,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 12:16:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:30,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:16:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:30,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 12:16:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:30,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:16:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:30,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 12:16:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:30,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:16:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:30,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 12:16:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:30,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:16:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:30,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 12:16:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:30,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 12:16:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:30,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 12:16:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:31,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 12:16:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:31,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:16:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:31,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 12:16:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:31,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:16:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:31,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 12:16:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:31,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:16:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:31,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:16:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:31,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 12:16:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:31,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 12:16:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:31,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 12:16:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:31,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 12:16:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:31,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 12:16:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:31,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 12:16:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:31,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 12:16:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:31,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 12:16:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:31,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 12:16:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:31,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 12:16:31,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:16:31,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803850668] [2024-10-11 12:16:31,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803850668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:16:31,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:16:31,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:16:31,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415318463] [2024-10-11 12:16:31,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:16:31,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:16:31,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:16:31,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:16:31,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:16:31,169 INFO L87 Difference]: Start difference. First operand has 86 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 12:16:31,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:16:31,250 INFO L93 Difference]: Finished difference Result 169 states and 306 transitions. [2024-10-11 12:16:31,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:16:31,255 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 209 [2024-10-11 12:16:31,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:16:31,266 INFO L225 Difference]: With dead ends: 169 [2024-10-11 12:16:31,267 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 12:16:31,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:16:31,282 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:16:31,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:16:31,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 12:16:31,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 12:16:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 12:16:31,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 132 transitions. [2024-10-11 12:16:31,351 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 132 transitions. Word has length 209 [2024-10-11 12:16:31,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:16:31,352 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 132 transitions. [2024-10-11 12:16:31,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 12:16:31,353 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 132 transitions. [2024-10-11 12:16:31,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-11 12:16:31,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:16:31,358 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:16:31,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:16:31,359 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:16:31,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:16:31,361 INFO L85 PathProgramCache]: Analyzing trace with hash 810858134, now seen corresponding path program 1 times [2024-10-11 12:16:31,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:16:31,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940001720] [2024-10-11 12:16:31,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:16:31,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:16:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:16:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:16:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:16:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:16:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:16:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 12:16:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:16:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 12:16:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:16:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 12:16:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:16:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 12:16:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:16:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 12:16:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:16:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 12:16:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 12:16:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 12:16:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 12:16:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:16:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 12:16:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:16:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 12:16:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:16:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:16:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 12:16:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 12:16:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 12:16:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 12:16:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 12:16:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 12:16:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 12:16:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 12:16:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 12:16:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-11 12:16:32,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:16:32,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940001720] [2024-10-11 12:16:32,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940001720] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:16:32,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681677037] [2024-10-11 12:16:32,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:16:32,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:16:32,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:16:32,760 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:16:32,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 12:16:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:32,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 12:16:33,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:16:33,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1143 proven. 54 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2024-10-11 12:16:33,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:16:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-11 12:16:33,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681677037] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:16:33,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 12:16:33,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 12:16:33,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489993693] [2024-10-11 12:16:33,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 12:16:33,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 12:16:33,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:16:33,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 12:16:33,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:16:33,682 INFO L87 Difference]: Start difference. First operand 84 states and 132 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-10-11 12:16:33,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:16:33,979 INFO L93 Difference]: Finished difference Result 175 states and 270 transitions. [2024-10-11 12:16:33,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 12:16:33,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) Word has length 209 [2024-10-11 12:16:33,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:16:33,984 INFO L225 Difference]: With dead ends: 175 [2024-10-11 12:16:33,984 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 12:16:33,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 481 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 12:16:33,988 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 60 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:16:33,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 203 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:16:33,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 12:16:34,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2024-10-11 12:16:34,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 states have internal predecessors, (66), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 12:16:34,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 134 transitions. [2024-10-11 12:16:34,011 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 134 transitions. Word has length 209 [2024-10-11 12:16:34,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:16:34,012 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 134 transitions. [2024-10-11 12:16:34,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-10-11 12:16:34,013 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 134 transitions. [2024-10-11 12:16:34,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-11 12:16:34,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:16:34,016 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:16:34,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 12:16:34,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:16:34,217 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:16:34,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:16:34,218 INFO L85 PathProgramCache]: Analyzing trace with hash -210210220, now seen corresponding path program 1 times [2024-10-11 12:16:34,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:16:34,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378103458] [2024-10-11 12:16:34,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:16:34,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:16:34,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:16:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:16:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 12:16:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:16:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:16:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 12:16:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:16:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 12:16:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:16:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 12:16:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:16:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 12:16:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:16:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 12:16:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:16:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 12:16:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 12:16:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 12:16:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 12:16:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:16:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 12:16:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:16:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 12:16:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:16:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:16:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 12:16:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 12:16:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 12:16:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 12:16:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 12:16:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 12:16:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 12:16:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 12:16:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 12:16:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:35,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 132 proven. 60 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2024-10-11 12:16:35,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:16:35,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378103458] [2024-10-11 12:16:35,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378103458] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:16:35,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659830924] [2024-10-11 12:16:35,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:16:35,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:16:35,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:16:35,916 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:16:35,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 12:16:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:36,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 12:16:36,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:16:36,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1229 proven. 60 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2024-10-11 12:16:36,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:16:36,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 132 proven. 63 refuted. 0 times theorem prover too weak. 2049 trivial. 0 not checked. [2024-10-11 12:16:36,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659830924] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:16:36,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 12:16:36,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 19 [2024-10-11 12:16:36,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045937256] [2024-10-11 12:16:36,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 12:16:36,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 12:16:36,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:16:36,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 12:16:36,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2024-10-11 12:16:36,924 INFO L87 Difference]: Start difference. First operand 88 states and 134 transitions. Second operand has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 4 states have call successors, (55), 3 states have call predecessors, (55), 7 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) [2024-10-11 12:16:37,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:16:37,873 INFO L93 Difference]: Finished difference Result 296 states and 434 transitions. [2024-10-11 12:16:37,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 12:16:37,874 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 4 states have call successors, (55), 3 states have call predecessors, (55), 7 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) Word has length 209 [2024-10-11 12:16:37,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:16:37,877 INFO L225 Difference]: With dead ends: 296 [2024-10-11 12:16:37,877 INFO L226 Difference]: Without dead ends: 209 [2024-10-11 12:16:37,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 474 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 12:16:37,880 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 354 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 12:16:37,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 511 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 12:16:37,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-11 12:16:37,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 178. [2024-10-11 12:16:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 104 states have (on average 1.2403846153846154) internal successors, (129), 105 states have internal predecessors, (129), 66 states have call successors, (66), 7 states have call predecessors, (66), 7 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-11 12:16:37,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 261 transitions. [2024-10-11 12:16:37,929 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 261 transitions. Word has length 209 [2024-10-11 12:16:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:16:37,930 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 261 transitions. [2024-10-11 12:16:37,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 4 states have call successors, (55), 3 states have call predecessors, (55), 7 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) [2024-10-11 12:16:37,932 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 261 transitions. [2024-10-11 12:16:37,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-11 12:16:37,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:16:37,937 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:16:37,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 12:16:38,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:16:38,142 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:16:38,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:16:38,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1798558122, now seen corresponding path program 1 times [2024-10-11 12:16:38,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:16:38,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482616139] [2024-10-11 12:16:38,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:16:38,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:16:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 12:16:38,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1893982878] [2024-10-11 12:16:38,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:16:38,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:16:38,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:16:38,527 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:16:38,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 12:16:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:38,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-11 12:16:38,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:16:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1693 proven. 303 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-10-11 12:16:44,543 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:16:55,959 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse17 (+ c_~var_1_5~0 1)) (.cse8 (div c_~var_1_22~0 c_~var_1_5~0)) (.cse0 (+ |c_ULTIMATE.start_step_~stepLocal_0~0#1| 1))) (let ((.cse6 (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (< c_~var_1_5~0 ~var_1_6~0) (< ~var_1_6~0 0)))) (.cse2 (< c_~var_1_22~0 0)) (.cse4 (forall ((~var_1_6~0 Int)) (let ((.cse31 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse0 .cse31) (= .cse31 .cse0) (< 0 (+ ~var_1_6~0 1)))))) (.cse9 (forall ((~var_1_6~0 Int)) (let ((.cse30 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse0 .cse30) (< c_~var_1_5~0 ~var_1_6~0) (= .cse30 .cse0))))) (.cse12 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0)))) (.cse7 (< 0 (+ c_~var_1_22~0 1))) (.cse21 (< .cse0 .cse8)) (.cse19 (< 0 .cse17)) (.cse5 (< c_~var_1_5~0 0)) (.cse10 (not .cse13)) (.cse11 (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse8)) (.cse14 (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse8)) (.cse16 (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ .cse8 1)))) (and (forall ((~var_1_6~0 Int)) (let ((.cse1 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse0 .cse1) (< c_~var_1_5~0 ~var_1_6~0) (= .cse1 .cse0) (< 0 (+ ~var_1_6~0 1))))) (or (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (< c_~var_1_5~0 ~var_1_6~0))) .cse2) (forall ((~var_1_6~0 Int)) (let ((.cse3 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse0 .cse3) (< c_~var_1_5~0 ~var_1_6~0) (= .cse3 .cse0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (or (and .cse4 (or (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (< 0 (+ ~var_1_6~0 1)))) .cse2)) .cse5) (or .cse2 .cse6) (or .cse7 (forall ((~var_1_6~0 Int)) (or (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or (and (<= .cse0 .cse8) .cse6) .cse2) (or .cse2 .cse9) (or .cse7 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))) (or .cse5 .cse10 .cse4) (or .cse5 (let ((.cse15 (and (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))) (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse17) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))))) (and (or .cse10 .cse11 .cse12) (or .cse10 .cse11) (or .cse7 .cse13 .cse12) (or (and .cse14 .cse12) .cse11) (or .cse15 .cse16) (or .cse15 .cse11 .cse2) (or .cse15 .cse10 .cse11)))) (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (< c_~var_1_5~0 ~var_1_6~0) (< 0 (+ ~var_1_6~0 1)))) .cse2) (forall ((~var_1_6~0 Int)) (let ((.cse18 (div c_~var_1_22~0 ~var_1_6~0))) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse18) (< c_~var_1_5~0 ~var_1_6~0) (= .cse18 |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (< ~var_1_6~0 0)))) (or .cse19 .cse9) (or .cse19 (and (or .cse7 .cse13 .cse4) .cse9)) (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse5 (forall ((~var_1_6~0 Int)) (let ((.cse20 (div c_~var_1_22~0 ~var_1_6~0))) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse20) (< c_~var_1_5~0 ~var_1_6~0) (= .cse20 |c_ULTIMATE.start_step_~stepLocal_0~0#1|))))) (or .cse21 (let ((.cse23 (= .cse8 .cse0)) (.cse22 (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))))) (and (or (and (or .cse22 .cse23) (or .cse7 .cse13 .cse22)) .cse19) (or .cse23 (and (or .cse10 .cse22) (or .cse22 .cse16))) (or .cse10 .cse23) .cse12 (or .cse13 .cse22 .cse16) (or .cse7 .cse19 .cse13)))) (or (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))) .cse5) (or .cse7 (let ((.cse27 (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (let ((.cse26 (forall ((~var_1_6~0 Int)) (or (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (.cse25 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse17) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (.cse24 (or .cse16 .cse27)) (.cse28 (or .cse14 .cse27))) (and (or (and .cse24 (or .cse25 .cse16) (or .cse19 (and (or .cse26 .cse21) (or .cse21 .cse27)))) .cse13) (or (and .cse25 .cse27 (or .cse26 .cse19)) .cse10 .cse11) (or .cse11 (and .cse28 (or .cse25 (and .cse10 .cse14 (<= 0 c_~var_1_5~0))) (or .cse10 .cse27) (or .cse19 .cse27))) (or .cse5 (let ((.cse29 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse17) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or (and .cse24 (or .cse16 .cse29)) .cse13) (or (and .cse28 (or .cse14 .cse29)) .cse11) (or .cse10 .cse11 (and .cse27 .cse29))))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))))))))) is different from false [2024-10-11 12:17:02,080 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~var_1_25~0 c_~var_1_22~0 1)) (.cse15 (+ c_~var_1_5~0 1)) (.cse17 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse2 (div c_~var_1_22~0 c_~var_1_5~0)) (.cse0 (+ c_~var_1_25~0 c_~var_1_22~0))) (let ((.cse3 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0)))) (.cse9 (< .cse0 .cse2)) (.cse20 (forall ((~var_1_6~0 Int)) (or (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0)))) (.cse13 (< .cse0 (+ .cse2 1))) (.cse4 (< c_~var_1_22~0 0)) (.cse19 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse11 (not .cse17)) (.cse16 (< c_~var_1_5~0 0)) (.cse21 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse5 (< 0 (+ c_~var_1_22~0 1))) (.cse8 (< 0 .cse15)) (.cse18 (< .cse1 .cse2))) (and (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))) (or (and (<= .cse1 .cse2) .cse3) .cse4) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse5 (let ((.cse12 (forall ((~var_1_6~0 Int)) (or (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (let ((.cse6 (or .cse9 .cse12)) (.cse7 (forall ((~var_1_6~0 Int)) (or (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (.cse10 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse15) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (and (or (and .cse6 (or .cse7 .cse8 .cse9) (or .cse9 .cse10)) .cse11) (or (and (<= .cse0 .cse2) (or .cse8 .cse9)) .cse10) (or .cse11 .cse9 .cse12) (or .cse13 .cse12) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))) (or (let ((.cse14 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse15) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse11 (and .cse6 (or .cse9 .cse14))) (or .cse13 .cse14))) .cse16) (or .cse17 (and (or .cse8 (and (or .cse18 .cse12) (or .cse7 .cse18))) (or .cse10 .cse13))) (or .cse8 .cse9 .cse12))))) (or .cse8 .cse19) (or (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) .cse16) (or .cse20 .cse13) (or .cse16 .cse13) (or .cse5 (forall ((~var_1_6~0 Int)) (or (< .cse1 (div c_~var_1_22~0 ~var_1_6~0)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse11 .cse9) (or .cse8 (and (or .cse5 .cse17 .cse21) .cse19)) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse3 .cse4) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or .cse20 .cse8 .cse9) (or .cse20 .cse17 .cse13) (or .cse4 .cse19) (or .cse5 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (or .cse16 .cse11 .cse21) (or .cse16 .cse21) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse5 .cse8 .cse17 .cse18)))) is different from false [2024-10-11 12:17:18,960 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~var_1_28~0 65536)) (.cse42 (mod c_~var_1_8~0 256)) (.cse28 (div c_~var_1_22~0 c_~var_1_5~0))) (let ((.cse30 (+ .cse28 1)) (.cse20 (+ c_~var_1_22~0 1 .cse42)) (.cse47 (+ c_~var_1_5~0 1)) (.cse10 (+ c_~var_1_22~0 .cse42)) (.cse7 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse0 (+ .cse1 c_~var_1_22~0))) (let ((.cse34 (forall ((~var_1_6~0 Int)) (or (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< 0 (+ ~var_1_6~0 1))))) (.cse18 (+ .cse1 c_~var_1_22~0 1)) (.cse39 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536))))) (.cse35 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (.cse43 (mod c_~var_1_28~0 4294967296)) (.cse25 (not .cse7)) (.cse23 (< .cse10 .cse28)) (.cse8 (< 0 .cse47)) (.cse29 (< .cse20 .cse28)) (.cse38 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse47) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (.cse37 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse47) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (.cse16 (< 0 (+ c_~var_1_22~0 1))) (.cse3 (< .cse10 .cse30)) (.cse22 (< c_~var_1_22~0 0)) (.cse44 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< ~var_1_6~0 0)))) (.cse46 (forall ((~var_1_6~0 Int)) (or (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (< ~var_1_6~0 0)))) (.cse36 (< .cse0 (+ .cse28 65537))) (.cse41 (forall ((~var_1_6~0 Int)) (or (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1))))) (.cse4 (< c_~var_1_5~0 0))) (and (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))) (or (< 32767 .cse1) (let ((.cse6 (forall ((~var_1_6~0 Int)) (let ((.cse33 (div c_~var_1_22~0 ~var_1_6~0))) (or (< 0 (+ ~var_1_6~0 1)) (< .cse0 .cse33) (< .cse10 .cse33))))) (.cse5 (forall ((~var_1_6~0 Int)) (let ((.cse32 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse32) (< .cse10 .cse32))))) (.cse24 (< .cse0 .cse28)) (.cse21 (forall ((~var_1_6~0 Int)) (let ((.cse31 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< .cse0 .cse31) (< .cse10 .cse31) (< ~var_1_6~0 0))))) (.cse2 (< .cse0 .cse30))) (and (or .cse2 .cse3 .cse4) (or (and .cse5 (or .cse6 .cse7)) .cse8) (forall ((~var_1_6~0 Int)) (let ((.cse9 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse9) (< .cse10 .cse9)))) (forall ((~var_1_6~0 Int)) (let ((.cse11 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< 0 (+ ~var_1_6~0 1)) (< .cse0 .cse11) (< .cse10 .cse11)))) (forall ((~var_1_6~0 Int)) (let ((.cse12 (div c_~var_1_22~0 ~var_1_6~0))) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse0 .cse12) (< .cse10 .cse12)))) (or .cse6 .cse4) (forall ((~var_1_6~0 Int)) (let ((.cse13 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 .cse13) (< .cse10 .cse13)))) (forall ((~var_1_6~0 Int)) (let ((.cse14 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse14) (< .cse10 .cse14) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (let ((.cse15 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 .cse15) (< .cse10 .cse15) (< ~var_1_6~0 0)))) (or .cse16 (forall ((~var_1_6~0 Int)) (let ((.cse17 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse17) (< .cse10 .cse17) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (or .cse16 (forall ((~var_1_6~0 Int)) (let ((.cse19 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse18 .cse19) (< 0 (+ ~var_1_6~0 1)) (< .cse20 .cse19) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (or .cse21 .cse2 .cse3 .cse7) (or .cse5 .cse22) (or .cse23 .cse21 .cse8 .cse24) (or .cse6 .cse4 .cse25) (or .cse23 .cse25 .cse24) (or (forall ((~var_1_6~0 Int)) (let ((.cse26 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse26) (< .cse10 .cse26) (< ~var_1_6~0 0)))) .cse22) (or .cse8 .cse5) (or .cse16 (forall ((~var_1_6~0 Int)) (let ((.cse27 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse27) (< .cse10 .cse27) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (or .cse23 .cse22 .cse24) (or .cse21 .cse2 .cse3) (or .cse16 (< .cse18 .cse28) .cse8 .cse7 .cse29)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)))) (or .cse34 .cse4) (or .cse34 .cse4 .cse25) (or .cse16 (and .cse35 (or .cse36 .cse37) (or .cse36 .cse38) (or (forall ((~var_1_6~0 Int)) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537))) .cse36) (or .cse4 .cse36 .cse38))) (or .cse39 .cse22) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (< ~var_1_6~0 0))) (or (let ((.cse40 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))))) (and .cse34 (or .cse16 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse16 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse40 .cse22) .cse41 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse16 (forall ((~var_1_6~0 Int)) (or (< .cse18 (div c_~var_1_22~0 ~var_1_6~0)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or .cse40 .cse8) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))))) (< .cse42 .cse43)) (or .cse39 .cse8) (or .cse16 .cse35) (or .cse25 (< .cse0 (+ 65536 .cse28))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< 0 (+ ~var_1_6~0 1)))) (or .cse44 .cse22) (or (< .cse43 (+ 1 .cse42)) (let ((.cse45 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))))) (and (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) .cse22) (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (or .cse23 .cse25) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse23 .cse22) (or .cse8 .cse45) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or .cse16 .cse8 .cse7 .cse29) (or .cse16 (and (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))) (or .cse3 .cse38) (or .cse3 .cse4 .cse38) (or .cse3 .cse37) (or .cse3 (forall ((~var_1_6~0 Int)) (or (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))))) (or .cse16 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) .cse4) (or .cse3 (forall ((~var_1_6~0 Int)) (or (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))) (or .cse22 .cse45) (or .cse16 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse20 (div c_~var_1_22~0 ~var_1_6~0)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse3 .cse4)))) (or .cse46 .cse7 .cse36) (or .cse22 (and .cse44 (<= .cse0 (+ .cse28 65535)))) (or .cse46 .cse36) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))) (or .cse4 .cse36) (or .cse41 .cse4))))) is different from false [2024-10-11 12:17:31,494 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse27 (mod c_~var_1_8~0 256))) (let ((.cse3 (mod c_~var_1_28~0 65536)) (.cse10 (+ c_~var_1_22~0 .cse27)) (.cse7 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse19 (+ c_~var_1_22~0 1 .cse27)) (.cse5 (div c_~var_1_22~0 c_~var_1_5~0))) (let ((.cse8 (< .cse19 .cse5)) (.cse22 (not .cse7)) (.cse21 (< .cse10 .cse5)) (.cse1 (< c_~var_1_22~0 0)) (.cse2 (< 0 (+ c_~var_1_22~0 1))) (.cse4 (+ .cse3 c_~var_1_22~0 1)) (.cse6 (< 0 (+ c_~var_1_5~0 1))) (.cse26 (mod c_~var_1_28~0 4294967296)) (.cse0 (+ .cse3 c_~var_1_22~0))) (and (forall ((~var_1_6~0 Int)) (or (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< 0 (+ ~var_1_6~0 1)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)))) (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)))) .cse1) (forall ((~var_1_6~0 Int)) (or (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (< ~var_1_6~0 0))) (or .cse2 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or (< 32767 .cse3) (let ((.cse20 (forall ((~var_1_6~0 Int)) (let ((.cse25 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse25) (< .cse10 .cse25))))) (.cse23 (< .cse0 .cse5))) (and (or (< .cse4 .cse5) .cse6 .cse7 .cse8) (forall ((~var_1_6~0 Int)) (let ((.cse9 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse9) (< .cse10 .cse9)))) (forall ((~var_1_6~0 Int)) (let ((.cse11 (div c_~var_1_22~0 ~var_1_6~0))) (or (< 0 (+ ~var_1_6~0 1)) (< .cse0 .cse11) (< .cse10 .cse11)))) (forall ((~var_1_6~0 Int)) (let ((.cse12 (div c_~var_1_22~0 ~var_1_6~0))) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse0 .cse12) (< .cse10 .cse12)))) (forall ((~var_1_6~0 Int)) (let ((.cse13 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 .cse13) (< .cse10 .cse13)))) (forall ((~var_1_6~0 Int)) (let ((.cse14 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse14) (< .cse10 .cse14) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (let ((.cse15 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 .cse15) (< .cse10 .cse15) (< ~var_1_6~0 0)))) (or .cse2 (forall ((~var_1_6~0 Int)) (let ((.cse16 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse16) (< .cse10 .cse16) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (let ((.cse17 (+ .cse5 1))) (or (< .cse0 .cse17) (< .cse10 .cse17))) (or .cse2 (forall ((~var_1_6~0 Int)) (let ((.cse18 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse4 .cse18) (< 0 (+ ~var_1_6~0 1)) (< .cse19 .cse18) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (or .cse20 .cse1) (or .cse21 .cse22 .cse23) (or .cse6 .cse20) (or .cse2 (forall ((~var_1_6~0 Int)) (let ((.cse24 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 .cse24) (< .cse10 .cse24) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (or .cse21 .cse1 .cse23)))) (or (< .cse26 (+ 1 .cse27)) (let ((.cse28 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))))) (and (or .cse6 .cse7 .cse8) (or .cse2 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse21 .cse22) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse21 .cse1) (<= .cse10 .cse5) (or .cse6 .cse28) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or .cse2 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))) (or .cse1 .cse28) (or .cse2 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse19 (div c_~var_1_22~0 ~var_1_6~0)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))))) (or (let ((.cse29 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))))) (and (or .cse2 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse2 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse29 .cse1) (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse2 (forall ((~var_1_6~0 Int)) (or (< .cse4 (div c_~var_1_22~0 ~var_1_6~0)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or .cse29 .cse6) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))))) (< .cse27 .cse26)) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))))))) is different from false