./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_3.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 cf7f7457cdd0c5557ed6396b1b77324a2673e1bc1f66f80f06950a47fe88485c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:13:46,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:13:46,227 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:13:46,233 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:13:46,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:13:46,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:13:46,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:13:46,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:13:46,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:13:46,263 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:13:46,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:13:46,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:13:46,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:13:46,265 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:13:46,265 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:13:46,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:13:46,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:13:46,266 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:13:46,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:13:46,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:13:46,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:13:46,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:13:46,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:13:46,267 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:13:46,268 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:13:46,268 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:13:46,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:13:46,268 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:13:46,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:13:46,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:13:46,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:13:46,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:13:46,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:13:46,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:13:46,270 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:13:46,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:13:46,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:13:46,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:13:46,271 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:13:46,271 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:13:46,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:13:46,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:13:46,272 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 -> cf7f7457cdd0c5557ed6396b1b77324a2673e1bc1f66f80f06950a47fe88485c [2024-10-12 21:13:46,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:13:46,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:13:46,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:13:46,488 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:13:46,488 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:13:46,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i [2024-10-12 21:13:47,654 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:13:47,822 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:13:47,822 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i [2024-10-12 21:13:47,828 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9209bc23/f3bf59338e9148fea9a03ae288a9b8e0/FLAG9ac189684 [2024-10-12 21:13:48,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9209bc23/f3bf59338e9148fea9a03ae288a9b8e0 [2024-10-12 21:13:48,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:13:48,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:13:48,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:13:48,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:13:48,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:13:48,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:13:48" (1/1) ... [2024-10-12 21:13:48,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba03e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:48, skipping insertion in model container [2024-10-12 21:13:48,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:13:48" (1/1) ... [2024-10-12 21:13:48,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:13:48,390 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i[1226,1239] [2024-10-12 21:13:48,413 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i[2862,2875] [2024-10-12 21:13:48,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:13:48,424 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:13:48,434 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i[1226,1239] [2024-10-12 21:13:48,441 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i[2862,2875] [2024-10-12 21:13:48,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:13:48,457 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:13:48,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:48 WrapperNode [2024-10-12 21:13:48,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:13:48,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:13:48,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:13:48,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:13:48,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:48" (1/1) ... [2024-10-12 21:13:48,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:48" (1/1) ... [2024-10-12 21:13:48,492 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 91 [2024-10-12 21:13:48,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:13:48,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:13:48,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:13:48,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:13:48,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:48" (1/1) ... [2024-10-12 21:13:48,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:48" (1/1) ... [2024-10-12 21:13:48,504 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:48" (1/1) ... [2024-10-12 21:13:48,513 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-12 21:13:48,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:48" (1/1) ... [2024-10-12 21:13:48,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:48" (1/1) ... [2024-10-12 21:13:48,516 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:48" (1/1) ... [2024-10-12 21:13:48,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:48" (1/1) ... [2024-10-12 21:13:48,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:48" (1/1) ... [2024-10-12 21:13:48,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:48" (1/1) ... [2024-10-12 21:13:48,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:13:48,525 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:13:48,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:13:48,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:13:48,525 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:48" (1/1) ... [2024-10-12 21:13:48,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:13:48,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:13:48,547 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 21:13:48,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 21:13:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:13:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-10-12 21:13:48,579 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-10-12 21:13:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-10-12 21:13:48,579 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-10-12 21:13:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:13:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 21:13:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:13:48,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:13:48,632 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:13:48,633 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:13:48,807 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-10-12 21:13:48,807 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:13:48,832 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:13:48,832 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 21:13:48,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:13:48 BoogieIcfgContainer [2024-10-12 21:13:48,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:13:48,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:13:48,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:13:48,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:13:48,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:13:48" (1/3) ... [2024-10-12 21:13:48,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7a9b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:13:48, skipping insertion in model container [2024-10-12 21:13:48,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:48" (2/3) ... [2024-10-12 21:13:48,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7a9b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:13:48, skipping insertion in model container [2024-10-12 21:13:48,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:13:48" (3/3) ... [2024-10-12 21:13:48,839 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_3.i [2024-10-12 21:13:48,851 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:13:48,852 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:13:48,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:13:48,895 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;@2a699694, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:13:48,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:13:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 21:13:48,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-12 21:13:48,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:13:48,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:13:48,903 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:13:48,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:13:48,907 INFO L85 PathProgramCache]: Analyzing trace with hash 210916014, now seen corresponding path program 1 times [2024-10-12 21:13:48,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:13:48,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397886447] [2024-10-12 21:13:48,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:13:48,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:13:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:13:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:13:49,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:13:49,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397886447] [2024-10-12 21:13:49,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397886447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:13:49,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:13:49,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:13:49,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762458976] [2024-10-12 21:13:49,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:13:49,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:13:49,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:13:49,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:13:49,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:13:49,169 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:13:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:13:49,236 INFO L93 Difference]: Finished difference Result 64 states and 87 transitions. [2024-10-12 21:13:49,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:13:49,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-12 21:13:49,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:13:49,243 INFO L225 Difference]: With dead ends: 64 [2024-10-12 21:13:49,243 INFO L226 Difference]: Without dead ends: 29 [2024-10-12 21:13:49,245 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-10-12 21:13:49,247 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:13:49,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 83 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:13:49,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-12 21:13:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-10-12 21:13:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 21:13:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-10-12 21:13:49,275 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 9 [2024-10-12 21:13:49,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:13:49,276 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-10-12 21:13:49,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:13:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-10-12 21:13:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-12 21:13:49,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:13:49,277 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:13:49,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:13:49,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:13:49,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:13:49,278 INFO L85 PathProgramCache]: Analyzing trace with hash 268174316, now seen corresponding path program 1 times [2024-10-12 21:13:49,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:13:49,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183233640] [2024-10-12 21:13:49,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:13:49,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:13:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:13:49,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:13:49,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:13:49,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183233640] [2024-10-12 21:13:49,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183233640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:13:49,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:13:49,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:13:49,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55919450] [2024-10-12 21:13:49,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:13:49,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:13:49,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:13:49,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:13:49,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:13:49,358 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:13:49,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:13:49,384 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-10-12 21:13:49,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:13:49,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-12 21:13:49,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:13:49,386 INFO L225 Difference]: With dead ends: 34 [2024-10-12 21:13:49,386 INFO L226 Difference]: Without dead ends: 29 [2024-10-12 21:13:49,387 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-10-12 21:13:49,388 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:13:49,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 73 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:13:49,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-12 21:13:49,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-12 21:13:49,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 21:13:49,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-10-12 21:13:49,397 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 9 [2024-10-12 21:13:49,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:13:49,398 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-10-12 21:13:49,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:13:49,398 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-10-12 21:13:49,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 21:13:49,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:13:49,399 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:13:49,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:13:49,400 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:13:49,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:13:49,400 INFO L85 PathProgramCache]: Analyzing trace with hash -291101499, now seen corresponding path program 1 times [2024-10-12 21:13:49,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:13:49,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655718315] [2024-10-12 21:13:49,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:13:49,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:13:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:13:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:13:49,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:13:49,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655718315] [2024-10-12 21:13:49,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655718315] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:13:49,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624612479] [2024-10-12 21:13:49,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:13:49,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:13:49,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:13:49,573 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:13:49,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 21:13:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:13:49,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 21:13:49,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:13:49,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:13:49,681 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:13:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:13:49,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624612479] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:13:49,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:13:49,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-10-12 21:13:49,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549260755] [2024-10-12 21:13:49,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:13:49,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:13:49,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:13:49,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:13:49,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:13:49,737 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:13:49,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:13:49,801 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-10-12 21:13:49,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:13:49,801 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-12 21:13:49,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:13:49,802 INFO L225 Difference]: With dead ends: 35 [2024-10-12 21:13:49,802 INFO L226 Difference]: Without dead ends: 30 [2024-10-12 21:13:49,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:13:49,804 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:13:49,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 146 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:13:49,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-12 21:13:49,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-12 21:13:49,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 21:13:49,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-10-12 21:13:49,809 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2024-10-12 21:13:49,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:13:49,810 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-12 21:13:49,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:13:49,810 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-10-12 21:13:49,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-12 21:13:49,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:13:49,811 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:13:49,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 21:13:50,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:13:50,012 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:13:50,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:13:50,013 INFO L85 PathProgramCache]: Analyzing trace with hash -448782580, now seen corresponding path program 2 times [2024-10-12 21:13:50,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:13:50,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589329990] [2024-10-12 21:13:50,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:13:50,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:13:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:13:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:13:50,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:13:50,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589329990] [2024-10-12 21:13:50,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589329990] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:13:50,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355695151] [2024-10-12 21:13:50,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 21:13:50,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:13:50,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:13:50,305 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:13:50,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 21:13:50,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 21:13:50,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 21:13:50,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-12 21:13:50,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:13:58,982 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (let ((.cse3 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse0 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse2 (mod .cse1 256))) (and (<= 128 (mod (+ .cse0 .cse1) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= .cse2 127) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse1) 256) 127) (= .cse2 |c_ULTIMATE.start_gcd_test_~a#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse4 (mod (+ .cse0 .cse5) 256))) (and (= .cse3 .cse4) (<= 128 (mod .cse5 256)) (<= 128 .cse4) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse5) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse6 (mod .cse7 256))) (and (= .cse6 .cse3) (<= 128 .cse6) (<= (mod (+ .cse0 .cse7) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse7) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse9 (mod .cse8 256))) (and (<= (mod (+ .cse0 .cse8) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= .cse9 127) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse8) 256) 127) (= .cse9 |c_ULTIMATE.start_gcd_test_~a#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse10 (mod .cse11 256))) (and (= .cse10 .cse3) (<= 128 .cse10) (<= 128 (mod (+ .cse0 .cse11) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse11) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse13 (mod (+ .cse0 .cse12) 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse12) 256)) (<= 128 (mod .cse12 256)) (<= .cse13 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse13))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse15 (mod .cse14 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse14) 256)) (<= (mod (+ .cse0 .cse14) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= .cse15 127) (= .cse15 |c_ULTIMATE.start_gcd_test_~a#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse17 (mod (+ .cse0 .cse16) 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse16) 256)) (<= .cse17 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (not (= .cse16 0)) (<= (mod .cse16 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse17))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse19 (mod .cse18 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse18) 256)) (= .cse19 .cse3) (<= 128 .cse19) (<= 128 (mod (+ .cse0 .cse18) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse20 (mod (+ .cse0 .cse21) 256))) (and (<= .cse20 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod .cse21 256) 127) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse21) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse20))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse23 (mod (+ .cse0 .cse22) 256))) (and (<= 128 (mod .cse22 256)) (<= .cse23 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse22) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse23))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse25 (mod (+ .cse0 .cse24) 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse24) 256)) (= .cse3 .cse25) (<= 128 (mod .cse24 256)) (<= 128 .cse25) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse27 (mod (+ .cse0 .cse26) 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse26) 256)) (= .cse3 .cse27) (<= 128 .cse27) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (not (= .cse26 0)) (<= (mod .cse26 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse29 (mod .cse28 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse28) 256)) (<= 128 (mod (+ .cse0 .cse28) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= .cse29 127) (= .cse29 |c_ULTIMATE.start_gcd_test_~a#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse30 (mod (+ .cse0 .cse31) 256))) (and (= .cse3 .cse30) (<= 128 .cse30) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (not (= .cse31 0)) (<= (mod .cse31 256) 127) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse31) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse33 (mod .cse32 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse32) 256)) (= .cse33 .cse3) (<= 128 .cse33) (<= (mod (+ .cse0 .cse32) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|))))))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (let ((.cse44 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (let ((.cse69 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse68 (mod .cse44 256))) (let ((.cse47 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse57 (<= 128 .cse68)) (.cse51 (<= .cse69 127)) (.cse56 (<= 128 .cse69)) (.cse48 (<= .cse68 127)) (.cse49 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse50 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|)))))) (let ((.cse38 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse67 (mod .cse66 256))) (and (<= (mod (+ .cse44 .cse66) 256) 127) (= .cse67 |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse67 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse66) 256)))))) (and .cse56 .cse48 .cse49 .cse50))) (.cse39 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse65 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse64 (mod .cse65 256))) (and (= .cse64 |c_ULTIMATE.start_gcd_test_~b#1|) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse65) 256) 127) (<= .cse64 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 (mod (+ .cse44 .cse65) 256)))))) (and .cse49 .cse57 .cse50 .cse51))) (.cse41 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse62 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse63 (mod .cse62 256))) (and (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse62) 256) 127) (= .cse63 .cse47) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 .cse63) (<= 128 (mod (+ .cse44 .cse62) 256))))))) (.cse42 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse60 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse61 (mod .cse60 256))) (and (<= (mod (+ .cse44 .cse60) 256) 127) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse60) 256) 127) (= .cse61 .cse47) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 .cse61)))))) (.cse43 (or (and .cse56 .cse49 .cse57 .cse50) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse59 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse58 (mod .cse59 256))) (and (= .cse58 |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse58 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse59) 256)) (<= 128 (mod (+ .cse44 .cse59) 256)))))))) (.cse40 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse55 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse54 (mod .cse55 256))) (and (= .cse54 .cse47) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse55) 256)) (<= 128 .cse54) (<= 128 (mod (+ .cse44 .cse55) 256))))))) (.cse34 (or (and .cse48 .cse49 .cse50 .cse51) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse53 (mod .cse52 256))) (and (<= (mod (+ .cse44 .cse52) 256) 127) (= .cse53 |c_ULTIMATE.start_gcd_test_~b#1|) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse52) 256) 127) (<= .cse53 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|))))))) (.cse36 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse35 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse37 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse46 (mod .cse45 256))) (and (<= (mod (+ .cse44 .cse45) 256) 127) (= .cse46 .cse47) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse45) 256)) (<= 128 .cse46))))))) (or (and .cse34 .cse35) (and .cse36 .cse37) (and .cse38 .cse35) (and .cse39 .cse35) (and .cse38 .cse36) (and .cse40 .cse35) (and .cse41 .cse35) (and .cse39 .cse36) (and .cse41 .cse36) (and .cse42 .cse36) (and .cse35 .cse43) (and .cse42 .cse35) (and .cse36 .cse43) (and .cse40 .cse36) (and .cse34 .cse36) (and .cse35 .cse37)))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from true [2024-10-12 21:14:22,085 WARN L286 SmtUtils]: Spent 13.51s on a formula simplification. DAG size of input: 122 DAG size of output: 94 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-12 21:14:27,059 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (not (= |c_ULTIMATE.start_main1_~g~0#1| 0)) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~g~0#1| 127) (let ((.cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main1_~g~0#1|) 0)))) (.cse1 (mod (* 255 |c_ULTIMATE.start_main1_~g~0#1|) 256))) (or (and (<= (+ |c_ULTIMATE.start_main1_~g~0#1| 1) 0) .cse0 (<= 128 .cse1)) (and .cse0 (<= 0 |c_ULTIMATE.start_main1_~g~0#1|)) (and .cse0 (<= .cse1 127)))) (let ((.cse4 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse5 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse3 (mod .cse2 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse2) 256)) (<= 128 .cse3) (<= 128 (mod (+ .cse4 .cse2) 256)) (= .cse3 .cse5) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse7 (mod (+ .cse4 .cse6) 256))) (and (<= 128 (mod .cse6 256)) (<= 128 .cse7) (= .cse5 .cse7) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse6) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse8) 256)) (<= 128 (mod (+ .cse4 .cse8) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (= (mod .cse8 256) |c_ULTIMATE.start_main1_~g~0#1|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse10 (mod .cse9 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse9) 256)) (<= 128 .cse10) (= .cse10 .cse5) (<= (mod (+ .cse4 .cse9) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse11 (mod (+ .cse4 .cse12) 256))) (and (<= 128 .cse11) (= .cse5 .cse11) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (not (= .cse12 0)) (<= (mod .cse12 256) 127) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse12) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= |c_ULTIMATE.start_main1_~g~0#1| (mod (+ .cse4 .cse13) 256)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse13) 256)) (<= 128 (mod .cse13 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse14) 256)) (<= (mod (+ .cse4 .cse14) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (= (mod .cse14 256) |c_ULTIMATE.start_main1_~g~0#1|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= |c_ULTIMATE.start_main1_~g~0#1| (mod (+ .cse4 .cse15) 256)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse15) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (not (= .cse15 0)) (<= (mod .cse15 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= |c_ULTIMATE.start_main1_~g~0#1| (mod (+ .cse4 .cse16) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod .cse16 256) 127) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse16) 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (and (<= 128 (mod (+ .cse4 .cse17) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (= (mod .cse17 256) |c_ULTIMATE.start_main1_~g~0#1|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse17) 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse19 (mod (+ .cse4 .cse18) 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse18) 256)) (<= 128 .cse19) (= .cse5 .cse19) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (not (= .cse18 0)) (<= (mod .cse18 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (and (<= (mod (+ .cse4 .cse20) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (= (mod .cse20 256) |c_ULTIMATE.start_main1_~g~0#1|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse20) 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= |c_ULTIMATE.start_main1_~g~0#1| (mod (+ .cse4 .cse21) 256)) (<= 128 (mod .cse21 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse21) 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse22 (mod .cse23 256))) (and (<= 128 .cse22) (= .cse22 .cse5) (<= (mod (+ .cse4 .cse23) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse23) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse25 (mod (+ .cse4 .cse24) 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse24) 256)) (<= 128 (mod .cse24 256)) (<= 128 .cse25) (= .cse5 .cse25) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse26 (mod .cse27 256))) (and (<= 128 .cse26) (<= 128 (mod (+ .cse4 .cse27) 256)) (= .cse26 .cse5) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse27) 256) 127)))))))) is different from true [2024-10-12 21:14:33,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-12 21:14:33,851 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:15:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:15:02,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355695151] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:15:02,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:15:02,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2024-10-12 21:15:02,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117295435] [2024-10-12 21:15:02,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:15:02,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-12 21:15:02,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:15:02,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-12 21:15:02,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=215, Unknown=6, NotChecked=62, Total=342 [2024-10-12 21:15:02,200 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:15:06,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-10-12 21:15:10,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-12 21:15:14,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-12 21:15:18,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-12 21:15:26,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-12 21:15:30,983 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse34 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (or (< |c_ULTIMATE.start_gcd_test_~b#1| |c_ULTIMATE.start_main1_~y~0#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| 1)) (or (let ((.cse3 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse5 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (let ((.cse8 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse33 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse32 (mod .cse33 256))) (or (< .cse32 .cse3) (< 127 (mod (+ .cse33 .cse5) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse32) (< 127 (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse32) 0))))))))) (.cse11 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse1 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod .cse31 256))) (or (< .cse30 .cse3) (< (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~b#1|) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse30) (< (mod (+ .cse31 .cse5) 256) 128) (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse30) 0))))))) (.cse0 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1)))) (and (or .cse0 .cse1) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse4 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse2 (mod .cse4 256))) (or (< .cse2 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse2) (< 127 (mod (+ .cse4 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse4 .cse5) 256) 128) (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse2) 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse7 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 (mod (+ .cse7 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse6) 0)) (< .cse6 .cse3) (< 127 (mod .cse7 256)) (< 127 .cse6) (< (mod (+ .cse7 .cse5) 256) 128) (= .cse7 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or (and .cse8 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse10 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod (+ .cse10 .cse5) 256))) (or (< 127 .cse9) (< .cse9 .cse3) (< 127 (mod .cse10 256)) (< 127 (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)) (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse9) 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse11) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse12) 0)) (< .cse12 .cse3) (< 127 (mod (+ .cse13 .cse5) 256)) (< 127 (mod .cse13 256)) (< 127 .cse12) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~b#1|))) .cse8) .cse0) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse14 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse15 (mod (+ .cse14 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse14 256) 128) (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse15) 0)) (< .cse15 .cse3) (< |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse15) (< (mod (+ .cse14 .cse5) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse17 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod .cse17 256))) (or (< .cse16 .cse3) (< (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse17 .cse5) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse16) (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse16) 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse19 (mod (+ .cse18 .cse5) 256))) (or (< (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse19) (< .cse19 .cse3) (< 127 (mod .cse18 256)) (= .cse18 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)) (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse19) 0))))))))) .cse11) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse20 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse21 (mod (+ .cse20 .cse5) 256))) (or (< (mod .cse20 256) 128) (< (mod (+ .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse21) (< .cse21 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)) (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse21) 0)))))) .cse11) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse23 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod .cse23 256))) (or (< .cse22 .cse3) (< |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~b#1|) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse22) (< 127 (mod (+ .cse23 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse23 .cse5) 256) 128) (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse22) 0)))))) .cse11) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod .cse25 256))) (or (< .cse24 .cse3) (< (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ .cse25 .cse5) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse24) (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse24) 0))))))) (or .cse11 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse26 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod (+ .cse26 .cse5) 256))) (or (< (mod .cse26 256) 128) (< |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse27) (< .cse27 .cse3) (< 127 (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)) (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse27) 0))))))) (or .cse11 .cse1) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse28 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse28 256) 128) (not (= (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse29) 0)) (< .cse29 .cse3) (< |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ .cse28 .cse5) 256)) (< 127 .cse29) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (< |c_ULTIMATE.start_main1_~y~0#1| 1) .cse34) (let ((.cse38 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse35 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse37 (mod .cse36 256))) (and (<= 128 (mod (+ .cse35 .cse36) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= .cse37 127) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse36) 256) 127) (= .cse37 |c_ULTIMATE.start_gcd_test_~a#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse39 (mod (+ .cse35 .cse40) 256))) (and (= .cse38 .cse39) (<= 128 (mod .cse40 256)) (<= 128 .cse39) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse40) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse42 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse41 (mod .cse42 256))) (and (= .cse41 .cse38) (<= 128 .cse41) (<= (mod (+ .cse35 .cse42) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse42) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse44 (mod .cse43 256))) (and (<= (mod (+ .cse35 .cse43) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= .cse44 127) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse43) 256) 127) (= .cse44 |c_ULTIMATE.start_gcd_test_~a#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse45 (mod .cse46 256))) (and (= .cse45 .cse38) (<= 128 .cse45) (<= 128 (mod (+ .cse35 .cse46) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse46) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse48 (mod (+ .cse35 .cse47) 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse47) 256)) (<= 128 (mod .cse47 256)) (<= .cse48 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse48))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse50 (mod .cse49 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse49) 256)) (<= (mod (+ .cse35 .cse49) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= .cse50 127) (= .cse50 |c_ULTIMATE.start_gcd_test_~a#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse52 (mod (+ .cse35 .cse51) 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse51) 256)) (<= .cse52 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (not (= .cse51 0)) (<= (mod .cse51 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse52))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse54 (mod .cse53 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse53) 256)) (= .cse54 .cse38) (<= 128 .cse54) (<= 128 (mod (+ .cse35 .cse53) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse55 (mod (+ .cse35 .cse56) 256))) (and (<= .cse55 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod .cse56 256) 127) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse56) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse55))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse57 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse58 (mod (+ .cse35 .cse57) 256))) (and (<= 128 (mod .cse57 256)) (<= .cse58 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse57) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse58))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse59 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse60 (mod (+ .cse35 .cse59) 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse59) 256)) (= .cse38 .cse60) (<= 128 (mod .cse59 256)) (<= 128 .cse60) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse61 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse62 (mod (+ .cse35 .cse61) 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse61) 256)) (= .cse38 .cse62) (<= 128 .cse62) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (not (= .cse61 0)) (<= (mod .cse61 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse63 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse64 (mod .cse63 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse63) 256)) (<= 128 (mod (+ .cse35 .cse63) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= .cse64 127) (= .cse64 |c_ULTIMATE.start_gcd_test_~a#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse65 (mod (+ .cse35 .cse66) 256))) (and (= .cse38 .cse65) (<= 128 .cse65) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (not (= .cse66 0)) (<= (mod .cse66 256) 127) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse66) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse67 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse68 (mod .cse67 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse67) 256)) (= .cse68 .cse38) (<= 128 .cse68) (<= (mod (+ .cse35 .cse67) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|))))))) (or (< |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~y~0#1|) (< |c_ULTIMATE.start_gcd_test_~a#1| 1)) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (let ((.cse79 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (let ((.cse103 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse102 (mod .cse79 256))) (let ((.cse82 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse91 (<= 128 .cse102)) (.cse85 (<= .cse103 127)) (.cse90 (<= 128 .cse103)) (.cse83 (<= .cse102 127)) (.cse84 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|)))))) (let ((.cse73 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse100 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse101 (mod .cse100 256))) (and (<= (mod (+ .cse79 .cse100) 256) 127) (= .cse101 |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse101 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse100) 256)))))) (and .cse90 .cse83 .cse34 .cse84))) (.cse74 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse99 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse98 (mod .cse99 256))) (and (= .cse98 |c_ULTIMATE.start_gcd_test_~b#1|) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse99) 256) 127) (<= .cse98 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 (mod (+ .cse79 .cse99) 256)))))) (and .cse34 .cse91 .cse84 .cse85))) (.cse76 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse96 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse97 (mod .cse96 256))) (and (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse96) 256) 127) (= .cse97 .cse82) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 .cse97) (<= 128 (mod (+ .cse79 .cse96) 256))))))) (.cse77 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse94 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse95 (mod .cse94 256))) (and (<= (mod (+ .cse79 .cse94) 256) 127) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse94) 256) 127) (= .cse95 .cse82) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 .cse95)))))) (.cse78 (or (and .cse90 .cse34 .cse91 .cse84) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse93 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse92 (mod .cse93 256))) (and (= .cse92 |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse92 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse93) 256)) (<= 128 (mod (+ .cse79 .cse93) 256)))))))) (.cse75 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse89 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse88 (mod .cse89 256))) (and (= .cse88 .cse82) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse89) 256)) (<= 128 .cse88) (<= 128 (mod (+ .cse79 .cse89) 256))))))) (.cse69 (or (and .cse83 .cse34 .cse84 .cse85) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse86 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse87 (mod .cse86 256))) (and (<= (mod (+ .cse79 .cse86) 256) 127) (= .cse87 |c_ULTIMATE.start_gcd_test_~b#1|) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse86) 256) 127) (<= .cse87 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|))))))) (.cse71 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse70 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse72 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse80 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse81 (mod .cse80 256))) (and (<= (mod (+ .cse79 .cse80) 256) 127) (= .cse81 .cse82) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse80) 256)) (<= 128 .cse81))))))) (or (and .cse69 .cse70) (and .cse71 .cse72) (and .cse73 .cse70) (and .cse74 .cse70) (and .cse73 .cse71) (and .cse75 .cse70) (and .cse76 .cse70) (and .cse74 .cse71) (and .cse76 .cse71) (and .cse77 .cse71) (and .cse70 .cse78) (and .cse77 .cse70) (and .cse71 .cse78) (and .cse75 .cse71) (and .cse69 .cse71) (and .cse70 .cse72)))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)))) is different from false [2024-10-12 21:15:31,805 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-10-12 21:15:31,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-10-12 21:15:31,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:15:31,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 50.9s TimeCoverageRelationStatistics Valid=68, Invalid=240, Unknown=6, NotChecked=66, Total=380 [2024-10-12 21:15:31,807 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 21.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:15:31,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 61 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 5 Unknown, 21 Unchecked, 21.8s Time] [2024-10-12 21:15:31,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 21:15:32,008 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,SelfDestructingSolverStorable3 [2024-10-12 21:15:32,009 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:864) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:373) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 47 more [2024-10-12 21:15:32,012 INFO L158 Benchmark]: Toolchain (without parser) took 103767.45ms. Allocated memory was 140.5MB in the beginning and 270.5MB in the end (delta: 130.0MB). Free memory was 86.1MB in the beginning and 125.9MB in the end (delta: -39.8MB). Peak memory consumption was 92.5MB. Max. memory is 16.1GB. [2024-10-12 21:15:32,012 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 140.5MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 21:15:32,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.23ms. Allocated memory is still 140.5MB. Free memory was 85.6MB in the beginning and 71.9MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 21:15:32,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.24ms. Allocated memory is still 140.5MB. Free memory was 71.9MB in the beginning and 70.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 21:15:32,013 INFO L158 Benchmark]: Boogie Preprocessor took 29.12ms. Allocated memory is still 140.5MB. Free memory was 70.2MB in the beginning and 67.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 21:15:32,013 INFO L158 Benchmark]: RCFGBuilder took 307.88ms. Allocated memory was 140.5MB in the beginning and 186.6MB in the end (delta: 46.1MB). Free memory was 67.8MB in the beginning and 155.4MB in the end (delta: -87.7MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2024-10-12 21:15:32,013 INFO L158 Benchmark]: TraceAbstraction took 103178.01ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 155.4MB in the beginning and 125.9MB in the end (delta: 29.5MB). Peak memory consumption was 115.3MB. Max. memory is 16.1GB. [2024-10-12 21:15:32,014 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 140.5MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.23ms. Allocated memory is still 140.5MB. Free memory was 85.6MB in the beginning and 71.9MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.24ms. Allocated memory is still 140.5MB. Free memory was 71.9MB in the beginning and 70.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.12ms. Allocated memory is still 140.5MB. Free memory was 70.2MB in the beginning and 67.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 307.88ms. Allocated memory was 140.5MB in the beginning and 186.6MB in the end (delta: 46.1MB). Free memory was 67.8MB in the beginning and 155.4MB in the end (delta: -87.7MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * TraceAbstraction took 103178.01ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 155.4MB in the beginning and 125.9MB in the end (delta: 29.5MB). Peak memory consumption was 115.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...