./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_7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_7.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 803cbc2ab2fb54f2ccf794a1cf55b1df2243f22f996d0e59d0f49967facf7958 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:34:03,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:34:03,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:34:03,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:34:03,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:34:03,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:34:03,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:34:03,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:34:03,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:34:03,499 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:34:03,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:34:03,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:34:03,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:34:03,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:34:03,503 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:34:03,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:34:03,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:34:03,504 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:34:03,504 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:34:03,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:34:03,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:34:03,506 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:34:03,506 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:34:03,506 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:34:03,506 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:34:03,507 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:34:03,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:34:03,507 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:34:03,508 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:34:03,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:34:03,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:34:03,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:34:03,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:34:03,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:34:03,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:34:03,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:34:03,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:34:03,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:34:03,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:34:03,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:34:03,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:34:03,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:34:03,522 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 803cbc2ab2fb54f2ccf794a1cf55b1df2243f22f996d0e59d0f49967facf7958 [2024-10-11 04:34:03,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:34:03,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:34:03,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:34:03,813 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:34:03,816 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:34:03,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_7.i [2024-10-11 04:34:05,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:34:05,507 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:34:05,507 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_7.i [2024-10-11 04:34:05,518 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f5e5d32e2/7e4f3555f46f454b9628d97c78d6bccd/FLAG8fe5a987b [2024-10-11 04:34:05,891 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f5e5d32e2/7e4f3555f46f454b9628d97c78d6bccd [2024-10-11 04:34:05,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:34:05,895 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:34:05,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:34:05,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:34:05,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:34:05,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:34:05" (1/1) ... [2024-10-11 04:34:05,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a28c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:05, skipping insertion in model container [2024-10-11 04:34:05,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:34:05" (1/1) ... [2024-10-11 04:34:05,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:34:06,123 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_7.i[1226,1239] [2024-10-11 04:34:06,157 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_7.i[2862,2875] [2024-10-11 04:34:06,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:34:06,179 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:34:06,192 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_7.i[1226,1239] [2024-10-11 04:34:06,210 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_7.i[2862,2875] [2024-10-11 04:34:06,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:34:06,233 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:34:06,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:06 WrapperNode [2024-10-11 04:34:06,234 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:34:06,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:34:06,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:34:06,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:34:06,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:06" (1/1) ... [2024-10-11 04:34:06,251 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:06" (1/1) ... [2024-10-11 04:34:06,278 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 91 [2024-10-11 04:34:06,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:34:06,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:34:06,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:34:06,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:34:06,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:06" (1/1) ... [2024-10-11 04:34:06,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:06" (1/1) ... [2024-10-11 04:34:06,294 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:06" (1/1) ... [2024-10-11 04:34:06,315 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-11 04:34:06,315 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:06" (1/1) ... [2024-10-11 04:34:06,315 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:06" (1/1) ... [2024-10-11 04:34:06,320 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:06" (1/1) ... [2024-10-11 04:34:06,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:06" (1/1) ... [2024-10-11 04:34:06,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:06" (1/1) ... [2024-10-11 04:34:06,326 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:06" (1/1) ... [2024-10-11 04:34:06,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:34:06,329 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:34:06,330 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:34:06,330 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:34:06,331 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:06" (1/1) ... [2024-10-11 04:34:06,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:34:06,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:34:06,366 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:34:06,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:34:06,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:34:06,409 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-10-11 04:34:06,409 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-10-11 04:34:06,409 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-10-11 04:34:06,409 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-10-11 04:34:06,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:34:06,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 04:34:06,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:34:06,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:34:06,476 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:34:06,479 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:34:06,695 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-10-11 04:34:06,695 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:34:06,733 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:34:06,733 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 04:34:06,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:34:06 BoogieIcfgContainer [2024-10-11 04:34:06,734 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:34:06,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:34:06,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:34:06,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:34:06,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:34:05" (1/3) ... [2024-10-11 04:34:06,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612d55e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:34:06, skipping insertion in model container [2024-10-11 04:34:06,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:06" (2/3) ... [2024-10-11 04:34:06,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612d55e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:34:06, skipping insertion in model container [2024-10-11 04:34:06,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:34:06" (3/3) ... [2024-10-11 04:34:06,748 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_7.i [2024-10-11 04:34:06,765 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:34:06,766 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:34:06,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:34:06,829 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;@40a4ffc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:34:06,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:34:06,833 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-11 04:34:06,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 04:34:06,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:34:06,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:34:06,843 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:34:06,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:34:06,849 INFO L85 PathProgramCache]: Analyzing trace with hash 210916014, now seen corresponding path program 1 times [2024-10-11 04:34:06,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:34:06,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172448268] [2024-10-11 04:34:06,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:34:06,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:34:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:34:07,179 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-11 04:34:07,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:34:07,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172448268] [2024-10-11 04:34:07,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172448268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:34:07,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:34:07,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:34:07,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372958380] [2024-10-11 04:34:07,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:34:07,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:34:07,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:34:07,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:34:07,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:34:07,223 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-11 04:34:07,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:34:07,308 INFO L93 Difference]: Finished difference Result 64 states and 87 transitions. [2024-10-11 04:34:07,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:34:07,312 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-11 04:34:07,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:34:07,318 INFO L225 Difference]: With dead ends: 64 [2024-10-11 04:34:07,319 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 04:34:07,322 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-11 04:34:07,326 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:34:07,327 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.1s Time] [2024-10-11 04:34:07,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 04:34:07,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-10-11 04:34:07,373 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-11 04:34:07,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-10-11 04:34:07,375 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 9 [2024-10-11 04:34:07,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:34:07,375 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-10-11 04:34:07,376 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-11 04:34:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-10-11 04:34:07,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 04:34:07,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:34:07,377 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:34:07,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:34:07,377 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:34:07,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:34:07,378 INFO L85 PathProgramCache]: Analyzing trace with hash 268174316, now seen corresponding path program 1 times [2024-10-11 04:34:07,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:34:07,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831595562] [2024-10-11 04:34:07,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:34:07,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:34:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:34:07,562 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-11 04:34:07,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:34:07,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831595562] [2024-10-11 04:34:07,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831595562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:34:07,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:34:07,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:34:07,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839833073] [2024-10-11 04:34:07,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:34:07,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:34:07,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:34:07,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:34:07,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:34:07,571 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-11 04:34:07,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:34:07,648 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-10-11 04:34:07,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:34:07,649 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-11 04:34:07,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:34:07,651 INFO L225 Difference]: With dead ends: 34 [2024-10-11 04:34:07,651 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 04:34:07,652 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-11 04:34:07,654 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:34:07,655 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.1s Time] [2024-10-11 04:34:07,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 04:34:07,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-11 04:34:07,664 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-11 04:34:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-10-11 04:34:07,666 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 9 [2024-10-11 04:34:07,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:34:07,667 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-10-11 04:34:07,667 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-11 04:34:07,668 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-10-11 04:34:07,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 04:34:07,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:34:07,669 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:34:07,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:34:07,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:34:07,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:34:07,672 INFO L85 PathProgramCache]: Analyzing trace with hash -291101499, now seen corresponding path program 1 times [2024-10-11 04:34:07,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:34:07,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285551228] [2024-10-11 04:34:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:34:07,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:34:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:34:07,879 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-11 04:34:07,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:34:07,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285551228] [2024-10-11 04:34:07,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285551228] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:34:07,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039940840] [2024-10-11 04:34:07,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:34:07,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:34:07,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:34:07,886 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:34:07,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 04:34:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:34:07,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 04:34:07,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:34:08,054 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-11 04:34:08,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:34:08,123 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-11 04:34:08,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039940840] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:34:08,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:34:08,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-10-11 04:34:08,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953520106] [2024-10-11 04:34:08,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:34:08,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:34:08,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:34:08,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:34:08,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:34:08,127 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-11 04:34:08,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:34:08,208 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-10-11 04:34:08,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:34:08,211 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-11 04:34:08,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:34:08,212 INFO L225 Difference]: With dead ends: 35 [2024-10-11 04:34:08,213 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 04:34:08,213 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-11 04:34:08,214 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-11 04:34:08,216 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-11 04:34:08,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 04:34:08,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-11 04:34:08,223 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-11 04:34:08,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-10-11 04:34:08,226 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2024-10-11 04:34:08,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:34:08,226 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-11 04:34:08,227 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-11 04:34:08,227 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-10-11 04:34:08,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 04:34:08,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:34:08,228 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:34:08,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 04:34:08,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:34:08,429 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:34:08,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:34:08,430 INFO L85 PathProgramCache]: Analyzing trace with hash -448782580, now seen corresponding path program 2 times [2024-10-11 04:34:08,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:34:08,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578039916] [2024-10-11 04:34:08,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:34:08,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:34:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:34:08,906 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-11 04:34:08,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:34:08,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578039916] [2024-10-11 04:34:08,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578039916] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:34:08,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256542396] [2024-10-11 04:34:08,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 04:34:08,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:34:08,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:34:08,914 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:34:08,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 04:34:08,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 04:34:08,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 04:34:08,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 04:34:08,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:34:19,525 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-11 04:34:50,590 WARN L286 SmtUtils]: Spent 23.34s 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-11 04:35:04,972 WARN L286 SmtUtils]: Spent 7.91s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-11 04:35:21,666 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-11 04:35:21,667 INFO L311 TraceCheckSpWp]: Computing backward predicates...