./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_loopvsstraightlinecode_100-1loop_file-87.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ed6472202ab653978e4712f35b92e520ad44b668238671ae7ccc9791eea984a7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:08:45,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:08:45,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:08:45,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:08:45,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:08:45,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:08:45,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:08:45,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:08:45,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:08:45,344 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:08:45,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:08:45,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:08:45,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:08:45,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:08:45,348 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:08:45,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:08:45,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:08:45,349 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:08:45,349 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:08:45,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:08:45,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:08:45,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:08:45,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:08:45,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:08:45,355 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:08:45,355 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:08:45,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:08:45,355 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:08:45,356 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:08:45,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:08:45,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:08:45,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:08:45,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:08:45,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:08:45,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:08:45,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:08:45,359 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:08:45,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:08:45,359 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:08:45,360 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:08:45,360 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:08:45,360 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:08:45,360 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 -> ed6472202ab653978e4712f35b92e520ad44b668238671ae7ccc9791eea984a7 [2024-11-10 07:08:45,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:08:45,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:08:45,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:08:45,627 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:08:45,627 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:08:45,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-87.i [2024-11-10 07:08:47,143 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:08:47,368 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:08:47,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-87.i [2024-11-10 07:08:47,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68781ea00/484f384398594b2bbbc4f5b291e13fe5/FLAGce8afb704 [2024-11-10 07:08:47,396 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68781ea00/484f384398594b2bbbc4f5b291e13fe5 [2024-11-10 07:08:47,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:08:47,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:08:47,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:08:47,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:08:47,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:08:47,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:08:47" (1/1) ... [2024-11-10 07:08:47,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e1b6796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:47, skipping insertion in model container [2024-11-10 07:08:47,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:08:47" (1/1) ... [2024-11-10 07:08:47,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:08:47,647 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_loopvsstraightlinecode_100-1loop_file-87.i[916,929] [2024-11-10 07:08:47,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:08:47,824 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:08:47,835 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_loopvsstraightlinecode_100-1loop_file-87.i[916,929] [2024-11-10 07:08:47,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:08:47,912 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:08:47,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:47 WrapperNode [2024-11-10 07:08:47,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:08:47,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:08:47,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:08:47,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:08:47,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:47" (1/1) ... [2024-11-10 07:08:47,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:47" (1/1) ... [2024-11-10 07:08:47,974 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 220 [2024-11-10 07:08:47,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:08:47,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:08:47,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:08:47,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:08:47,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:47" (1/1) ... [2024-11-10 07:08:47,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:47" (1/1) ... [2024-11-10 07:08:47,992 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:47" (1/1) ... [2024-11-10 07:08:48,031 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 07:08:48,031 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:47" (1/1) ... [2024-11-10 07:08:48,031 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:47" (1/1) ... [2024-11-10 07:08:48,052 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:47" (1/1) ... [2024-11-10 07:08:48,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:47" (1/1) ... [2024-11-10 07:08:48,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:47" (1/1) ... [2024-11-10 07:08:48,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:47" (1/1) ... [2024-11-10 07:08:48,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:08:48,080 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:08:48,081 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:08:48,081 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:08:48,082 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:47" (1/1) ... [2024-11-10 07:08:48,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:08:48,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:08:48,117 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-10 07:08:48,120 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-10 07:08:48,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:08:48,170 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:08:48,172 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:08:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:08:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:08:48,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:08:48,292 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:08:48,294 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:08:48,845 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-11-10 07:08:48,845 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:08:48,866 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:08:48,868 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:08:48,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:08:48 BoogieIcfgContainer [2024-11-10 07:08:48,869 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:08:48,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:08:48,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:08:48,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:08:48,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:08:47" (1/3) ... [2024-11-10 07:08:48,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608dc69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:08:48, skipping insertion in model container [2024-11-10 07:08:48,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:47" (2/3) ... [2024-11-10 07:08:48,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608dc69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:08:48, skipping insertion in model container [2024-11-10 07:08:48,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:08:48" (3/3) ... [2024-11-10 07:08:48,881 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-87.i [2024-11-10 07:08:48,900 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:08:48,900 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:08:48,985 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:08:48,994 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;@30e27877, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:08:48,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:08:49,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 59 states have internal predecessors, (78), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 07:08:49,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 07:08:49,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:08:49,020 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:08:49,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:08:49,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:08:49,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1800835428, now seen corresponding path program 1 times [2024-11-10 07:08:49,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:08:49,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881134334] [2024-11-10 07:08:49,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:08:49,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:08:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:08:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:08:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 07:08:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:08:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:08:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 07:08:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:08:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 07:08:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:08:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 07:08:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:08:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 07:08:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:08:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 07:08:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:08:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:08:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:08:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:08:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:08:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:08:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 07:08:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 07:08:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 07:08:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 07:08:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 07:08:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 07:08:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 07:08:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 07:08:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 07:08:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 07:08:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 07:08:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 07:08:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 07:08:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 07:08:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-10 07:08:49,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:08:49,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881134334] [2024-11-10 07:08:49,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881134334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:08:49,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:08:49,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:08:49,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81625937] [2024-11-10 07:08:49,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:08:49,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:08:49,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:08:49,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:08:49,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:08:49,835 INFO L87 Difference]: Start difference. First operand has 95 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 59 states have internal predecessors, (78), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-10 07:08:49,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:08:49,867 INFO L93 Difference]: Finished difference Result 186 states and 322 transitions. [2024-11-10 07:08:49,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:08:49,870 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 215 [2024-11-10 07:08:49,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:08:49,881 INFO L225 Difference]: With dead ends: 186 [2024-11-10 07:08:49,881 INFO L226 Difference]: Without dead ends: 90 [2024-11-10 07:08:49,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:08:49,892 INFO L432 NwaCegarLoop]: 142 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, 142 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-10 07:08:49,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:08:49,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-10 07:08:49,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-10 07:08:49,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 07:08:49,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 138 transitions. [2024-11-10 07:08:49,955 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 138 transitions. Word has length 215 [2024-11-10 07:08:49,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:08:49,955 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 138 transitions. [2024-11-10 07:08:49,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-10 07:08:49,956 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 138 transitions. [2024-11-10 07:08:49,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 07:08:49,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:08:49,961 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:08:49,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:08:49,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:08:49,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:08:49,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1585256008, now seen corresponding path program 1 times [2024-11-10 07:08:49,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:08:49,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114305000] [2024-11-10 07:08:49,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:08:49,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:08:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:08:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:08:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 07:08:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:08:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:08:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 07:08:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:08:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 07:08:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:08:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 07:08:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:08:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 07:08:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:08:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 07:08:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:08:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:08:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:08:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:08:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:08:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:08:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 07:08:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 07:08:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 07:08:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 07:08:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 07:08:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 07:08:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 07:08:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 07:08:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 07:08:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 07:08:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 07:08:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 07:08:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 07:08:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 07:08:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-11-10 07:08:51,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:08:51,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114305000] [2024-11-10 07:08:51,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114305000] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:08:51,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852272193] [2024-11-10 07:08:51,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:08:51,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:08:51,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:08:51,363 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-10 07:08:51,365 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-10 07:08:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:51,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 07:08:51,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:08:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1143 proven. 54 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2024-11-10 07:08:52,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:08:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-11-10 07:08:52,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852272193] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:08:52,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:08:52,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 07:08:52,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740203576] [2024-11-10 07:08:52,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:08:52,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:08:52,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:08:52,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:08:52,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:08:52,362 INFO L87 Difference]: Start difference. First operand 90 states and 138 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-11-10 07:08:52,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:08:52,724 INFO L93 Difference]: Finished difference Result 185 states and 280 transitions. [2024-11-10 07:08:52,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:08:52,740 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) Word has length 215 [2024-11-10 07:08:52,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:08:52,745 INFO L225 Difference]: With dead ends: 185 [2024-11-10 07:08:52,745 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 07:08:52,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 494 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:08:52,748 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 65 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 07:08:52,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 226 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 07:08:52,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 07:08:52,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2024-11-10 07:08:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 07:08:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 140 transitions. [2024-11-10 07:08:52,777 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 140 transitions. Word has length 215 [2024-11-10 07:08:52,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:08:52,778 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 140 transitions. [2024-11-10 07:08:52,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-11-10 07:08:52,779 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 140 transitions. [2024-11-10 07:08:52,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 07:08:52,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:08:52,783 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:08:52,800 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-10 07:08:52,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:08:52,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:08:52,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:08:52,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1356401591, now seen corresponding path program 1 times [2024-11-10 07:08:52,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:08:52,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174948625] [2024-11-10 07:08:52,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:08:52,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:08:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:08:53,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [948876631] [2024-11-10 07:08:53,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:08:53,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:08:53,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:08:53,547 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-10 07:08:53,550 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-10 07:08:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:08:53,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-10 07:08:53,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:09:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1549 proven. 282 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2024-11-10 07:09:04,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:09:09,715 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse26 (+ c_~var_1_22~0 1))) (let ((.cse7 (+ c_~var_1_5~0 1)) (.cse25 (div c_~var_1_22~0 c_~var_1_5~0)) (.cse8 (+ |c_ULTIMATE.start_step_~stepLocal_0~0#1| 1)) (.cse15 (<= .cse26 0)) (.cse5 (not .cse1))) (let ((.cse13 (< c_~var_1_22~0 0)) (.cse12 (and .cse15 .cse5)) (.cse0 (< 0 .cse26)) (.cse3 (not (= .cse25 .cse8))) (.cse9 (< 0 .cse7)) (.cse6 (not (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse25))) (.cse17 (not (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ .cse25 1)))) (.cse10 (< c_~var_1_5~0 0))) (and (or .cse0 (and (or (let ((.cse2 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse8)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (.cse4 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse7) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse1 (and .cse2 (or .cse3 .cse4))) (or .cse5 (and .cse2 (or .cse6 .cse4))))) .cse9) (or .cse10 (let ((.cse11 (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse8)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse5 .cse11) (or .cse1 .cse11)))))) (or .cse10 (let ((.cse14 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (not (= (div c_~var_1_22~0 ~var_1_6~0) |c_ULTIMATE.start_step_~stepLocal_0~0#1|)) (< ~var_1_6~0 0)))) (.cse16 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse7) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))))) (and (or .cse12 (and (or .cse13 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) |c_ULTIMATE.start_step_~stepLocal_0~0#1|)) (< ~var_1_6~0 0)))) .cse14 (or .cse6 (and .cse15 .cse16)))) (or .cse0 (and .cse14 (or .cse17 .cse16)) .cse1)))) (or .cse10 (let ((.cse18 (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (not (= (div c_~var_1_22~0 ~var_1_6~0) |c_ULTIMATE.start_step_~stepLocal_0~0#1|)))))) (and (or .cse0 .cse18 .cse1) (or (and (or .cse13 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (not (= (div c_~var_1_22~0 ~var_1_6~0) |c_ULTIMATE.start_step_~stepLocal_0~0#1|))))) .cse18) .cse12)))) (or .cse9 (let ((.cse19 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse7) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1))))) (.cse20 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (not (= (div c_~var_1_22~0 ~var_1_6~0) |c_ULTIMATE.start_step_~stepLocal_0~0#1|)))))) (and (or .cse12 (and (or .cse6 (and (or (= .cse7 0) .cse13) .cse19)) .cse20 (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) |c_ULTIMATE.start_step_~stepLocal_0~0#1|)))) .cse13))) (or .cse0 .cse1 (and (or .cse3 .cse19) .cse20))))) (or .cse9 (let ((.cse21 (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))))) (and (or .cse0 .cse21 .cse3 .cse1) (or .cse6 .cse12 (and .cse15 .cse21))))) (or .cse0 (and (or (let ((.cse22 (forall ((~var_1_6~0 Int)) (or (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (and (or .cse6 .cse22 .cse5) (or .cse22 .cse3 .cse1))) .cse9) (or (let ((.cse23 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse7) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (.cse24 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (and (or .cse5 (and (or .cse6 .cse23) .cse24)) (or .cse1 (and (or .cse17 .cse23) .cse24)))) .cse10))))))) is different from false [2024-11-10 07:09:14,891 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse27 (+ c_~var_1_22~0 1))) (let ((.cse22 (<= .cse27 0)) (.cse5 (not .cse2)) (.cse10 (+ c_~var_1_25~0 c_~var_1_22~0)) (.cse19 (+ c_~var_1_25~0 c_~var_1_22~0 1)) (.cse26 (div c_~var_1_22~0 c_~var_1_5~0)) (.cse11 (+ c_~var_1_5~0 1))) (let ((.cse6 (< 0 .cse11)) (.cse3 (not (= .cse19 .cse26))) (.cse12 (< c_~var_1_5~0 0)) (.cse0 (< 0 .cse27)) (.cse9 (not (= .cse10 (+ .cse26 1)))) (.cse16 (and .cse22 .cse5)) (.cse4 (not (= .cse10 .cse26))) (.cse15 (< c_~var_1_22~0 0))) (and (or .cse0 (and (or (let ((.cse1 (forall ((~var_1_6~0 Int)) (or (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (and (or .cse1 .cse2 .cse3) (or .cse1 .cse4 .cse5))) .cse6) (or (let ((.cse7 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse11) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (.cse8 (forall ((~var_1_6~0 Int)) (or (not (= .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (< c_~var_1_5~0 ~var_1_6~0) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (and (or .cse5 (and (or .cse4 .cse7) .cse8)) (or .cse2 (and (or .cse9 .cse7) .cse8)))) .cse12))) (or (let ((.cse14 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse11) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1))))) (.cse13 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse10)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))))) (and (or .cse0 (and .cse13 (or .cse14 .cse3)) .cse2) (or (and (or .cse4 .cse14) .cse13 (or .cse15 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse10)))))) .cse16))) .cse6) (or .cse0 (and (or .cse6 (let ((.cse18 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse11) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (.cse17 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse19)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse2 (and .cse17 (or .cse18 .cse3))) (or (and (or .cse4 .cse18) .cse17) .cse5)))) (or (let ((.cse20 (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse19)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse5 .cse20) (or .cse2 .cse20))) .cse12))) (or .cse6 (let ((.cse21 (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))))) (and (or .cse0 .cse21 .cse2 .cse3) (or .cse4 .cse16 (and .cse22 .cse21))))) (or (let ((.cse23 (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse10)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))))) (and (or .cse0 .cse23 .cse2) (or (and .cse23 (or (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse10)) (< 0 (+ ~var_1_6~0 1)))) .cse15)) .cse16))) .cse12) (or .cse12 (let ((.cse24 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse11) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (.cse25 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse10)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))))) (and (or .cse0 (and (or .cse9 .cse24) .cse25) .cse2) (or .cse16 (and (or (and .cse22 .cse24) .cse4) .cse25 (or .cse15 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse10)) (< ~var_1_6~0 0))))))))))))) is different from false [2024-11-10 07:09:24,333 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse44 (+ c_~var_1_22~0 1)) (.cse42 (+ c_~var_1_5~0 1))) (let ((.cse26 (div c_~var_1_22~0 c_~var_1_5~0)) (.cse22 (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0)))) (.cse13 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse42) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (.cse43 (<= .cse44 0)) (.cse5 (not .cse7))) (let ((.cse30 (mod c_~var_1_28~0 4294967296)) (.cse4 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse42) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (.cse18 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse42) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1))))) (.cse25 (forall ((~var_1_6~0 Int)) (or (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (.cse24 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse42) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (.cse17 (and .cse43 .cse5)) (.cse15 (< c_~var_1_22~0 0)) (.cse16 (and .cse43 .cse13)) (.cse0 (< 0 .cse44)) (.cse10 (< c_~var_1_5~0 0)) (.cse21 (and .cse43 .cse22)) (.cse1 (< 0 .cse42)) (.cse27 (+ .cse26 1)) (.cse29 (mod c_~var_1_8~0 256))) (and (or (let ((.cse28 (mod c_~var_1_28~0 65536))) (let ((.cse8 (+ .cse28 c_~var_1_22~0 1)) (.cse14 (+ .cse28 c_~var_1_22~0))) (let ((.cse12 (not (= .cse27 .cse14))) (.cse3 (not (= .cse26 .cse14))) (.cse6 (not (= .cse26 .cse8)))) (and (or .cse0 (and (or .cse1 (let ((.cse2 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse8)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or (and .cse2 (or .cse3 .cse4)) .cse5) (or (and .cse2 (or .cse6 .cse4)) .cse7)))) (or (let ((.cse9 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse8)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse7 .cse9) (or .cse5 .cse9))) .cse10))) (or .cse10 (let ((.cse11 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse14)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))))) (and (or .cse0 .cse7 (and .cse11 (or .cse12 .cse13))) (or (and .cse11 (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse14)) (< ~var_1_6~0 0))) .cse15) (or .cse16 .cse3)) .cse17)))) (or .cse1 (let ((.cse19 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse14)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))))) (and (or .cse0 .cse7 (and (or .cse6 .cse18) .cse19)) (or .cse17 (and (or .cse3 .cse18) .cse19))))) (or .cse10 (let ((.cse20 (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse14)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))))) (and (or (and .cse20 (or .cse15 (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse14)) (< 0 (+ ~var_1_6~0 1)))))) .cse17) (or .cse0 .cse20 .cse7)))) (or .cse1 (and (or .cse5 .cse3 .cse21) (or .cse22 .cse7 .cse6))) (or .cse0 (and (or .cse10 (let ((.cse23 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (+ (div c_~var_1_22~0 ~var_1_6~0) 1) .cse14)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (and (or (and .cse23 (or .cse12 .cse24)) .cse7) (or .cse5 (and (or .cse3 .cse24) .cse23))))) (or (and (or .cse25 .cse5 .cse3) (or .cse25 .cse7 .cse6)) .cse1))))))) (< .cse29 .cse30)) (or (< .cse30 (+ 1 .cse29)) (let ((.cse32 (+ c_~var_1_22~0 1 .cse29)) (.cse37 (+ c_~var_1_22~0 .cse29))) (let ((.cse40 (not (= .cse37 .cse27))) (.cse35 (not (= .cse26 .cse32))) (.cse33 (not (= .cse37 .cse26)))) (and (or .cse0 (and (or .cse10 (let ((.cse31 (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse32)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse31 .cse7) (or .cse31 .cse5)))) (or .cse1 (let ((.cse34 (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse32)) (< c_~var_1_5~0 ~var_1_6~0) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse5 (and (or .cse33 .cse4) .cse34)) (or (and .cse34 (or .cse35 .cse4)) .cse7)))))) (or .cse1 (let ((.cse36 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse37)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))))) (and (or .cse0 .cse7 (and (or .cse35 .cse18) .cse36)) (or (and .cse36 (or .cse33 .cse18)) .cse17)))) (or .cse10 (let ((.cse38 (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse37)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))))) (and (or (and (or (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse37)) (< 0 (+ ~var_1_6~0 1)))) .cse15) .cse38) .cse17) (or .cse0 .cse7 .cse38)))) (or .cse0 (and (or .cse1 (and (or .cse25 .cse5 .cse33) (or .cse25 .cse35 .cse7))) (or (let ((.cse39 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= .cse37 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (and (or .cse7 (and .cse39 (or .cse24 .cse40))) (or .cse5 (and .cse39 (or .cse33 .cse24))))) .cse10))) (or (let ((.cse41 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse37)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))))) (and (or .cse17 (and (or .cse15 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse37)) (< ~var_1_6~0 0)))) (or .cse16 .cse33) .cse41)) (or .cse0 (and (or .cse13 .cse40) .cse41) .cse7))) .cse10) (or (and (or .cse22 .cse35 .cse7) (or .cse5 .cse33 .cse21)) .cse1))))))))) is different from false [2024-11-10 07:09:46,708 WARN L286 SmtUtils]: Spent 7.46s on a formula simplification. DAG size of input: 231 DAG size of output: 227 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-10 07:09:54,687 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse42 (+ c_~var_1_5~0 1)) (.cse43 (+ c_~var_1_22~0 1)) (.cse5 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0))) (let ((.cse26 (div c_~var_1_22~0 c_~var_1_5~0)) (.cse24 (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0)))) (.cse4 (not .cse5)) (.cse44 (<= .cse43 0)) (.cse21 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse42) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))))) (let ((.cse22 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse42) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (.cse19 (and .cse44 .cse21)) (.cse11 (< c_~var_1_22~0 0)) (.cse13 (and .cse44 .cse4)) (.cse3 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse42) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1))))) (.cse25 (and .cse44 .cse24)) (.cse14 (< 0 .cse43)) (.cse8 (< c_~var_1_5~0 0)) (.cse17 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse42) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (.cse15 (forall ((~var_1_6~0 Int)) (or (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (.cse0 (< 0 .cse42)) (.cse27 (+ .cse26 1)) (.cse28 (mod c_~var_1_8~0 256)) (.cse29 (mod c_~var_1_28~0 4294967296))) (and (or (let ((.cse10 (+ c_~var_1_22~0 1 .cse28)) (.cse7 (+ c_~var_1_22~0 .cse28))) (let ((.cse18 (not (= .cse7 .cse27))) (.cse6 (not (= .cse26 .cse10))) (.cse2 (not (= .cse7 .cse26)))) (and (or .cse0 (let ((.cse1 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse7)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))))) (and (or (and .cse1 (or .cse2 .cse3)) .cse4) (or .cse5 (and (or .cse6 .cse3) .cse1))))) (or .cse8 (let ((.cse9 (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse10)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse9 .cse5) (or .cse9 .cse4)))) (or .cse8 (let ((.cse12 (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse7)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))))) (and (or (and (or (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse7)) (< 0 (+ ~var_1_6~0 1)))) .cse11) .cse12) .cse13) (or .cse14 .cse5 .cse12)))) (or .cse14 (and (or .cse0 (and (or .cse15 .cse4 .cse2) (or .cse15 .cse6 .cse5))) (or (let ((.cse16 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= .cse7 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (and (or .cse5 (and .cse16 (or .cse17 .cse18))) (or .cse4 (and .cse16 (or .cse2 .cse17))))) .cse8))) (or (let ((.cse20 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse7)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))))) (and (or .cse13 (and (or .cse11 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse7)) (< ~var_1_6~0 0)))) (or .cse19 .cse2) .cse20)) (or .cse14 (and (or .cse21 .cse18) .cse20) .cse5))) .cse8) (or .cse0 (let ((.cse23 (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse10)) (< c_~var_1_5~0 ~var_1_6~0) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse4 (and (or .cse2 .cse22) .cse23)) (or (and .cse23 (or .cse6 .cse22)) .cse5)))) (or (and (or .cse24 .cse6 .cse5) (or .cse4 .cse2 .cse25)) .cse0)))) (< .cse29 (+ 1 .cse28))) (or (let ((.cse41 (mod c_~var_1_28~0 65536))) (let ((.cse33 (+ .cse41 c_~var_1_22~0 1)) (.cse37 (+ .cse41 c_~var_1_22~0))) (let ((.cse36 (not (= .cse27 .cse37))) (.cse31 (not (= .cse26 .cse37))) (.cse32 (not (= .cse26 .cse33)))) (and (or .cse0 (let ((.cse30 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse33)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or (and .cse30 (or .cse31 .cse22)) .cse4) (or (and .cse30 (or .cse32 .cse22)) .cse5)))) (or (let ((.cse34 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse33)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse5 .cse34) (or .cse4 .cse34))) .cse8) (or .cse8 (let ((.cse35 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse37)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))))) (and (or .cse14 .cse5 (and .cse35 (or .cse36 .cse21))) (or (and .cse35 (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse37)) (< ~var_1_6~0 0))) .cse11) (or .cse19 .cse31)) .cse13)))) (or .cse8 (let ((.cse38 (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse37)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))))) (and (or (and .cse38 (or .cse11 (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse37)) (< 0 (+ ~var_1_6~0 1)))))) .cse13) (or .cse14 .cse38 .cse5)))) (or (let ((.cse39 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse37)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))))) (and (or .cse4 (and (or .cse31 .cse3) .cse39)) (or .cse5 (and (or .cse32 .cse3) .cse39)))) .cse0) (or .cse0 (and (or .cse4 .cse31 .cse25) (or .cse24 .cse5 .cse32))) (or .cse14 (and (or .cse8 (let ((.cse40 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (+ (div c_~var_1_22~0 ~var_1_6~0) 1) .cse37)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (and (or (and .cse40 (or .cse36 .cse17)) .cse5) (or .cse4 (and (or .cse31 .cse17) .cse40))))) (or (and (or .cse15 .cse4 .cse31) (or .cse15 .cse5 .cse32)) .cse0))))))) (< .cse28 .cse29)))))) (let ((.cse46 (+ (mod c_~var_1_7~0 256) (mod c_~var_1_18~0 65536)))) (let ((.cse45 (+ 1 (div c_~var_1_39~0 .cse46)))) (and (<= .cse45 c_~var_1_22~0) (or (< .cse45 c_~var_1_22~0) (= (mod c_~var_1_39~0 .cse46) 0) (< 0 (+ c_~var_1_39~0 1))))))) is different from false [2024-11-10 07:10:12,997 WARN L286 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 245 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)