/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/gcd_2+newton_3_8.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 12:08:29,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 12:08:29,812 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 12:08:29,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 12:08:29,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 12:08:29,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 12:08:29,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 12:08:29,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 12:08:29,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 12:08:29,831 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 12:08:29,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 12:08:29,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 12:08:29,832 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 12:08:29,833 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 12:08:29,833 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 12:08:29,834 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 12:08:29,834 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 12:08:29,834 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 12:08:29,834 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 12:08:29,835 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 12:08:29,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 12:08:29,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 12:08:29,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 12:08:29,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 12:08:29,836 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 12:08:29,836 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 12:08:29,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 12:08:29,836 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 12:08:29,836 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 12:08:29,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 12:08:29,837 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 12:08:29,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 12:08:29,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 12:08:29,838 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 12:08:29,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 12:08:29,838 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 12:08:29,838 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 12:08:29,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 12:08:29,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 12:08:29,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 12:08:29,838 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 12:08:29,838 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 12:08:29,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 12:08:29,839 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: Use bitabs translation -> false [2023-12-20 12:08:30,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 12:08:30,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 12:08:30,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 12:08:30,043 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 12:08:30,044 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 12:08:30,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/gcd_2+newton_3_8.i [2023-12-20 12:08:31,042 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 12:08:31,209 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 12:08:31,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/gcd_2+newton_3_8.i [2023-12-20 12:08:31,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf8fa9d10/5e0ff0c90fd64a4d88bf8d48cff15989/FLAG3ad1c919d [2023-12-20 12:08:31,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf8fa9d10/5e0ff0c90fd64a4d88bf8d48cff15989 [2023-12-20 12:08:31,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 12:08:31,230 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 12:08:31,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 12:08:31,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 12:08:31,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 12:08:31,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 12:08:31" (1/1) ... [2023-12-20 12:08:31,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7649d77c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:08:31, skipping insertion in model container [2023-12-20 12:08:31,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 12:08:31" (1/1) ... [2023-12-20 12:08:31,256 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 12:08:31,352 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/gcd_2+newton_3_8.i[1226,1239] [2023-12-20 12:08:31,368 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/gcd_2+newton_3_8.i[2862,2875] [2023-12-20 12:08:31,369 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 12:08:31,378 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 12:08:31,386 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/gcd_2+newton_3_8.i[1226,1239] [2023-12-20 12:08:31,396 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/gcd_2+newton_3_8.i[2862,2875] [2023-12-20 12:08:31,397 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 12:08:31,412 INFO L206 MainTranslator]: Completed translation [2023-12-20 12:08:31,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:08:31 WrapperNode [2023-12-20 12:08:31,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 12:08:31,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 12:08:31,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 12:08:31,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 12:08:31,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:08:31" (1/1) ... [2023-12-20 12:08:31,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:08:31" (1/1) ... [2023-12-20 12:08:31,438 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 91 [2023-12-20 12:08:31,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 12:08:31,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 12:08:31,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 12:08:31,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 12:08:31,445 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:08:31" (1/1) ... [2023-12-20 12:08:31,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:08:31" (1/1) ... [2023-12-20 12:08:31,447 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:08:31" (1/1) ... [2023-12-20 12:08:31,458 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]. [2023-12-20 12:08:31,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:08:31" (1/1) ... [2023-12-20 12:08:31,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:08:31" (1/1) ... [2023-12-20 12:08:31,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:08:31" (1/1) ... [2023-12-20 12:08:31,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:08:31" (1/1) ... [2023-12-20 12:08:31,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:08:31" (1/1) ... [2023-12-20 12:08:31,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:08:31" (1/1) ... [2023-12-20 12:08:31,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 12:08:31,467 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 12:08:31,467 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 12:08:31,467 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 12:08:31,467 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:08:31" (1/1) ... [2023-12-20 12:08:31,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 12:08:31,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:08:31,492 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) [2023-12-20 12:08:31,504 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 [2023-12-20 12:08:31,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 12:08:31,523 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-12-20 12:08:31,523 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-12-20 12:08:31,524 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-12-20 12:08:31,524 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-12-20 12:08:31,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 12:08:31,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-20 12:08:31,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 12:08:31,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 12:08:31,588 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 12:08:31,598 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 12:08:31,743 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 12:08:31,767 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 12:08:31,767 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 12:08:31,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 12:08:31 BoogieIcfgContainer [2023-12-20 12:08:31,767 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 12:08:31,769 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 12:08:31,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 12:08:31,771 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 12:08:31,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 12:08:31" (1/3) ... [2023-12-20 12:08:31,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3279f2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 12:08:31, skipping insertion in model container [2023-12-20 12:08:31,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:08:31" (2/3) ... [2023-12-20 12:08:31,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3279f2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 12:08:31, skipping insertion in model container [2023-12-20 12:08:31,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 12:08:31" (3/3) ... [2023-12-20 12:08:31,773 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_8.i [2023-12-20 12:08:31,786 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 12:08:31,787 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-20 12:08:31,814 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 12:08:31,818 INFO L357 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, mHoare=true, 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;@6cf6591, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 12:08:31,818 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-20 12:08:31,821 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) [2023-12-20 12:08:31,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-20 12:08:31,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:08:31,826 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:08:31,826 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:08:31,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:08:31,829 INFO L85 PathProgramCache]: Analyzing trace with hash 210916014, now seen corresponding path program 1 times [2023-12-20 12:08:31,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:08:31,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959437618] [2023-12-20 12:08:31,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:08:31,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:08:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:08:32,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:08:32,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:08:32,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959437618] [2023-12-20 12:08:32,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959437618] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:08:32,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:08:32,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 12:08:32,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692809601] [2023-12-20 12:08:32,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:08:32,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 12:08:32,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:08:32,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 12:08:32,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 12:08:32,026 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) [2023-12-20 12:08:32,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:08:32,091 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2023-12-20 12:08:32,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 12:08:32,093 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 [2023-12-20 12:08:32,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:08:32,099 INFO L225 Difference]: With dead ends: 67 [2023-12-20 12:08:32,099 INFO L226 Difference]: Without dead ends: 30 [2023-12-20 12:08:32,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 12:08:32,105 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 12:08:32,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 81 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 12:08:32,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-20 12:08:32,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-12-20 12:08:32,137 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) [2023-12-20 12:08:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2023-12-20 12:08:32,139 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 9 [2023-12-20 12:08:32,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:08:32,139 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2023-12-20 12:08:32,139 INFO L496 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) [2023-12-20 12:08:32,139 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2023-12-20 12:08:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-20 12:08:32,140 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:08:32,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:08:32,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 12:08:32,141 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:08:32,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:08:32,141 INFO L85 PathProgramCache]: Analyzing trace with hash 268174316, now seen corresponding path program 1 times [2023-12-20 12:08:32,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:08:32,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074434602] [2023-12-20 12:08:32,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:08:32,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:08:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:08:32,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:08:32,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:08:32,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074434602] [2023-12-20 12:08:32,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074434602] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:08:32,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:08:32,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 12:08:32,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156231247] [2023-12-20 12:08:32,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:08:32,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 12:08:32,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:08:32,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 12:08:32,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 12:08:32,196 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) [2023-12-20 12:08:32,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:08:32,223 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2023-12-20 12:08:32,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 12:08:32,226 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 [2023-12-20 12:08:32,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:08:32,226 INFO L225 Difference]: With dead ends: 34 [2023-12-20 12:08:32,226 INFO L226 Difference]: Without dead ends: 29 [2023-12-20 12:08:32,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 12:08:32,228 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 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 [2023-12-20 12:08:32,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 12:08:32,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-20 12:08:32,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-20 12:08:32,232 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) [2023-12-20 12:08:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-12-20 12:08:32,233 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 9 [2023-12-20 12:08:32,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:08:32,233 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-12-20 12:08:32,233 INFO L496 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) [2023-12-20 12:08:32,233 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-12-20 12:08:32,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-20 12:08:32,234 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:08:32,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:08:32,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 12:08:32,234 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:08:32,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:08:32,234 INFO L85 PathProgramCache]: Analyzing trace with hash -291101499, now seen corresponding path program 1 times [2023-12-20 12:08:32,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:08:32,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519746984] [2023-12-20 12:08:32,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:08:32,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:08:32,249 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 12:08:32,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [619556345] [2023-12-20 12:08:32,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:08:32,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:08:32,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:08:32,252 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) [2023-12-20 12:08:32,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 12:08:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:08:32,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-20 12:08:32,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:08:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:08:32,396 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:08:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:08:32,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:08:32,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519746984] [2023-12-20 12:08:32,454 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 12:08:32,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619556345] [2023-12-20 12:08:32,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619556345] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:08:32,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 12:08:32,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-12-20 12:08:32,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200151125] [2023-12-20 12:08:32,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 12:08:32,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 12:08:32,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:08:32,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 12:08:32,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-20 12:08:32,461 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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) [2023-12-20 12:08:32,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:08:32,515 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2023-12-20 12:08:32,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 12:08:32,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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 [2023-12-20 12:08:32,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:08:32,517 INFO L225 Difference]: With dead ends: 35 [2023-12-20 12:08:32,517 INFO L226 Difference]: Without dead ends: 30 [2023-12-20 12:08:32,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-20 12:08:32,519 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 12:08:32,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 121 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 12:08:32,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-20 12:08:32,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-20 12:08:32,530 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) [2023-12-20 12:08:32,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2023-12-20 12:08:32,530 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2023-12-20 12:08:32,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:08:32,531 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2023-12-20 12:08:32,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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) [2023-12-20 12:08:32,531 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2023-12-20 12:08:32,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-20 12:08:32,531 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:08:32,531 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:08:32,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-20 12:08:32,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:08:32,737 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:08:32,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:08:32,738 INFO L85 PathProgramCache]: Analyzing trace with hash -448782580, now seen corresponding path program 2 times [2023-12-20 12:08:32,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:08:32,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923375572] [2023-12-20 12:08:32,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:08:32,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:08:32,752 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 12:08:32,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [17668316] [2023-12-20 12:08:32,752 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-20 12:08:32,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:08:32,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:08:32,754 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) [2023-12-20 12:08:32,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-20 12:08:32,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-20 12:08:32,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-20 12:08:32,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-20 12:08:32,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:08:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:08:50,956 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:09:31,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:09:31,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:09:31,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923375572] [2023-12-20 12:09:31,187 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 12:09:31,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17668316] [2023-12-20 12:09:31,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17668316] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:09:31,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 12:09:31,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-20 12:09:31,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759615187] [2023-12-20 12:09:31,188 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 12:09:31,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 12:09:31,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:09:31,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 12:09:31,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=136, Unknown=7, NotChecked=0, Total=182 [2023-12-20 12:09:31,189 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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) [2023-12-20 12:09:35,335 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 [1] [2023-12-20 12:09:39,565 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_main1_~y~0#1| 1))) (and (or (let ((.cse4 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (let ((.cse71 (mod |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse72 (mod .cse4 256))) (let ((.cse57 (< .cse72 128)) (.cse2 (+ 257 |c_ULTIMATE.start_main1_~y~0#1|)) (.cse58 (< .cse71 128)) (.cse55 (< 0 .cse10)) (.cse66 (< 127 .cse72)) (.cse63 (< 127 .cse71)) (.cse56 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (not (= (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 0))))) (let ((.cse7 (or .cse55 .cse66 .cse63 .cse56)) (.cse8 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse70 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse69 (mod .cse70 256))) (or (< .cse69 .cse10) (< 127 (mod (+ .cse70 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse69) (< 127 (mod (+ .cse70 |c_ULTIMATE.start_gcd_test_~b#1|) 256))))))) (.cse18 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse68 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse67 (mod .cse68 256))) (or (< .cse67 .cse10) (< (mod (+ .cse68 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse68 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse67)))))) (.cse21 (or .cse55 .cse66 .cse56 .cse58)) (.cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse65 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse64 (mod .cse65 256))) (or (< .cse64 .cse2) (< .cse64 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse65 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse65 .cse4) 256) 128)))))) (.cse35 (or .cse55 .cse63 .cse56 .cse57)) (.cse36 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse62 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse61 (mod .cse62 256))) (or (< .cse61 .cse10) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse61) (< 127 (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse62 .cse4) 256) 128)))))) (.cse26 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse60 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse59 (mod .cse60 256))) (or (< .cse59 .cse2) (< .cse59 128) (< (mod (+ .cse60 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse60 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (.cse12 (or .cse55 .cse56 .cse57 .cse58)) (.cse13 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse54 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse53 (mod .cse54 256))) (or (< .cse53 .cse10) (< (mod (+ .cse54 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse53) (< (mod (+ .cse54 .cse4) 256) 128)))))) (.cse5 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse32 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse52 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse51 (mod .cse52 256))) (or (< .cse51 .cse2) (< .cse51 128) (< 127 (mod (+ .cse52 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse52 |c_ULTIMATE.start_gcd_test_~b#1|) 256))))))) (.cse6 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse29 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse50 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse49 (mod .cse50 256))) (or (< .cse49 .cse2) (< .cse49 128) (< (mod (+ .cse50 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (+ .cse50 .cse4) 256) 128))))))) (and (or (and .cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse3 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (mod (+ .cse3 .cse4) 256))) (or (< .cse1 .cse2) (< (mod .cse3 256) 128) (< 127 (mod (+ .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse1 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) .cse5) (or .cse6 (and .cse7 .cse8 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse11 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse9 .cse10) (< 127 (mod (+ .cse11 .cse4) 256)) (< 127 (mod .cse11 256)) (< 127 .cse9) (= .cse11 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse12 .cse13 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse15 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse14 128) (< .cse14 .cse2) (< 127 (mod .cse15 256)) (< (mod (+ .cse15 .cse4) 256) 128) (= .cse15 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse5 (and .cse7 .cse8 (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 .cse4) 256))) (or (< 127 .cse16) (< .cse16 .cse10) (< 127 (mod .cse17 256)) (< 127 (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse17 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or (and .cse18 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse19 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod (+ .cse19 .cse4) 256))) (or (< (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse20) (< .cse20 .cse10) (< 127 (mod .cse19 256)) (= .cse19 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse21) .cse5) (or .cse6 (and .cse18 (forall ((|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 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse22 128) (< .cse22 .cse2) (< 127 (mod (+ .cse23 .cse4) 256)) (< 127 (mod .cse23 256)) (= .cse23 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse21)) (or .cse6 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse24 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod (+ .cse24 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse24 256) 128) (< .cse25 128) (< .cse25 .cse2) (< 127 (mod (+ .cse24 .cse4) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse26)) (or .cse5 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse28 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod (+ .cse28 .cse4) 256))) (or (< .cse27 .cse2) (< (mod .cse28 256) 128) (< (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse27 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse29)) (or .cse6 (and .cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse30 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod (+ .cse30 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse30 256) 128) (< .cse31 .cse10) (< 127 .cse31) (< (mod (+ .cse30 .cse4) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse32 (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 ((.cse34 (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse33 256) 128) (< .cse34 .cse10) (< 127 (mod (+ .cse33 .cse4) 256)) (< 127 .cse34) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse35 .cse36 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse38 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse37 (mod (+ .cse38 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse37 .cse10) (< 127 (mod .cse38 256)) (< 127 .cse37) (< (mod (+ .cse38 .cse4) 256) 128) (= .cse38 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse5 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse40 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse39 (mod (+ .cse40 .cse4) 256))) (or (< .cse39 .cse2) (< 127 (mod .cse40 256)) (< 127 (mod (+ .cse40 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse39 128) (= .cse40 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse35 .cse36)) (or (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse41 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse42 (mod (+ .cse41 .cse4) 256))) (or (< (mod .cse41 256) 128) (< (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse42) (< .cse42 .cse10) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse26) .cse5) (or .cse5 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse44 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse43 (mod (+ .cse44 .cse4) 256))) (or (< .cse43 .cse2) (< (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod .cse44 256)) (< .cse43 128) (= .cse44 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse12 .cse13)) (or .cse5 (and .cse32 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod (+ .cse45 .cse4) 256))) (or (< (mod .cse45 256) 128) (< 127 .cse46) (< .cse46 .cse10) (< 127 (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse29 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse48 (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse47 256) 128) (< .cse48 128) (< .cse48 .cse2) (< (mod (+ .cse47 .cse4) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (or (< |c_ULTIMATE.start_gcd_test_~a#1| .cse10) (< 126 |c_ULTIMATE.start_main1_~y~0#1|)) (let ((.cse73 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse86 (<= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse75 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse74 (mod (+ .cse75 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= .cse73 .cse74) (<= 128 (mod .cse75 256)) (<= 128 .cse74) (<= 128 (mod (+ .cse75 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse76 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse77 (mod (+ .cse76 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (not (= .cse76 0)) (<= (mod .cse76 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= .cse77 127) (<= (mod (+ .cse76 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse77))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse78 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse79 (mod (+ .cse78 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (not (= .cse78 0)) (<= 128 (mod (+ .cse78 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (mod .cse78 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= .cse79 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse79))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse81 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse80 (mod .cse81 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse80) (<= .cse80 127) (<= (mod (+ .cse81 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127) (<= (mod (+ .cse81 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse83 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse82 (mod .cse83 256))) (and (<= 128 .cse82) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= (mod (+ .cse83 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127) (<= (mod (+ .cse83 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= .cse73 .cse82))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse84 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse85 (mod .cse84 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse84 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse85) (<= .cse85 127) (<= (mod (+ .cse84 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (and .cse86 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_y_7 Int) (v_z_9 Int) (v_y_9 Int)) (let ((.cse89 (* 256 v_y_9)) (.cse90 (* 255 v_z_9))) (let ((.cse87 (+ .cse89 .cse90)) (.cse88 (+ .cse89 .cse90 (* 256 v_y_7)))) (and (<= v_z_9 255) (<= 128 .cse87) (<= .cse88 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 v_z_9) (<= .cse87 255) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse88) 0) (<= 0 .cse88)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse92 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse91 (mod (+ .cse92 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= .cse73 .cse91) (<= 128 (mod .cse92 256)) (<= 128 .cse91) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ .cse92 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse94 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse93 (mod .cse94 256))) (and (<= 128 .cse93) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse94 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= (mod (+ .cse94 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= .cse73 .cse93))))) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse96 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse95 (mod .cse96 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse95) (<= 128 (mod (+ .cse96 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= .cse95 127) (<= (mod (+ .cse96 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127))))))) (and .cse86 (exists ((v_z_3 Int) (v_y_3 Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_y_1 Int)) (let ((.cse99 (* 255 v_z_3)) (.cse100 (* 256 v_y_3))) (let ((.cse97 (+ (* 256 v_y_1) .cse99 .cse100)) (.cse98 (+ .cse99 .cse100))) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse97) 0) (<= 0 .cse98) (<= 0 .cse97) (<= .cse97 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 v_z_3) (<= v_z_3 255) (<= .cse98 127)))))) (and (exists ((v_y_4 Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_y_6 Int) (v_z_6 Int)) (let ((.cse103 (* 256 v_y_6)) (.cse104 (* 255 v_z_6))) (let ((.cse102 (+ (* 256 v_y_4) .cse103 .cse104)) (.cse101 (+ .cse103 .cse104))) (and (<= .cse101 127) (<= v_z_6 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse102) 0) (<= .cse102 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 v_z_6) (not (= .cse102 0)) (<= 0 .cse102) (<= 0 .cse101))))) .cse86) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse106 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse105 (mod .cse106 256))) (and (<= 128 .cse105) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse106 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= 128 (mod (+ .cse106 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= .cse73 .cse105))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse108 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse107 (mod (+ .cse108 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= .cse73 .cse107) (not (= .cse108 0)) (<= 128 .cse107) (<= (mod .cse108 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ .cse108 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse109 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse110 (mod .cse109 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse109 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse110) (<= 128 (mod (+ .cse109 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= .cse110 127))))) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse112 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse111 (mod .cse112 256))) (and (<= 128 .cse111) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse112 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (mod (+ .cse112 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127) (<= .cse73 .cse111))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse113 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse114 (mod (+ .cse113 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= 128 (mod .cse113 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= .cse114 127) (<= (mod (+ .cse113 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse114))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse116 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse115 (mod (+ .cse116 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= .cse73 .cse115) (not (= .cse116 0)) (<= 128 .cse115) (<= 128 (mod (+ .cse116 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (mod .cse116 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse117 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse118 (mod (+ .cse117 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= 128 (mod .cse117 256)) (<= 128 (mod (+ .cse117 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= .cse118 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse118))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (and .cse86 (exists ((v_y_12 Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_z_12 Int) (v_y_11 Int)) (let ((.cse121 (* v_y_12 256)) (.cse122 (* v_z_12 255))) (let ((.cse120 (+ .cse121 .cse122 (* v_y_11 256))) (.cse119 (+ .cse121 .cse122))) (and (<= 128 .cse119) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse120) 0) (<= v_z_12 127) (<= .cse120 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 v_z_12) (<= 0 .cse120) (<= .cse119 255)))))))))) is different from false [2023-12-20 12:09:58,048 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] [2023-12-20 12:10:02,065 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] [2023-12-20 12:10:16,624 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] [2023-12-20 12:10:20,640 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] [2023-12-20 12:10:24,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-20 12:10:29,706 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] [2023-12-20 12:10:33,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-20 12:10:43,332 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] [2023-12-20 12:10:47,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-20 12:10:52,053 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, 1] [2023-12-20 12:10:53,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-20 12:11:09,940 WARN L293 SmtUtils]: Spent 5.76s on a formula simplification that was a NOOP. DAG size: 152 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 12:11:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:11:10,328 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2023-12-20 12:11:10,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-20 12:11:10,329 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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 11 [2023-12-20 12:11:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:11:10,329 INFO L225 Difference]: With dead ends: 40 [2023-12-20 12:11:10,329 INFO L226 Difference]: Without dead ends: 32 [2023-12-20 12:11:10,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 94.3s TimeCoverageRelationStatistics Valid=75, Invalid=258, Unknown=13, NotChecked=34, Total=380 [2023-12-20 12:11:10,330 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 7 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 49.8s IncrementalHoareTripleChecker+Time [2023-12-20 12:11:10,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 215 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 80 Invalid, 11 Unknown, 10 Unchecked, 49.8s Time] [2023-12-20 12:11:10,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-20 12:11:10,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-20 12:11:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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) [2023-12-20 12:11:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-12-20 12:11:10,338 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2023-12-20 12:11:10,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:11:10,338 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-12-20 12:11:10,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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) [2023-12-20 12:11:10,338 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-12-20 12:11:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-20 12:11:10,339 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:11:10,339 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:11:10,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-20 12:11:10,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-20 12:11:10,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:11:10,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:11:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2045375020, now seen corresponding path program 3 times [2023-12-20 12:11:10,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:11:10,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194514499] [2023-12-20 12:11:10,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:11:10,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:11:10,546 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 12:11:10,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [209080211] [2023-12-20 12:11:10,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-20 12:11:10,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:11:10,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:11:10,551 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 12:11:10,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-20 12:11:10,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-20 12:11:10,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-20 12:11:10,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-20 12:11:10,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:11:18,063 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) (mod (+ (* |c_ULTIMATE.start_main1_~y~0#1| 255) .cse0) 256)) (not (= .cse0 0)))))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (let ((.cse14 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (let ((.cse35 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse36 (mod .cse14 256))) (let ((.cse23 (<= 128 .cse36)) (.cse13 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse21 (<= 128 .cse35)) (.cse32 (<= .cse36 127)) (.cse22 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse24 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|)))) (.cse27 (<= .cse35 127))) (let ((.cse7 (or (and .cse32 .cse22 .cse24 .cse27) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse33 (mod .cse34 256))) (and (<= .cse33 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse33) (<= (mod (+ .cse34 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= (mod (+ .cse34 .cse14) 256) 127))))))) (.cse6 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse31 (mod .cse30 256))) (and (<= 128 (mod (+ .cse30 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= .cse31 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse31) (<= (mod (+ .cse30 .cse14) 256) 127))))) (and .cse21 .cse32 .cse22 .cse24))) (.cse8 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse28 (mod .cse29 256))) (and (<= 128 .cse28) (= .cse28 .cse13) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= (mod (+ .cse29 .cse14) 256) 127)))))) (.cse3 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse25 (mod .cse26 256))) (and (<= .cse25 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse25) (<= (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= 128 (mod (+ .cse26 .cse14) 256)))))) (and .cse22 .cse23 .cse24 .cse27))) (.cse2 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse20 (mod .cse19 256))) (and (<= 128 (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= .cse20 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse20) (<= 128 (mod (+ .cse19 .cse14) 256)))))) (and .cse21 .cse22 .cse23 .cse24))) (.cse1 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse18 (mod .cse17 256))) (and (<= 128 (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= 128 .cse18) (= .cse18 .cse13) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (mod (+ .cse17 .cse14) 256) 127)))))) (.cse9 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse15 (mod .cse16 256))) (and (<= 128 .cse15) (= .cse15 .cse13) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (mod (+ .cse16 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= 128 (mod (+ .cse16 .cse14) 256))))))) (.cse5 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse10 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse12 (mod .cse11 256))) (and (<= 128 (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= 128 .cse12) (= .cse12 .cse13) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 (mod (+ .cse11 .cse14) 256)))))))) (or (and .cse1 .cse2) (and .cse1 .cse3) (and .cse4 .cse1) (and .cse5 .cse6) (and .cse5 .cse7) (and .cse1 .cse7) (and .cse8 .cse1) (and .cse1 .cse6) (and .cse8 .cse5) (and .cse5 .cse3) (and .cse1 .cse9) (and .cse5 .cse2) (and .cse1 .cse10) (and .cse4 .cse5) (and .cse5 .cse9) (and .cse5 .cse10)))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from true [2023-12-20 12:11:36,062 WARN L293 SmtUtils]: Spent 7.99s on a formula simplification. DAG size of input: 82 DAG size of output: 77 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 12:12:01,944 WARN L293 SmtUtils]: Spent 5.45s on a formula simplification. DAG size of input: 81 DAG size of output: 74 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 12:12:33,361 WARN L293 SmtUtils]: Spent 7.67s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 12:12:59,609 WARN L293 SmtUtils]: Spent 7.85s on a formula simplification. DAG size of input: 74 DAG size of output: 73 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 12:13:06,419 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 4 not checked. [2023-12-20 12:13:06,419 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:13:38,640 WARN L293 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:14:29,169 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse21 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse19 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse20 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse22 (mod (+ .cse21 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse11 (mod (+ .cse21 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse0 (< 127 .cse11)) (.cse8 (< 127 .cse22)) (.cse1 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse22) 256) 0))) (.cse3 (< .cse22 .cse20)) (.cse5 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse11) 256) 0))) (.cse7 (< .cse11 .cse20)) (.cse4 (< 0 .cse19)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse9 (< .cse22 128)) (.cse2 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse10 (mod .cse21 256))) (and (or (and (or .cse0 (and (or (and (or .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse4)) .cse8) (or .cse5 .cse6 .cse7 .cse4 .cse9))) (or .cse1 .cse2 .cse3 .cse8 .cse4)) (< .cse10 128)) (or (< 127 .cse10) (let ((.cse14 (= .cse21 0))) (let ((.cse16 (< .cse10 .cse20)) (.cse17 (and (<= .cse19 0) (not .cse14))) (.cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse10) 256) 0)))) (let ((.cse12 (or .cse16 .cse2 .cse17 .cse18)) (.cse15 (or .cse16 .cse17 .cse18))) (and (or (< .cse11 128) (let ((.cse13 (or .cse16 .cse17 .cse6 .cse18))) (and (or (and .cse12 .cse13) .cse9) (or .cse8 (and (or .cse2 (and (or .cse1 .cse14 .cse3 .cse4) .cse15)) .cse13))))) (or .cse0 (and (or .cse8 (and (or (and (or .cse1 .cse3 .cse4) .cse15) .cse2) (or (and (or .cse5 .cse7 .cse4) .cse15) .cse6))) (or (and .cse12 (or (and (or .cse14 .cse5 .cse7 .cse4) .cse15) .cse6)) .cse9)))))))))))) (< |c_ULTIMATE.start_main1_~y~0#1| 1) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2023-12-20 12:15:21,646 WARN L293 SmtUtils]: Spent 5.54s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:15:32,033 WARN L293 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:15:51,128 WARN L293 SmtUtils]: Spent 7.55s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:16:08,153 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:16:13,932 WARN L293 SmtUtils]: Spent 5.78s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:16:25,811 WARN L293 SmtUtils]: Spent 5.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:17:01,530 WARN L293 SmtUtils]: Spent 5.61s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:17:12,679 WARN L293 SmtUtils]: Spent 6.60s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:17:37,894 WARN L293 SmtUtils]: Spent 7.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:17:54,267 WARN L293 SmtUtils]: Spent 7.73s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:17:59,276 WARN L293 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:18:30,561 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:18:57,887 WARN L293 SmtUtils]: Spent 6.90s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:19:16,469 WARN L293 SmtUtils]: Spent 6.19s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:19:24,486 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:19:39,360 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:20:00,018 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:20:18,267 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:20:32,747 WARN L293 SmtUtils]: Spent 6.42s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:20:50,910 WARN L293 SmtUtils]: Spent 5.70s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:20:58,770 WARN L293 SmtUtils]: Spent 7.85s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:21:06,455 WARN L293 SmtUtils]: Spent 7.68s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:21:12,839 WARN L876 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_main1_~y~0#1| 1) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (let ((.cse19 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse26 (mod (+ .cse19 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse29 (+ (- 256) .cse26))) (let ((.cse18 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse27 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse26) 256)) (.cse17 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse28 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse29) 256))) (let ((.cse13 (not (= (mod (mod .cse29 .cse28) 256) 0))) (.cse14 (< .cse28 .cse17)) (.cse25 (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse7 (= .cse26 0)) (.cse8 (not (= (mod (mod .cse26 .cse27) 256) 0))) (.cse9 (< .cse27 .cse17)) (.cse10 (< 0 .cse18))) (let ((.cse1 (< 127 .cse26)) (.cse2 (or .cse7 .cse8 .cse9 .cse10)) (.cse12 (< .cse26 128)) (.cse5 (< 127 .cse25)) (.cse4 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse11 (< .cse25 128)) (.cse15 (or .cse13 .cse14 .cse10)) (.cse0 (mod .cse19 256))) (and (or (< 127 .cse0) (let ((.cse6 (= .cse19 0))) (let ((.cse3 (let ((.cse16 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse0) 256))) (or (not (= (mod (mod .cse0 .cse16) 256) 0)) (< .cse16 .cse17) (and (<= .cse18 0) (not .cse6)) (= .cse0 0))))) (and (or .cse1 (and (or (and .cse2 .cse3) .cse4 .cse5) (or (and (or .cse6 .cse7 .cse8 .cse9 .cse10) .cse3) .cse4 .cse11))) (or .cse12 (and (or (and (or .cse6 .cse13 .cse14 .cse10) .cse3) .cse4) (or .cse4 (and .cse15 .cse3) .cse11))))))) (or (< .cse0 128) (let ((.cse21 (let ((.cse24 (+ (- 256) .cse0))) (let ((.cse23 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse24) 256))) (or (< .cse23 .cse17) (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (not (= 0 (mod (mod .cse24 .cse23) 256)))))))) (and (or .cse1 (let ((.cse20 (and .cse2 .cse21))) (and (or .cse20 .cse4 .cse11) (or .cse20 .cse4)))) (or .cse12 (let ((.cse22 (and .cse15 .cse21))) (and (or .cse4 .cse5 .cse22) (or .cse4 .cse22 .cse11))))))))))))))) is different from true [2023-12-20 12:21:21,761 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:21:29,785 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:21:36,479 WARN L293 SmtUtils]: Spent 6.69s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:21:49,650 WARN L293 SmtUtils]: Spent 5.81s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:21:56,872 WARN L293 SmtUtils]: Spent 7.22s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:22:04,510 WARN L293 SmtUtils]: Spent 5.18s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:22:12,977 WARN L293 SmtUtils]: Spent 6.26s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:22:19,836 WARN L293 SmtUtils]: Spent 6.86s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:22:30,996 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:22:42,347 WARN L293 SmtUtils]: Spent 6.88s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:22:50,794 WARN L293 SmtUtils]: Spent 6.50s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:22:56,871 WARN L293 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:23:02,930 WARN L293 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:23:08,670 WARN L293 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-12-20 12:23:13,612 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-20 12:23:13,612 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-20 12:23:14,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-20 12:23:14,667 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-20 12:23:14,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 12:23:14,668 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 14 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-20 12:23:14,669 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-20 12:23:14,672 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2023-12-20 12:23:14,674 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 12:23:14,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 12:23:14 BoogieIcfgContainer [2023-12-20 12:23:14,675 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 12:23:14,676 INFO L158 Benchmark]: Toolchain (without parser) took 883445.64ms. Allocated memory was 254.8MB in the beginning and 385.9MB in the end (delta: 131.1MB). Free memory was 198.2MB in the beginning and 147.2MB in the end (delta: 51.0MB). Peak memory consumption was 215.6MB. Max. memory is 8.0GB. [2023-12-20 12:23:14,684 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 211.8MB. Free memory is still 158.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 12:23:14,684 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.08ms. Allocated memory is still 254.8MB. Free memory was 198.2MB in the beginning and 186.1MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-20 12:23:14,685 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.30ms. Allocated memory is still 254.8MB. Free memory was 186.1MB in the beginning and 184.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 12:23:14,685 INFO L158 Benchmark]: Boogie Preprocessor took 27.91ms. Allocated memory is still 254.8MB. Free memory was 184.0MB in the beginning and 181.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 12:23:14,685 INFO L158 Benchmark]: RCFGBuilder took 300.66ms. Allocated memory is still 254.8MB. Free memory was 181.9MB in the beginning and 167.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-20 12:23:14,686 INFO L158 Benchmark]: TraceAbstraction took 882906.41ms. Allocated memory was 254.8MB in the beginning and 385.9MB in the end (delta: 131.1MB). Free memory was 166.7MB in the beginning and 147.2MB in the end (delta: 19.5MB). Peak memory consumption was 184.2MB. Max. memory is 8.0GB. [2023-12-20 12:23:14,687 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.43ms. Allocated memory is still 211.8MB. Free memory is still 158.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 182.08ms. Allocated memory is still 254.8MB. Free memory was 198.2MB in the beginning and 186.1MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.30ms. Allocated memory is still 254.8MB. Free memory was 186.1MB in the beginning and 184.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.91ms. Allocated memory is still 254.8MB. Free memory was 184.0MB in the beginning and 181.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 300.66ms. Allocated memory is still 254.8MB. Free memory was 181.9MB in the beginning and 167.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 882906.41ms. Allocated memory was 254.8MB in the beginning and 385.9MB in the end (delta: 131.1MB). Free memory was 166.7MB in the beginning and 147.2MB in the end (delta: 19.5MB). Peak memory consumption was 184.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 27). Cancelled while NwaCegarLoop was analyzing trace of length 14 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 102). Cancelled while NwaCegarLoop was analyzing trace of length 14 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 882.9s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 99.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 49.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 490 SdHoareTripleChecker+Invalid, 49.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 10 IncrementalHoareTripleChecker+Unchecked, 384 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 182 IncrementalHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 106 mSDtfsCounter, 182 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 94.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 58.6s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 54 ConstructedInterpolants, 7 QuantifiedInterpolants, 8014 SizeOfPredicates, 13 NumberOfNonLiveVariables, 165 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 0/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown