./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-40.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2274e339d27706db1309e66a8dc56713dc7b235e9296f50d0c5bcd9c8dae4a5d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:17:28,087 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:17:28,162 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:17:28,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:17:28,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:17:28,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:17:28,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:17:28,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:17:28,215 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:17:28,216 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:17:28,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:17:28,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:17:28,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:17:28,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:17:28,217 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:17:28,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:17:28,218 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:17:28,218 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:17:28,218 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:17:28,219 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:17:28,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:17:28,219 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:17:28,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:17:28,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:17:28,220 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:17:28,220 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:17:28,221 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:17:28,221 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:17:28,221 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:17:28,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:17:28,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:17:28,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:17:28,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:17:28,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:17:28,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:17:28,223 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:17:28,223 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:17:28,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:17:28,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:17:28,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:17:28,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:17:28,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:17:28,225 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2274e339d27706db1309e66a8dc56713dc7b235e9296f50d0c5bcd9c8dae4a5d [2024-11-19 01:17:28,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:17:28,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:17:28,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:17:28,600 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:17:28,600 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:17:28,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-40.i [2024-11-19 01:17:30,353 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:17:30,704 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:17:30,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-40.i [2024-11-19 01:17:30,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67207d2b5/8760122ea2bb4e198f38f3aee80d4524/FLAG6446feb1a [2024-11-19 01:17:30,988 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67207d2b5/8760122ea2bb4e198f38f3aee80d4524 [2024-11-19 01:17:30,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:17:30,993 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:17:30,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:17:30,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:17:31,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:17:31,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:17:30" (1/1) ... [2024-11-19 01:17:31,002 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42c09585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:31, skipping insertion in model container [2024-11-19 01:17:31,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:17:30" (1/1) ... [2024-11-19 01:17:31,050 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:17:31,327 WARN L250 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_variablewrapping_wrapper-sp_file-40.i[917,930] [2024-11-19 01:17:31,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:17:31,460 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:17:31,483 WARN L250 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_variablewrapping_wrapper-sp_file-40.i[917,930] [2024-11-19 01:17:31,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:17:31,627 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:17:31,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:31 WrapperNode [2024-11-19 01:17:31,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:17:31,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:17:31,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:17:31,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:17:31,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:31" (1/1) ... [2024-11-19 01:17:31,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:31" (1/1) ... [2024-11-19 01:17:31,753 INFO L138 Inliner]: procedures = 30, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 481 [2024-11-19 01:17:31,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:17:31,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:17:31,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:17:31,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:17:31,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:31" (1/1) ... [2024-11-19 01:17:31,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:31" (1/1) ... [2024-11-19 01:17:31,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:31" (1/1) ... [2024-11-19 01:17:31,788 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-19 01:17:31,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:31" (1/1) ... [2024-11-19 01:17:31,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:31" (1/1) ... [2024-11-19 01:17:31,811 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:31" (1/1) ... [2024-11-19 01:17:31,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:31" (1/1) ... [2024-11-19 01:17:31,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:31" (1/1) ... [2024-11-19 01:17:31,829 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:31" (1/1) ... [2024-11-19 01:17:31,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:17:31,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:17:31,843 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:17:31,843 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:17:31,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:31" (1/1) ... [2024-11-19 01:17:31,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:17:31,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:17:31,891 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:17:31,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:17:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:17:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-19 01:17:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-19 01:17:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-19 01:17:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 01:17:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-19 01:17:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 01:17:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:17:31,956 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:17:31,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 01:17:31,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:17:31,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:17:32,053 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:17:32,059 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:17:32,675 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-19 01:17:32,678 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:17:32,694 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:17:32,694 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:17:32,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:17:32 BoogieIcfgContainer [2024-11-19 01:17:32,695 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:17:32,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:17:32,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:17:32,699 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:17:32,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:17:30" (1/3) ... [2024-11-19 01:17:32,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fafd03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:17:32, skipping insertion in model container [2024-11-19 01:17:32,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:17:31" (2/3) ... [2024-11-19 01:17:32,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fafd03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:17:32, skipping insertion in model container [2024-11-19 01:17:32,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:17:32" (3/3) ... [2024-11-19 01:17:32,701 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-40.i [2024-11-19 01:17:32,716 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:17:32,716 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:17:32,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:17:32,780 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;@5e41be51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:17:32,780 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:17:32,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 01:17:32,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:17:32,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:17:32,798 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:17:32,798 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:17:32,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:17:32,803 INFO L85 PathProgramCache]: Analyzing trace with hash 233507973, now seen corresponding path program 1 times [2024-11-19 01:17:32,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:17:32,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933454762] [2024-11-19 01:17:32,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:17:32,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:17:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:17:33,350 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-19 01:17:33,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:17:33,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933454762] [2024-11-19 01:17:33,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933454762] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:17:33,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251198673] [2024-11-19 01:17:33,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:17:33,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:17:33,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:17:33,362 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:17:33,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 01:17:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:17:33,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:17:33,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:17:33,756 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-19 01:17:33,756 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:17:33,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251198673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:17:33,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:17:33,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 01:17:33,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529498025] [2024-11-19 01:17:33,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:17:33,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:17:33,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:17:33,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:17:33,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:17:33,788 INFO L87 Difference]: Start difference. First operand has 113 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-19 01:17:33,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:17:33,835 INFO L93 Difference]: Finished difference Result 219 states and 347 transitions. [2024-11-19 01:17:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:17:33,838 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2024-11-19 01:17:33,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:17:33,849 INFO L225 Difference]: With dead ends: 219 [2024-11-19 01:17:33,850 INFO L226 Difference]: Without dead ends: 109 [2024-11-19 01:17:33,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:17:33,860 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:17:33,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:17:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-19 01:17:33,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-19 01:17:33,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 01:17:33,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 160 transitions. [2024-11-19 01:17:33,949 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 160 transitions. Word has length 150 [2024-11-19 01:17:33,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:17:33,949 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 160 transitions. [2024-11-19 01:17:33,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-19 01:17:33,950 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 160 transitions. [2024-11-19 01:17:33,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:17:33,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:17:33,957 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:17:33,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 01:17:34,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 01:17:34,159 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:17:34,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:17:34,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1098795479, now seen corresponding path program 1 times [2024-11-19 01:17:34,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:17:34,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752277642] [2024-11-19 01:17:34,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:17:34,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:17:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:17:34,497 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:17:34,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:17:34,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752277642] [2024-11-19 01:17:34,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752277642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:17:34,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:17:34,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:17:34,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908120929] [2024-11-19 01:17:34,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:17:34,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:17:34,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:17:34,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:17:34,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:17:34,502 INFO L87 Difference]: Start difference. First operand 109 states and 160 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-19 01:17:34,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:17:34,547 INFO L93 Difference]: Finished difference Result 217 states and 320 transitions. [2024-11-19 01:17:34,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:17:34,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2024-11-19 01:17:34,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:17:34,549 INFO L225 Difference]: With dead ends: 217 [2024-11-19 01:17:34,549 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 01:17:34,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:17:34,554 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:17:34,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 463 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:17:34,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 01:17:34,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-19 01:17:34,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 01:17:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 162 transitions. [2024-11-19 01:17:34,570 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 162 transitions. Word has length 150 [2024-11-19 01:17:34,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:17:34,573 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 162 transitions. [2024-11-19 01:17:34,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-19 01:17:34,573 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 162 transitions. [2024-11-19 01:17:34,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:17:34,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:17:34,577 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:17:34,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:17:34,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:17:34,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:17:34,577 INFO L85 PathProgramCache]: Analyzing trace with hash -862779179, now seen corresponding path program 1 times [2024-11-19 01:17:34,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:17:34,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442911342] [2024-11-19 01:17:34,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:17:34,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:17:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:17:34,949 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-19 01:17:34,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:17:34,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442911342] [2024-11-19 01:17:34,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442911342] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:17:34,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337236533] [2024-11-19 01:17:34,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:17:34,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:17:34,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:17:34,957 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:17:34,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 01:17:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:17:35,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:17:35,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:17:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:17:35,304 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:17:35,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337236533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:17:35,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:17:35,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 01:17:35,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053434677] [2024-11-19 01:17:35,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:17:35,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:17:35,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:17:35,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:17:35,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:17:35,306 INFO L87 Difference]: Start difference. First operand 111 states and 162 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:17:35,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:17:35,331 INFO L93 Difference]: Finished difference Result 222 states and 325 transitions. [2024-11-19 01:17:35,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:17:35,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-11-19 01:17:35,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:17:35,333 INFO L225 Difference]: With dead ends: 222 [2024-11-19 01:17:35,333 INFO L226 Difference]: Without dead ends: 114 [2024-11-19 01:17:35,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:17:35,335 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:17:35,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 460 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:17:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-19 01:17:35,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-19 01:17:35,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 01:17:35,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 164 transitions. [2024-11-19 01:17:35,343 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 164 transitions. Word has length 150 [2024-11-19 01:17:35,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:17:35,344 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 164 transitions. [2024-11-19 01:17:35,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:17:35,344 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 164 transitions. [2024-11-19 01:17:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:17:35,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:17:35,346 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:17:35,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 01:17:35,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-19 01:17:35,547 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:17:35,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:17:35,548 INFO L85 PathProgramCache]: Analyzing trace with hash -182720809, now seen corresponding path program 1 times [2024-11-19 01:17:35,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:17:35,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761796122] [2024-11-19 01:17:35,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:17:35,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:17:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:17:35,782 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-19 01:17:35,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:17:35,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761796122] [2024-11-19 01:17:35,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761796122] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:17:35,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424124473] [2024-11-19 01:17:35,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:17:35,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:17:35,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:17:35,784 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:17:35,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 01:17:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:17:35,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:17:36,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:17:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:17:36,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:17:36,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424124473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:17:36,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:17:36,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 01:17:36,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290783162] [2024-11-19 01:17:36,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:17:36,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:17:36,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:17:36,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:17:36,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:17:36,039 INFO L87 Difference]: Start difference. First operand 113 states and 164 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:17:36,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:17:36,063 INFO L93 Difference]: Finished difference Result 226 states and 329 transitions. [2024-11-19 01:17:36,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:17:36,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-11-19 01:17:36,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:17:36,065 INFO L225 Difference]: With dead ends: 226 [2024-11-19 01:17:36,065 INFO L226 Difference]: Without dead ends: 116 [2024-11-19 01:17:36,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:17:36,067 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:17:36,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 461 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:17:36,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-19 01:17:36,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-19 01:17:36,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 01:17:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 166 transitions. [2024-11-19 01:17:36,073 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 166 transitions. Word has length 150 [2024-11-19 01:17:36,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:17:36,074 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 166 transitions. [2024-11-19 01:17:36,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:17:36,074 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 166 transitions. [2024-11-19 01:17:36,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 01:17:36,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:17:36,076 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:17:36,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 01:17:36,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:17:36,277 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:17:36,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:17:36,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1592286553, now seen corresponding path program 1 times [2024-11-19 01:17:36,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:17:36,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391470029] [2024-11-19 01:17:36,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:17:36,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:17:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:17:36,477 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-19 01:17:36,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:17:36,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391470029] [2024-11-19 01:17:36,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391470029] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:17:36,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235319702] [2024-11-19 01:17:36,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:17:36,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:17:36,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:17:36,480 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:17:36,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 01:17:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:17:36,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:17:36,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:17:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:17:36,719 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:17:36,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235319702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:17:36,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:17:36,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-19 01:17:36,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119466791] [2024-11-19 01:17:36,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:17:36,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:17:36,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:17:36,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:17:36,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:17:36,721 INFO L87 Difference]: Start difference. First operand 115 states and 166 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:17:36,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:17:36,745 INFO L93 Difference]: Finished difference Result 229 states and 332 transitions. [2024-11-19 01:17:36,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:17:36,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-11-19 01:17:36,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:17:36,747 INFO L225 Difference]: With dead ends: 229 [2024-11-19 01:17:36,749 INFO L226 Difference]: Without dead ends: 117 [2024-11-19 01:17:36,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:17:36,750 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:17:36,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 463 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:17:36,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-19 01:17:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-19 01:17:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 96 states have internal predecessors, (130), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 01:17:36,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 168 transitions. [2024-11-19 01:17:36,758 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 168 transitions. Word has length 150 [2024-11-19 01:17:36,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:17:36,758 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 168 transitions. [2024-11-19 01:17:36,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:17:36,758 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 168 transitions. [2024-11-19 01:17:36,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-19 01:17:36,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:17:36,760 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:17:36,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 01:17:36,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:17:36,962 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:17:36,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:17:36,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1896254832, now seen corresponding path program 1 times [2024-11-19 01:17:36,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:17:36,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953211270] [2024-11-19 01:17:36,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:17:36,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:17:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:17:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:17:39,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:17:39,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953211270] [2024-11-19 01:17:39,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953211270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:17:39,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:17:39,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 01:17:39,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659994693] [2024-11-19 01:17:39,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:17:39,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 01:17:39,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:17:39,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 01:17:39,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:17:39,623 INFO L87 Difference]: Start difference. First operand 117 states and 168 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:17:40,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:17:40,345 INFO L93 Difference]: Finished difference Result 284 states and 407 transitions. [2024-11-19 01:17:40,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:17:40,346 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-19 01:17:40,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:17:40,348 INFO L225 Difference]: With dead ends: 284 [2024-11-19 01:17:40,348 INFO L226 Difference]: Without dead ends: 170 [2024-11-19 01:17:40,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:17:40,349 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 170 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:17:40,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 840 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 01:17:40,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-19 01:17:40,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 140. [2024-11-19 01:17:40,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 119 states have internal predecessors, (164), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 01:17:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 202 transitions. [2024-11-19 01:17:40,381 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 202 transitions. Word has length 153 [2024-11-19 01:17:40,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:17:40,382 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 202 transitions. [2024-11-19 01:17:40,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:17:40,387 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 202 transitions. [2024-11-19 01:17:40,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-19 01:17:40,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:17:40,388 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:17:40,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:17:40,389 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:17:40,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:17:40,390 INFO L85 PathProgramCache]: Analyzing trace with hash 875186478, now seen corresponding path program 1 times [2024-11-19 01:17:40,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:17:40,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865328077] [2024-11-19 01:17:40,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:17:40,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:17:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:17:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:17:47,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:17:47,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865328077] [2024-11-19 01:17:47,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865328077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:17:47,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:17:47,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 01:17:47,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485214603] [2024-11-19 01:17:47,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:17:47,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 01:17:47,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:17:47,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 01:17:47,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:17:47,459 INFO L87 Difference]: Start difference. First operand 140 states and 202 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:17:51,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:17:51,399 INFO L93 Difference]: Finished difference Result 332 states and 478 transitions. [2024-11-19 01:17:51,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:17:51,401 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-19 01:17:51,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:17:51,407 INFO L225 Difference]: With dead ends: 332 [2024-11-19 01:17:51,409 INFO L226 Difference]: Without dead ends: 195 [2024-11-19 01:17:51,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:17:51,411 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 295 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:17:51,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 581 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 01:17:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-19 01:17:51,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 159. [2024-11-19 01:17:51,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 138 states have (on average 1.3985507246376812) internal successors, (193), 138 states have internal predecessors, (193), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 01:17:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 231 transitions. [2024-11-19 01:17:51,450 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 231 transitions. Word has length 153 [2024-11-19 01:17:51,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:17:51,451 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 231 transitions. [2024-11-19 01:17:51,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:17:51,455 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 231 transitions. [2024-11-19 01:17:51,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-19 01:17:51,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:17:51,457 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:17:51,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:17:51,457 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:17:51,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:17:51,458 INFO L85 PathProgramCache]: Analyzing trace with hash 404026054, now seen corresponding path program 1 times [2024-11-19 01:17:51,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:17:51,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607686262] [2024-11-19 01:17:51,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:17:51,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:17:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:17:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-19 01:17:51,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:17:51,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607686262] [2024-11-19 01:17:51,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607686262] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:17:51,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994101186] [2024-11-19 01:17:51,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:17:51,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:17:51,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:17:51,929 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:17:51,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 01:17:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:17:52,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:17:52,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:17:52,415 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-19 01:17:52,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:17:52,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994101186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:17:52,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:17:52,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-19 01:17:52,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778122900] [2024-11-19 01:17:52,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:17:52,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:17:52,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:17:52,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:17:52,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:17:52,421 INFO L87 Difference]: Start difference. First operand 159 states and 231 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:17:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:17:52,460 INFO L93 Difference]: Finished difference Result 324 states and 471 transitions. [2024-11-19 01:17:52,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:17:52,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-19 01:17:52,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:17:52,462 INFO L225 Difference]: With dead ends: 324 [2024-11-19 01:17:52,462 INFO L226 Difference]: Without dead ends: 168 [2024-11-19 01:17:52,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:17:52,464 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:17:52,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:17:52,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-19 01:17:52,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 162. [2024-11-19 01:17:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 141 states have (on average 1.3900709219858156) internal successors, (196), 141 states have internal predecessors, (196), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 01:17:52,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2024-11-19 01:17:52,477 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 153 [2024-11-19 01:17:52,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:17:52,477 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2024-11-19 01:17:52,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-19 01:17:52,477 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2024-11-19 01:17:52,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-19 01:17:52,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:17:52,479 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:17:52,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 01:17:52,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:17:52,680 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:17:52,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:17:52,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2036803442, now seen corresponding path program 1 times [2024-11-19 01:17:52,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:17:52,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834965854] [2024-11-19 01:17:52,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:17:52,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:17:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-19 01:18:04,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:18:04,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834965854] [2024-11-19 01:18:04,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834965854] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:18:04,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994144352] [2024-11-19 01:18:04,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:04,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:18:04,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:18:04,888 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:18:04,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 01:18:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:05,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-19 01:18:05,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:05,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 1 [2024-11-19 01:18:05,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 01:18:06,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 01:18:07,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 01:18:08,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 01:18:10,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-19 01:18:11,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-19 01:18:11,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-19 01:18:12,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-19 01:18:12,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-19 01:18:13,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2024-11-19 01:18:15,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:18:15,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:18:15,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:18:15,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:18:15,761 INFO L349 Elim1Store]: treesize reduction 73, result has 8.8 percent of original size [2024-11-19 01:18:15,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 1718 treesize of output 829 [2024-11-19 01:18:18,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:18:18,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:18:18,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:18:18,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:18:18,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:18:18,431 INFO L349 Elim1Store]: treesize reduction 81, result has 15.6 percent of original size [2024-11-19 01:18:18,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 265 treesize of output 152 [2024-11-19 01:18:19,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 111 [2024-11-19 01:18:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 286 proven. 157 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-19 01:18:21,229 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:18:55,522 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse18 (div |c_ULTIMATE.start_step_#t~mem21#1| |c_ULTIMATE.start_step_#t~mem22#1|))) (let ((.cse16 (+ .cse18 1)) (.cse0 (div |c_ULTIMATE.start_step_#t~mem21#1| |c_ULTIMATE.start_step_#t~mem22#1| |c_ULTIMATE.start_step_#t~mem23#1|)) (.cse5 (= (mod |c_ULTIMATE.start_step_#t~mem21#1| |c_ULTIMATE.start_step_#t~mem22#1|) 0)) (.cse17 (+ |c_ULTIMATE.start_step_#t~mem21#1| 1))) (let ((.cse13 (and (not .cse5) (<= .cse17 0))) (.cse15 (< |c_ULTIMATE.start_step_#t~bitwise26#1| (+ .cse0 1))) (.cse1 (= (mod .cse18 |c_ULTIMATE.start_step_#t~mem23#1|) 0)) (.cse9 (div .cse16 |c_ULTIMATE.start_step_#t~mem23#1|))) (let ((.cse4 (< |c_ULTIMATE.start_step_#t~mem22#1| 0)) (.cse10 (< |c_ULTIMATE.start_step_#t~bitwise26#1| (+ .cse9 1))) (.cse8 (= (mod .cse16 |c_ULTIMATE.start_step_#t~mem23#1|) 0)) (.cse6 (+ 2 .cse18)) (.cse14 (and (<= .cse16 0) (not .cse1))) (.cse11 (div (+ (- 1) .cse18) |c_ULTIMATE.start_step_#t~mem23#1|)) (.cse7 (< 0 .cse17)) (.cse3 (or .cse13 .cse15)) (.cse12 (< |c_ULTIMATE.start_step_#t~bitwise26#1| (+ 2 .cse0))) (.cse2 (< 0 .cse16))) (and (or (and (or (< |c_ULTIMATE.start_step_#t~bitwise26#1| .cse0) .cse1 .cse2) .cse3 (or .cse4 (and (or .cse5 (< 0 .cse6) .cse7 .cse8 (< |c_ULTIMATE.start_step_#t~bitwise26#1| .cse9)) (or .cse5 .cse7 .cse10))) (<= |c_ULTIMATE.start_step_#t~bitwise26#1| .cse11)) (< 0 (+ |c_ULTIMATE.start_step_#t~mem23#1| 1))) (or .cse4 (and (or .cse12 .cse13) (or .cse5 .cse7 .cse10 (and (not .cse8) (<= .cse6 0))) (or .cse14 .cse13 .cse15) (or .cse5 (< |c_ULTIMATE.start_step_#t~bitwise26#1| (+ .cse9 2)) .cse7))) (or (< 0 (+ |c_ULTIMATE.start_step_#t~mem22#1| 1)) (and (or .cse14 (and (or (< |c_ULTIMATE.start_step_#t~bitwise26#1| (+ 1 .cse11)) .cse5 .cse7) .cse3)) (or .cse12 .cse2)))))))) (let ((.cse26 (select |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base))) (and (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (v_ArrVal_1599 Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse24 (let ((.cse25 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse26 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset))))) (store .cse25 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse25 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_1599))))) (let ((.cse21 (select (select .cse24 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset)) (.cse22 (select (select .cse24 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (let ((.cse23 (div .cse21 .cse22))) (let ((.cse19 (+ .cse23 1)) (.cse20 (select (select .cse24 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset))) (or (= (mod .cse19 .cse20) 0) (< 0 (+ .cse21 1)) (= (mod .cse21 .cse22) 0) (< (+ (div .cse19 .cse20) 1) .cse21) (< 0 (+ 2 .cse23)))))))) (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (v_ArrVal_1599 Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse30 (let ((.cse31 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse26 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset))))) (store .cse31 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse31 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_1599))))) (let ((.cse29 (select (select .cse30 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset)) (.cse28 (select (select .cse30 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (let ((.cse27 (div .cse29 .cse28))) (or (< .cse27 0) (= .cse27 0) (< 0 (+ .cse28 1)) (= (mod .cse29 .cse28) 0) (< (div (+ (- 1) .cse27) (select (select .cse30 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset)) .cse29)))))) (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (v_ArrVal_1599 Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse36 (let ((.cse37 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse26 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset))))) (store .cse37 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse37 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_1599))))) (let ((.cse32 (select (select .cse36 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset)) (.cse33 (select (select .cse36 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (let ((.cse35 (div .cse32 .cse33)) (.cse34 (select (select .cse36 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset))) (or (< .cse32 0) (< (+ (div .cse32 .cse33 .cse34) 1) .cse32) (< 0 (+ .cse35 1)) (= (mod .cse35 .cse34) 0) (< .cse34 0)))))) (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (v_ArrVal_1599 Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse40 (let ((.cse41 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse26 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset))))) (store .cse41 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse41 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_1599))))) (let ((.cse39 (select (select .cse40 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) (.cse38 (select (select .cse40 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset))) (or (< .cse38 0) (< (div .cse38 .cse39) 0) (< (div .cse38 .cse39 (select (select .cse40 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset)) .cse38))))) (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (v_ArrVal_1599 Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse44 (let ((.cse45 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse26 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset))))) (store .cse45 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse45 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_1599))))) (let ((.cse43 (select (select .cse44 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) (.cse42 (select (select .cse44 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset))) (or (< (div .cse42 .cse43) 0) (not (= (mod .cse42 .cse43) 0)) (< (div .cse42 .cse43 (select (select .cse44 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset)) .cse42))))) (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (v_ArrVal_1599 Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse50 (let ((.cse51 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse26 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset))))) (store .cse51 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse51 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_1599))))) (let ((.cse46 (select (select .cse50 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset)) (.cse47 (select (select .cse50 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (let ((.cse49 (div .cse46 .cse47)) (.cse48 (select (select .cse50 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset))) (or (< (+ (div .cse46 .cse47 .cse48) 1) .cse46) (< 0 (+ .cse49 1)) (not (= (mod .cse46 .cse47) 0)) (= (mod .cse49 .cse48) 0) (< .cse48 0)))))) (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (v_ArrVal_1599 Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse55 (let ((.cse56 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse26 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset))))) (store .cse56 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse56 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_1599))))) (let ((.cse52 (select (select .cse55 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) (.cse54 (select (select .cse55 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset)) (.cse53 (select (select .cse55 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset))) (or (< .cse52 0) (< (div (+ (div .cse53 .cse52) 1) .cse54) .cse53) (< (div .cse53 .cse52 .cse54) (+ .cse53 1)))))) (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (v_ArrVal_1599 Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse60 (let ((.cse61 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse26 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset))))) (store .cse61 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse61 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_1599))))) (let ((.cse58 (select (select .cse60 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) (.cse59 (select (select .cse60 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset)) (.cse57 (select (select .cse60 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset))) (or (not (= (mod .cse57 .cse58) 0)) (not (= (mod (div .cse57 .cse58) .cse59) 0)) (< (div .cse57 .cse58 .cse59) .cse57))))) (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (v_ArrVal_1599 Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse65 (let ((.cse66 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse26 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset))))) (store .cse66 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse66 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_1599))))) (let ((.cse63 (select (select .cse65 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) (.cse64 (select (select .cse65 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset)) (.cse62 (select (select .cse65 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset))) (or (< .cse62 0) (not (= (mod (div .cse62 .cse63) .cse64) 0)) (< (div .cse62 .cse63 .cse64) .cse62))))) (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (v_ArrVal_1599 Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse69 (let ((.cse70 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse26 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset))))) (store .cse70 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse70 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_1599))))) (let ((.cse68 (select (select .cse69 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) (.cse67 (select (select .cse69 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset))) (or (< 0 (+ .cse67 1)) (< .cse68 0) (= (mod .cse67 .cse68) 0) (< (div (+ (div .cse67 .cse68) 1) (select (select .cse69 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset)) .cse67)))))))) is different from true [2024-11-19 01:19:00,983 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse3 (div |c_ULTIMATE.start_step_#t~mem21#1| |c_ULTIMATE.start_step_#t~mem22#1|))) (let ((.cse1 (= (mod |c_ULTIMATE.start_step_#t~mem21#1| |c_ULTIMATE.start_step_#t~mem22#1|) 0)) (.cse14 (+ |c_ULTIMATE.start_step_#t~mem21#1| 1)) (.cse13 (+ .cse3 1)) (.cse11 (= (mod .cse3 |c_ULTIMATE.start_step_#t~mem23#1|) 0)) (.cse12 (div |c_ULTIMATE.start_step_#t~mem21#1| |c_ULTIMATE.start_step_#t~mem22#1| |c_ULTIMATE.start_step_#t~mem23#1|))) (let ((.cse6 (< |c_ULTIMATE.start_step_#t~mem25#1| (+ 2 .cse12))) (.cse0 (and (<= .cse13 0) (not .cse11))) (.cse4 (< |c_ULTIMATE.start_step_#t~mem25#1| (+ .cse12 1))) (.cse5 (and (not .cse1) (<= .cse14 0))) (.cse9 (+ 2 .cse3)) (.cse2 (< 0 .cse14)) (.cse10 (div .cse13 |c_ULTIMATE.start_step_#t~mem23#1|)) (.cse8 (= (mod .cse13 |c_ULTIMATE.start_step_#t~mem23#1|) 0)) (.cse7 (< 0 .cse13))) (and (or (< 0 (+ |c_ULTIMATE.start_step_#t~mem22#1| 1)) (and (or .cse0 (and (or .cse1 .cse2 (< |c_ULTIMATE.start_step_#t~mem25#1| (+ 1 (div (+ (- 1) .cse3) |c_ULTIMATE.start_step_#t~mem23#1|)))) (or .cse4 .cse5))) (or .cse6 .cse7))) (or (and (or .cse1 .cse2 (and (not .cse8) (<= .cse9 0)) (< |c_ULTIMATE.start_step_#t~mem25#1| (+ .cse10 1))) (or .cse6 .cse5) (or .cse1 .cse2 (< |c_ULTIMATE.start_step_#t~mem25#1| (+ .cse10 2))) (or .cse0 .cse4 .cse5)) (< |c_ULTIMATE.start_step_#t~mem22#1| 0)) (or (and (or .cse1 (< 0 .cse9) .cse2 (< |c_ULTIMATE.start_step_#t~mem25#1| .cse10) .cse8) (or .cse11 .cse7 (< |c_ULTIMATE.start_step_#t~mem25#1| .cse12))) (< 0 (+ |c_ULTIMATE.start_step_#t~mem23#1| 1))))))) (let ((.cse22 (select |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base))) (and (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (v_ArrVal_1599 Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse20 (let ((.cse21 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse22 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset))))) (store .cse21 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse21 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_1599))))) (let ((.cse17 (select (select .cse20 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset)) (.cse18 (select (select .cse20 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (let ((.cse19 (div .cse17 .cse18))) (let ((.cse15 (+ .cse19 1)) (.cse16 (select (select .cse20 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset))) (or (= (mod .cse15 .cse16) 0) (< 0 (+ .cse17 1)) (= (mod .cse17 .cse18) 0) (< (+ (div .cse15 .cse16) 1) .cse17) (< 0 (+ 2 .cse19)))))))) (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (v_ArrVal_1599 Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse26 (let ((.cse27 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse22 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset))))) (store .cse27 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse27 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_1599))))) (let ((.cse25 (select (select .cse26 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset)) (.cse24 (select (select .cse26 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (let ((.cse23 (div .cse25 .cse24))) (or (< .cse23 0) (= .cse23 0) (< 0 (+ .cse24 1)) (= (mod .cse25 .cse24) 0) (< (div (+ (- 1) .cse23) (select (select .cse26 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset)) .cse25)))))) (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (v_ArrVal_1599 Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse32 (let ((.cse33 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse22 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset))))) (store .cse33 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse33 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_1599))))) (let ((.cse28 (select (select .cse32 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset)) (.cse29 (select (select .cse32 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (let ((.cse31 (div .cse28 .cse29)) (.cse30 (select (select .cse32 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset))) (or (< .cse28 0) (< (+ (div .cse28 .cse29 .cse30) 1) .cse28) (< 0 (+ .cse31 1)) (= (mod .cse31 .cse30) 0) (< .cse30 0)))))) (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (v_ArrVal_1599 Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse36 (let ((.cse37 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse22 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset))))) (store .cse37 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse37 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_1599))))) (let ((.cse35 (select (select .cse36 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) (.cse34 (select (select .cse36 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset))) (or (< .cse34 0) (< (div .cse34 .cse35) 0) (< (div .cse34 .cse35 (select (select .cse36 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset)) .cse34))))) (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (v_ArrVal_1599 Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse40 (let ((.cse41 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse22 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset))))) (store .cse41 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse41 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_1599))))) (let ((.cse39 (select (select .cse40 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) (.cse38 (select (select .cse40 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset))) (or (< (div .cse38 .cse39) 0) (not (= (mod .cse38 .cse39) 0)) (< (div .cse38 .cse39 (select (select .cse40 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset)) .cse38))))) (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (v_ArrVal_1599 Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse46 (let ((.cse47 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse22 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset))))) (store .cse47 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse47 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_1599))))) (let ((.cse42 (select (select .cse46 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset)) (.cse43 (select (select .cse46 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (let ((.cse45 (div .cse42 .cse43)) (.cse44 (select (select .cse46 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset))) (or (< (+ (div .cse42 .cse43 .cse44) 1) .cse42) (< 0 (+ .cse45 1)) (not (= (mod .cse42 .cse43) 0)) (= (mod .cse45 .cse44) 0) (< .cse44 0)))))) (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (v_ArrVal_1599 Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse51 (let ((.cse52 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse22 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset))))) (store .cse52 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse52 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_1599))))) (let ((.cse48 (select (select .cse51 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) (.cse50 (select (select .cse51 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset)) (.cse49 (select (select .cse51 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset))) (or (< .cse48 0) (< (div (+ (div .cse49 .cse48) 1) .cse50) .cse49) (< (div .cse49 .cse48 .cse50) (+ .cse49 1)))))) (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (v_ArrVal_1599 Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse56 (let ((.cse57 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse22 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset))))) (store .cse57 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse57 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_1599))))) (let ((.cse54 (select (select .cse56 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) (.cse55 (select (select .cse56 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset)) (.cse53 (select (select .cse56 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset))) (or (not (= (mod .cse53 .cse54) 0)) (not (= (mod (div .cse53 .cse54) .cse55) 0)) (< (div .cse53 .cse54 .cse55) .cse53))))) (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (v_ArrVal_1599 Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse61 (let ((.cse62 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse22 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset))))) (store .cse62 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse62 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_1599))))) (let ((.cse59 (select (select .cse61 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) (.cse60 (select (select .cse61 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset)) (.cse58 (select (select .cse61 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset))) (or (< .cse58 0) (not (= (mod (div .cse58 .cse59) .cse60) 0)) (< (div .cse58 .cse59 .cse60) .cse58))))) (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (v_ArrVal_1599 Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse65 (let ((.cse66 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse22 c_~WrapperStruct00_var_1_7_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset))))) (store .cse66 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse66 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_1599))))) (let ((.cse64 (select (select .cse65 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) (.cse63 (select (select .cse65 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset))) (or (< 0 (+ .cse63 1)) (< .cse64 0) (= (mod .cse63 .cse64) 0) (< (div (+ (div .cse63 .cse64) 1) (select (select .cse65 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset)) .cse63)))))))) is different from true