/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/gcd_1+newton_3_7.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-18 22:50:41,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-18 22:50:41,829 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-18 22:50:41,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-18 22:50:41,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-18 22:50:41,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-18 22:50:41,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-18 22:50:41,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-18 22:50:41,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-18 22:50:41,865 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-18 22:50:41,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-18 22:50:41,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-18 22:50:41,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-18 22:50:41,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-18 22:50:41,867 INFO L153 SettingsManager]: * Use SBE=true [2023-12-18 22:50:41,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-18 22:50:41,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-18 22:50:41,868 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-18 22:50:41,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-18 22:50:41,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-18 22:50:41,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-18 22:50:41,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-18 22:50:41,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-18 22:50:41,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-18 22:50:41,871 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-18 22:50:41,871 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-18 22:50:41,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-18 22:50:41,871 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-18 22:50:41,872 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-18 22:50:41,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-18 22:50:41,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-18 22:50:41,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-18 22:50:41,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-18 22:50:41,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-18 22:50:41,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-18 22:50:41,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-18 22:50:41,874 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-18 22:50:41,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-18 22:50:41,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-18 22:50:41,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-18 22:50:41,875 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-18 22:50:41,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-18 22:50:41,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-18 22:50:41,876 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 -> true [2023-12-18 22:50:42,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-18 22:50:42,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-18 22:50:42,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-18 22:50:42,144 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-18 22:50:42,146 INFO L274 PluginConnector]: CDTParser initialized [2023-12-18 22:50:42,147 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/gcd_1+newton_3_7.i [2023-12-18 22:50:43,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-18 22:50:43,485 INFO L384 CDTParser]: Found 1 translation units. [2023-12-18 22:50:43,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/gcd_1+newton_3_7.i [2023-12-18 22:50:43,492 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2503f771/30503d2419b9464399dd55a8c970f371/FLAG22f4c453c [2023-12-18 22:50:43,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2503f771/30503d2419b9464399dd55a8c970f371 [2023-12-18 22:50:43,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-18 22:50:43,508 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-18 22:50:43,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-18 22:50:43,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-18 22:50:43,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-18 22:50:43,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:50:43" (1/1) ... [2023-12-18 22:50:43,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17b169ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:43, skipping insertion in model container [2023-12-18 22:50:43,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:50:43" (1/1) ... [2023-12-18 22:50:43,540 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-18 22:50:43,668 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_1+newton_3_7.i[1226,1239] [2023-12-18 22:50:43,689 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_1+newton_3_7.i[2828,2841] [2023-12-18 22:50:43,690 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-18 22:50:43,698 INFO L202 MainTranslator]: Completed pre-run [2023-12-18 22:50:43,708 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_1+newton_3_7.i[1226,1239] [2023-12-18 22:50:43,717 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_1+newton_3_7.i[2828,2841] [2023-12-18 22:50:43,718 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-18 22:50:43,730 INFO L206 MainTranslator]: Completed translation [2023-12-18 22:50:43,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:43 WrapperNode [2023-12-18 22:50:43,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-18 22:50:43,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-18 22:50:43,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-18 22:50:43,732 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-18 22:50:43,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:43" (1/1) ... [2023-12-18 22:50:43,753 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:43" (1/1) ... [2023-12-18 22:50:43,772 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 91 [2023-12-18 22:50:43,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-18 22:50:43,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-18 22:50:43,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-18 22:50:43,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-18 22:50:43,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:43" (1/1) ... [2023-12-18 22:50:43,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:43" (1/1) ... [2023-12-18 22:50:43,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:43" (1/1) ... [2023-12-18 22:50:43,795 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-18 22:50:43,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:43" (1/1) ... [2023-12-18 22:50:43,795 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:43" (1/1) ... [2023-12-18 22:50:43,800 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:43" (1/1) ... [2023-12-18 22:50:43,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:43" (1/1) ... [2023-12-18 22:50:43,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:43" (1/1) ... [2023-12-18 22:50:43,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:43" (1/1) ... [2023-12-18 22:50:43,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-18 22:50:43,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-18 22:50:43,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-18 22:50:43,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-18 22:50:43,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:43" (1/1) ... [2023-12-18 22:50:43,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-18 22:50:43,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:50:43,839 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-18 22:50:43,865 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-18 22:50:43,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-18 22:50:43,885 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-12-18 22:50:43,885 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-12-18 22:50:43,887 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-12-18 22:50:43,887 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-12-18 22:50:43,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-18 22:50:43,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-18 22:50:43,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-18 22:50:43,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-18 22:50:43,964 INFO L241 CfgBuilder]: Building ICFG [2023-12-18 22:50:43,968 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-18 22:50:44,186 INFO L282 CfgBuilder]: Performing block encoding [2023-12-18 22:50:44,227 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-18 22:50:44,227 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-18 22:50:44,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:50:44 BoogieIcfgContainer [2023-12-18 22:50:44,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-18 22:50:44,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-18 22:50:44,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-18 22:50:44,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-18 22:50:44,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:50:43" (1/3) ... [2023-12-18 22:50:44,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d4e5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:50:44, skipping insertion in model container [2023-12-18 22:50:44,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:50:43" (2/3) ... [2023-12-18 22:50:44,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d4e5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:50:44, skipping insertion in model container [2023-12-18 22:50:44,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:50:44" (3/3) ... [2023-12-18 22:50:44,238 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_3_7.i [2023-12-18 22:50:44,254 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-18 22:50:44,255 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-18 22:50:44,308 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-18 22:50:44,314 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;@1776694d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-18 22:50:44,315 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-18 22:50:44,318 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-18 22:50:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-18 22:50:44,329 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:50:44,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 22:50:44,331 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:50:44,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:50:44,338 INFO L85 PathProgramCache]: Analyzing trace with hash 117379001, now seen corresponding path program 1 times [2023-12-18 22:50:44,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:50:44,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140156369] [2023-12-18 22:50:44,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:50:44,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:50:44,461 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-18 22:50:44,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [849488617] [2023-12-18 22:50:44,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:50:44,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:50:44,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:50:44,465 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-18 22:50:44,470 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-18 22:50:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:50:44,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-18 22:50:44,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:50:44,557 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-18 22:50:44,557 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:50:44,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:50:44,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140156369] [2023-12-18 22:50:44,558 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-18 22:50:44,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849488617] [2023-12-18 22:50:44,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849488617] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:50:44,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:50:44,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-18 22:50:44,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787380655] [2023-12-18 22:50:44,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:50:44,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-18 22:50:44,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:50:44,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-18 22:50:44,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-18 22:50:44,602 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 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-18 22:50:44,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:50:44,639 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2023-12-18 22:50:44,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-18 22:50:44,641 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-18 22:50:44,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:50:44,646 INFO L225 Difference]: With dead ends: 59 [2023-12-18 22:50:44,646 INFO L226 Difference]: Without dead ends: 28 [2023-12-18 22:50:44,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-18 22:50:44,650 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 22:50:44,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 22:50:44,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-18 22:50:44,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-18 22:50:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 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-18 22:50:44,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-12-18 22:50:44,685 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 9 [2023-12-18 22:50:44,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:50:44,686 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-12-18 22:50:44,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-18 22:50:44,686 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-12-18 22:50:44,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-18 22:50:44,688 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:50:44,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 22:50:44,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-18 22:50:44,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-18 22:50:44,890 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:50:44,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:50:44,890 INFO L85 PathProgramCache]: Analyzing trace with hash 117259837, now seen corresponding path program 1 times [2023-12-18 22:50:44,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:50:44,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569817872] [2023-12-18 22:50:44,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:50:44,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:50:44,901 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-18 22:50:44,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [399411474] [2023-12-18 22:50:44,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:50:44,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:50:44,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:50:44,903 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-18 22:50:44,908 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-18 22:50:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:50:44,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-18 22:50:44,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:50:45,003 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-18 22:50:45,003 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:50:45,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:50:45,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569817872] [2023-12-18 22:50:45,004 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-18 22:50:45,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399411474] [2023-12-18 22:50:45,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399411474] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:50:45,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:50:45,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-18 22:50:45,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913278101] [2023-12-18 22:50:45,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:50:45,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:50:45,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:50:45,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:50:45,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-18 22:50:45,008 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-18 22:50:45,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:50:45,034 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2023-12-18 22:50:45,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:50:45,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-18 22:50:45,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:50:45,035 INFO L225 Difference]: With dead ends: 34 [2023-12-18 22:50:45,035 INFO L226 Difference]: Without dead ends: 29 [2023-12-18 22:50:45,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-18 22:50:45,039 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 22:50:45,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 50 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 22:50:45,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-18 22:50:45,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-18 22:50:45,049 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-18 22:50:45,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-12-18 22:50:45,050 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 9 [2023-12-18 22:50:45,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:50:45,050 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-12-18 22:50:45,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-18 22:50:45,050 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-12-18 22:50:45,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-18 22:50:45,051 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:50:45,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 22:50:45,056 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-18 22:50:45,251 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,SelfDestructingSolverStorable1 [2023-12-18 22:50:45,252 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:50:45,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:50:45,252 INFO L85 PathProgramCache]: Analyzing trace with hash -603037507, now seen corresponding path program 1 times [2023-12-18 22:50:45,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:50:45,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955936171] [2023-12-18 22:50:45,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:50:45,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:50:45,265 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-18 22:50:45,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [742717905] [2023-12-18 22:50:45,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:50:45,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:50:45,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:50:45,267 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-18 22:50:45,288 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-18 22:50:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:50:45,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-18 22:50:45,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:50:45,347 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-18 22:50:45,347 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 22:50:45,367 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-18 22:50:45,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:50:45,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955936171] [2023-12-18 22:50:45,367 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-18 22:50:45,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742717905] [2023-12-18 22:50:45,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742717905] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 22:50:45,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-18 22:50:45,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2023-12-18 22:50:45,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678778154] [2023-12-18 22:50:45,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-18 22:50:45,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-18 22:50:45,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:50:45,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-18 22:50:45,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-18 22:50:45,369 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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-18 22:50:45,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:50:45,407 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2023-12-18 22:50:45,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-18 22:50:45,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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-18 22:50:45,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:50:45,410 INFO L225 Difference]: With dead ends: 34 [2023-12-18 22:50:45,410 INFO L226 Difference]: Without dead ends: 30 [2023-12-18 22:50:45,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-18 22:50:45,416 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-18 22:50:45,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-18 22:50:45,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-18 22:50:45,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-18 22:50:45,421 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-18 22:50:45,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2023-12-18 22:50:45,422 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2023-12-18 22:50:45,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:50:45,423 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2023-12-18 22:50:45,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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-18 22:50:45,423 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2023-12-18 22:50:45,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-18 22:50:45,423 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:50:45,423 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 22:50:45,432 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-18 22:50:45,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:50:45,624 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:50:45,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:50:45,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1514676993, now seen corresponding path program 2 times [2023-12-18 22:50:45,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:50:45,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871510445] [2023-12-18 22:50:45,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:50:45,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:50:45,640 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-18 22:50:45,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [848235910] [2023-12-18 22:50:45,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-18 22:50:45,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:50:45,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:50:45,644 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 22:50:45,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-18 22:50:48,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-18 22:50:48,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-18 22:50:48,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-18 22:50:48,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:50:59,628 WARN L293 SmtUtils]: Spent 6.90s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-18 22:51:12,805 WARN L293 SmtUtils]: Spent 5.18s 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-18 22:51:24,816 WARN L293 SmtUtils]: Spent 8.01s 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-18 22:51:32,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-18 22:51:32,068 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 22:52:01,597 WARN L293 SmtUtils]: Spent 5.26s 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-18 22:52:58,782 WARN L293 SmtUtils]: Spent 5.27s 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-18 22:53:32,327 WARN L293 SmtUtils]: Spent 5.35s 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-18 22:53:41,889 WARN L293 SmtUtils]: Spent 5.48s 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-18 22:54:00,637 WARN L293 SmtUtils]: Spent 7.40s 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-18 22:54:44,067 WARN L293 SmtUtils]: Spent 5.04s 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-18 22:55:06,379 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse26 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse28 (mod (+ .cse26 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse27 (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse19 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 0))) (.cse21 (= .cse27 0)) (.cse23 (= .cse28 0)) (.cse24 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0))) (.cse9 (< 0 .cse25))) (let ((.cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0))) (.cse0 (< .cse28 128)) (.cse10 (< 127 .cse28)) (.cse5 (< .cse27 128)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse12 (or .cse23 .cse24 .cse9)) (.cse13 (or .cse19 .cse21 .cse9)) (.cse1 (< 127 .cse27)) (.cse14 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse15 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse27)) 256) 0))) (.cse16 (mod .cse26 256))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse16)) 256) 0)) (< |c_ULTIMATE.start_gcd_test_~a#1| 0)))) (let ((.cse4 (or .cse14 (and (or .cse15 .cse9) .cse7))) (.cse3 (or (and .cse7 .cse13) .cse14))) (and (or .cse0 (let ((.cse2 (or .cse6 (and .cse7 (or .cse8 .cse9))))) (and (or .cse1 (and .cse2 .cse3)) (or (and .cse4 .cse2) .cse5)))) (or .cse10 (let ((.cse11 (or (and .cse7 .cse12) .cse6))) (and (or .cse5 (and .cse11 .cse4)) (or (and .cse11 .cse3) .cse1))))))) (< .cse16 128)) (or (< 127 .cse16) (let ((.cse20 (= .cse26 0))) (let ((.cse18 (or (and (<= .cse25 0) (not .cse20)) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse16) 256) 0)) (= .cse16 0)))) (let ((.cse22 (or .cse14 (and .cse18 (or .cse20 .cse15 .cse9))))) (and (or (let ((.cse17 (or (and .cse18 (or .cse20 .cse8 .cse9)) .cse6))) (and (or .cse1 (and .cse17 (or .cse14 (and .cse18 (or .cse19 .cse20 .cse21 .cse9))))) (or (and .cse17 .cse22) .cse5))) .cse0) (or .cse10 (and (or (and (or (and (or .cse20 .cse23 .cse24 .cse9) .cse18) .cse6) .cse22) .cse5) (or (and (or .cse6 (and .cse18 .cse12)) (or (and .cse13 .cse18) .cse14)) .cse1))))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from false [2023-12-18 22:55:55,794 WARN L293 SmtUtils]: Spent 20.15s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-18 22:56:23,184 WARN L293 SmtUtils]: Spent 7.38s 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-18 22:56:36,105 WARN L293 SmtUtils]: Spent 6.91s 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-18 22:56:43,114 WARN L293 SmtUtils]: Spent 6.31s 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-18 22:57:33,366 WARN L293 SmtUtils]: Spent 28.52s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-18 22:57:41,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-18 22:57:41,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:57:41,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871510445] [2023-12-18 22:57:41,250 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-18 22:57:41,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848235910] [2023-12-18 22:57:41,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848235910] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 22:57:41,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-18 22:57:41,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2023-12-18 22:57:41,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550057544] [2023-12-18 22:57:41,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-18 22:57:41,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-18 22:57:41,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:57:41,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-18 22:57:41,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=98, Unknown=9, NotChecked=20, Total=156 [2023-12-18 22:57:41,252 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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-18 22:57:42,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-18 22:58:17,810 WARN L293 SmtUtils]: Spent 30.63s on a formula simplification. DAG size of input: 45 DAG size of output: 28 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-18 22:59:45,747 WARN L293 SmtUtils]: Spent 1.23m on a formula simplification. DAG size of input: 83 DAG size of output: 32 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-18 22:59:49,806 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 [] [2023-12-18 22:59:53,821 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (and (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse0 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (and (let ((.cse1 (mod (mod .cse0 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (< 127 .cse0) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse1) 256) 0)) (= .cse1 0))) (let ((.cse2 (mod (+ .cse0 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (< .cse0 128) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse2 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) (= .cse2 0))))) (< 0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (< |c_ULTIMATE.start_main1_~y~0#1| 1)) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (or (let ((.cse12 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse12 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse10 (< .cse16 128)) (.cse11 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse16)) 256) 0))) (.cse4 (< 127 .cse16)) (.cse7 (= .cse16 0)) (.cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse16) 256) 0))) (.cse9 (< 0 .cse15)) (.cse13 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse3 (mod .cse12 256))) (and (or (< 127 .cse3) (let ((.cse5 (or .cse13 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse3) 256) 0)) (= .cse3 0))) (.cse6 (= .cse12 0))) (and (or .cse4 (and .cse5 (or .cse6 .cse7 .cse8 .cse9))) (or .cse10 (and .cse5 (or .cse6 .cse11 .cse9)))))) (or (let ((.cse14 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse3)) 256) 0)) .cse13))) (and (or .cse10 (and .cse14 (or .cse11 .cse9))) (or .cse4 (and .cse14 (or .cse7 .cse8 .cse9))))) (< .cse3 128)))))) (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (let ((.cse18 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (or (and (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (exists ((v_y_1 Int)) (let ((.cse17 (* 256 v_y_1))) (and (<= 0 (+ .cse17 .cse18 128)) (<= (+ .cse17 .cse18 1) 0) (= (mod (+ .cse17 .cse18) |c_ULTIMATE.start_gcd_test_~b#1|) 0))))) (and (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (exists ((v_y_3 Int)) (let ((.cse19 (* 256 v_y_3))) (and (<= (+ 65281 .cse18 .cse19) 0) (= (mod (+ 65280 .cse18 .cse19) |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 65408 .cse18 .cse19))))) (<= .cse15 0)))) (<= 1 |c_ULTIMATE.start_gcd_test_~b#1|))) is different from false [2023-12-18 23:00:01,507 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse29 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (let ((.cse25 (<= .cse29 0))) (and (or (let ((.cse26 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod (+ .cse26 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse27 (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse19 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 0))) (.cse21 (= .cse27 0)) (.cse23 (= .cse28 0)) (.cse24 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0))) (.cse9 (< 0 .cse29))) (let ((.cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0))) (.cse0 (< .cse28 128)) (.cse10 (< 127 .cse28)) (.cse5 (< .cse27 128)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse12 (or .cse23 .cse24 .cse9)) (.cse13 (or .cse19 .cse21 .cse9)) (.cse1 (< 127 .cse27)) (.cse14 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse15 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse27)) 256) 0))) (.cse16 (mod .cse26 256))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse16)) 256) 0)) (< |c_ULTIMATE.start_gcd_test_~a#1| 0)))) (let ((.cse4 (or .cse14 (and (or .cse15 .cse9) .cse7))) (.cse3 (or (and .cse7 .cse13) .cse14))) (and (or .cse0 (let ((.cse2 (or .cse6 (and .cse7 (or .cse8 .cse9))))) (and (or .cse1 (and .cse2 .cse3)) (or (and .cse4 .cse2) .cse5)))) (or .cse10 (let ((.cse11 (or (and .cse7 .cse12) .cse6))) (and (or .cse5 (and .cse11 .cse4)) (or (and .cse11 .cse3) .cse1))))))) (< .cse16 128)) (or (< 127 .cse16) (let ((.cse20 (= .cse26 0))) (let ((.cse18 (or (and .cse25 (not .cse20)) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse16) 256) 0)) (= .cse16 0)))) (let ((.cse22 (or .cse14 (and .cse18 (or .cse20 .cse15 .cse9))))) (and (or (let ((.cse17 (or (and .cse18 (or .cse20 .cse8 .cse9)) .cse6))) (and (or .cse1 (and .cse17 (or .cse14 (and .cse18 (or .cse19 .cse20 .cse21 .cse9))))) (or (and .cse17 .cse22) .cse5))) .cse0) (or .cse10 (and (or (and (or (and (or .cse20 .cse23 .cse24 .cse9) .cse18) .cse6) .cse22) .cse5) (or (and (or .cse6 (and .cse18 .cse12)) (or (and .cse13 .cse18) .cse14)) .cse1))))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (let ((.cse31 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (or (and (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (exists ((v_y_1 Int)) (let ((.cse30 (* 256 v_y_1))) (and (<= 0 (+ .cse30 .cse31 128)) (<= (+ .cse30 .cse31 1) 0) (= (mod (+ .cse30 .cse31) |c_ULTIMATE.start_gcd_test_~b#1|) 0))))) (and (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (exists ((v_y_3 Int)) (let ((.cse32 (* 256 v_y_3))) (and (<= (+ 65281 .cse31 .cse32) 0) (= (mod (+ 65280 .cse31 .cse32) |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 65408 .cse31 .cse32))))) .cse25))) (<= 1 |c_ULTIMATE.start_gcd_test_~b#1|)))) is different from false [2023-12-18 23:00:09,176 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse25 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse26 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (= .cse26 0)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse30 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse9 (< 0 .cse25)) (.cse29 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or (let ((.cse28 (mod (+ .cse26 .cse29) 256)) (.cse27 (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse19 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 0))) (.cse21 (= .cse27 0)) (.cse23 (= .cse28 0)) (.cse24 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0)))) (let ((.cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0))) (.cse0 (< .cse28 128)) (.cse10 (< 127 .cse28)) (.cse5 (< .cse27 128)) (.cse12 (or .cse23 .cse24 .cse9)) (.cse13 (or .cse19 .cse21 .cse9)) (.cse1 (< 127 .cse27)) (.cse14 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse15 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse27)) 256) 0))) (.cse16 (mod .cse26 256))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse16)) 256) 0)) (< |c_ULTIMATE.start_gcd_test_~a#1| 0)))) (let ((.cse4 (or .cse14 (and (or .cse15 .cse9) .cse7))) (.cse3 (or (and .cse7 .cse13) .cse14))) (and (or .cse0 (let ((.cse2 (or .cse6 (and .cse7 (or .cse8 .cse9))))) (and (or .cse1 (and .cse2 .cse3)) (or (and .cse4 .cse2) .cse5)))) (or .cse10 (let ((.cse11 (or (and .cse7 .cse12) .cse6))) (and (or .cse5 (and .cse11 .cse4)) (or (and .cse11 .cse3) .cse1))))))) (< .cse16 128)) (or (< 127 .cse16) (let ((.cse18 (or (and (<= .cse25 0) (not .cse20)) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse16) 256) 0)) (= .cse16 0)))) (let ((.cse22 (or .cse14 (and .cse18 (or .cse20 .cse15 .cse9))))) (and (or (let ((.cse17 (or (and .cse18 (or .cse20 .cse8 .cse9)) .cse6))) (and (or .cse1 (and .cse17 (or .cse14 (and .cse18 (or .cse19 .cse20 .cse21 .cse9))))) (or (and .cse17 .cse22) .cse5))) .cse0) (or .cse10 (and (or (and (or (and (or .cse20 .cse23 .cse24 .cse9) .cse18) .cse6) .cse22) .cse5) (or (and (or .cse6 (and .cse18 .cse12)) (or (and .cse13 .cse18) .cse14)) .cse1))))))))))) .cse30) (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse31 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (and (let ((.cse32 (mod (mod .cse31 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (< 127 .cse31) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse32) 256) 0)) (= .cse32 0))) (let ((.cse33 (mod (+ .cse31 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (< .cse31 128) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse33 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) (= .cse33 0))))) (< 0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (< |c_ULTIMATE.start_main1_~y~0#1| 1)) .cse20 (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (or .cse6 .cse30 .cse9 (let ((.cse34 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse35 (mod (mod .cse34 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< 127 .cse34) (= 0 .cse35) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse35) 256) 0)))) (let ((.cse36 (mod (+ .cse34 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse36 .cse29) 256))) 256) 0)) (= .cse36 0) (< .cse34 128)))))) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (<= 1 |c_ULTIMATE.start_gcd_test_~b#1|)))) is different from false [2023-12-18 23:00:13,186 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse25 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse26 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (= .cse26 0)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse30 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse9 (< 0 .cse25)) (.cse29 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or (let ((.cse28 (mod (+ .cse26 .cse29) 256)) (.cse27 (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse19 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 0))) (.cse21 (= .cse27 0)) (.cse23 (= .cse28 0)) (.cse24 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0)))) (let ((.cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0))) (.cse0 (< .cse28 128)) (.cse10 (< 127 .cse28)) (.cse5 (< .cse27 128)) (.cse12 (or .cse23 .cse24 .cse9)) (.cse13 (or .cse19 .cse21 .cse9)) (.cse1 (< 127 .cse27)) (.cse14 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse15 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse27)) 256) 0))) (.cse16 (mod .cse26 256))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse16)) 256) 0)) (< |c_ULTIMATE.start_gcd_test_~a#1| 0)))) (let ((.cse4 (or .cse14 (and (or .cse15 .cse9) .cse7))) (.cse3 (or (and .cse7 .cse13) .cse14))) (and (or .cse0 (let ((.cse2 (or .cse6 (and .cse7 (or .cse8 .cse9))))) (and (or .cse1 (and .cse2 .cse3)) (or (and .cse4 .cse2) .cse5)))) (or .cse10 (let ((.cse11 (or (and .cse7 .cse12) .cse6))) (and (or .cse5 (and .cse11 .cse4)) (or (and .cse11 .cse3) .cse1))))))) (< .cse16 128)) (or (< 127 .cse16) (let ((.cse18 (or (and (<= .cse25 0) (not .cse20)) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse16) 256) 0)) (= .cse16 0)))) (let ((.cse22 (or .cse14 (and .cse18 (or .cse20 .cse15 .cse9))))) (and (or (let ((.cse17 (or (and .cse18 (or .cse20 .cse8 .cse9)) .cse6))) (and (or .cse1 (and .cse17 (or .cse14 (and .cse18 (or .cse19 .cse20 .cse21 .cse9))))) (or (and .cse17 .cse22) .cse5))) .cse0) (or .cse10 (and (or (and (or (and (or .cse20 .cse23 .cse24 .cse9) .cse18) .cse6) .cse22) .cse5) (or (and (or .cse6 (and .cse18 .cse12)) (or (and .cse13 .cse18) .cse14)) .cse1))))))))))) .cse30) (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse31 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (and (let ((.cse32 (mod (mod .cse31 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (< 127 .cse31) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse32) 256) 0)) (= .cse32 0))) (let ((.cse33 (mod (+ .cse31 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (< .cse31 128) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse33 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) (= .cse33 0))))) (< 0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (< |c_ULTIMATE.start_main1_~y~0#1| 1)) .cse20 (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (or .cse6 .cse30 .cse9 (let ((.cse34 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse35 (mod (mod .cse34 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< 127 .cse34) (= 0 .cse35) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse35) 256) 0)))) (let ((.cse36 (mod (+ .cse34 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse36 .cse29) 256))) 256) 0)) (= .cse36 0) (< .cse34 128)))))) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (<= 1 |c_ULTIMATE.start_gcd_test_~b#1|)))) is different from true [2023-12-18 23:00:52,077 WARN L293 SmtUtils]: Spent 32.00s on a formula simplification. DAG size of input: 58 DAG size of output: 49 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-18 23:00:53,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-18 23:00:57,912 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 [] [2023-12-18 23:00:59,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-18 23:01:03,678 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod .cse15 256))) (let ((.cse2 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse6 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse17 (= .cse7 0)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or .cse0 .cse1 .cse2 (let ((.cse3 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse4 (mod (mod .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< 127 .cse3) (= 0 .cse4) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 0)))) (let ((.cse5 (mod (+ .cse3 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse5 .cse6) 256))) 256) 0)) (= .cse5 0) (< .cse3 128)))))) (or (let ((.cse19 (mod (+ .cse15 .cse6) 256))) (let ((.cse13 (< .cse19 128)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse19)) 256) 0))) (.cse8 (< 127 .cse19)) (.cse11 (= .cse19 0)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0))) (.cse16 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (and (or (< 127 .cse7) (let ((.cse9 (or .cse16 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 0)) .cse17)) (.cse10 (= .cse15 0))) (and (or .cse8 (and .cse9 (or .cse10 .cse11 .cse12 .cse2))) (or .cse13 (and .cse9 (or .cse10 .cse14 .cse2)))))) (or (let ((.cse18 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse7)) 256) 0)) .cse16))) (and (or .cse13 (and .cse18 (or .cse14 .cse2))) (or .cse8 (and .cse18 (or .cse11 .cse12 .cse2))))) (< .cse7 128))))) .cse0 .cse1) (or (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (< (+ |c_ULTIMATE.start_gcd_test_~a#1| 128) 0)) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (not .cse17) (< (+ |c_ULTIMATE.start_gcd_test_~b#1| 128) 0) .cse1))))) is different from false [2023-12-18 23:01:07,684 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse15 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod .cse15 256))) (let ((.cse2 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse6 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse17 (= .cse7 0)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or .cse0 .cse1 .cse2 (let ((.cse3 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse4 (mod (mod .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< 127 .cse3) (= 0 .cse4) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 0)))) (let ((.cse5 (mod (+ .cse3 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse5 .cse6) 256))) 256) 0)) (= .cse5 0) (< .cse3 128)))))) (or (let ((.cse19 (mod (+ .cse15 .cse6) 256))) (let ((.cse13 (< .cse19 128)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse19)) 256) 0))) (.cse8 (< 127 .cse19)) (.cse11 (= .cse19 0)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0))) (.cse16 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (and (or (< 127 .cse7) (let ((.cse9 (or .cse16 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 0)) .cse17)) (.cse10 (= .cse15 0))) (and (or .cse8 (and .cse9 (or .cse10 .cse11 .cse12 .cse2))) (or .cse13 (and .cse9 (or .cse10 .cse14 .cse2)))))) (or (let ((.cse18 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse7)) 256) 0)) .cse16))) (and (or .cse13 (and .cse18 (or .cse14 .cse2))) (or .cse8 (and .cse18 (or .cse11 .cse12 .cse2))))) (< .cse7 128))))) .cse0 .cse1) (or (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (< (+ |c_ULTIMATE.start_gcd_test_~a#1| 128) 0)) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (not .cse17) (< (+ |c_ULTIMATE.start_gcd_test_~b#1| 128) 0) .cse1))))) is different from true [2023-12-18 23:01:11,821 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 [] [2023-12-18 23:01:16,309 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod .cse15 256))) (let ((.cse2 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse6 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse17 (= .cse7 0)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or .cse0 .cse1 .cse2 (let ((.cse3 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse4 (mod (mod .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< 127 .cse3) (= 0 .cse4) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 0)))) (let ((.cse5 (mod (+ .cse3 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse5 .cse6) 256))) 256) 0)) (= .cse5 0) (< .cse3 128)))))) (or (let ((.cse19 (mod (+ .cse15 .cse6) 256))) (let ((.cse13 (< .cse19 128)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse19)) 256) 0))) (.cse8 (< 127 .cse19)) (.cse11 (= .cse19 0)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0))) (.cse16 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (and (or (< 127 .cse7) (let ((.cse9 (or .cse16 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 0)) .cse17)) (.cse10 (= .cse15 0))) (and (or .cse8 (and .cse9 (or .cse10 .cse11 .cse12 .cse2))) (or .cse13 (and .cse9 (or .cse10 .cse14 .cse2)))))) (or (let ((.cse18 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse7)) 256) 0)) .cse16))) (and (or .cse13 (and .cse18 (or .cse14 .cse2))) (or .cse8 (and .cse18 (or .cse11 .cse12 .cse2))))) (< .cse7 128))))) .cse0 .cse1) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (not .cse17) (< (+ |c_ULTIMATE.start_gcd_test_~b#1| 128) 0) .cse1))))) is different from false [2023-12-18 23:01:20,316 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse15 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod .cse15 256))) (let ((.cse2 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse6 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse17 (= .cse7 0)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or .cse0 .cse1 .cse2 (let ((.cse3 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse4 (mod (mod .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< 127 .cse3) (= 0 .cse4) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 0)))) (let ((.cse5 (mod (+ .cse3 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse5 .cse6) 256))) 256) 0)) (= .cse5 0) (< .cse3 128)))))) (or (let ((.cse19 (mod (+ .cse15 .cse6) 256))) (let ((.cse13 (< .cse19 128)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse19)) 256) 0))) (.cse8 (< 127 .cse19)) (.cse11 (= .cse19 0)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0))) (.cse16 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (and (or (< 127 .cse7) (let ((.cse9 (or .cse16 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 0)) .cse17)) (.cse10 (= .cse15 0))) (and (or .cse8 (and .cse9 (or .cse10 .cse11 .cse12 .cse2))) (or .cse13 (and .cse9 (or .cse10 .cse14 .cse2)))))) (or (let ((.cse18 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse7)) 256) 0)) .cse16))) (and (or .cse13 (and .cse18 (or .cse14 .cse2))) (or .cse8 (and .cse18 (or .cse11 .cse12 .cse2))))) (< .cse7 128))))) .cse0 .cse1) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (not .cse17) (< (+ |c_ULTIMATE.start_gcd_test_~b#1| 128) 0) .cse1))))) is different from true [2023-12-18 23:01:24,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-18 23:01:24,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:01:24,605 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2023-12-18 23:01:24,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-18 23:01:24,605 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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-18 23:01:24,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:01:24,606 INFO L225 Difference]: With dead ends: 40 [2023-12-18 23:01:24,606 INFO L226 Difference]: Without dead ends: 31 [2023-12-18 23:01:24,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 321.0s TimeCoverageRelationStatistics Valid=56, Invalid=159, Unknown=19, NotChecked=186, Total=420 [2023-12-18 23:01:24,607 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 22.3s IncrementalHoareTripleChecker+Time [2023-12-18 23:01:24,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 230 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 4 Unknown, 54 Unchecked, 22.3s Time] [2023-12-18 23:01:24,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-18 23:01:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-18 23:01:24,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 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-18 23:01:24,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-12-18 23:01:24,614 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 11 [2023-12-18 23:01:24,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:01:24,614 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-12-18 23:01:24,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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-18 23:01:24,615 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-12-18 23:01:24,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-18 23:01:24,615 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:01:24,615 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 23:01:24,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-18 23:01:24,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:01:24,816 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:01:24,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:01:24,817 INFO L85 PathProgramCache]: Analyzing trace with hash 969328383, now seen corresponding path program 1 times [2023-12-18 23:01:24,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:01:24,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127031177] [2023-12-18 23:01:24,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:01:24,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:01:24,829 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-18 23:01:24,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [272391607] [2023-12-18 23:01:24,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:01:24,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:01:24,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 23:01:24,834 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-18 23:01:24,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-18 23:01:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 23:01:24,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-18 23:01:24,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 23:01:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-18 23:01:25,098 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 23:01:30,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-18 23:01:30,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 23:01:30,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127031177] [2023-12-18 23:01:30,921 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-18 23:01:30,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272391607] [2023-12-18 23:01:30,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272391607] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-18 23:01:30,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 23:01:30,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-12-18 23:01:30,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544741312] [2023-12-18 23:01:30,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 23:01:30,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-18 23:01:30,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 23:01:30,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-18 23:01:30,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-12-18 23:01:30,922 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-18 23:01:31,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 23:01:31,046 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2023-12-18 23:01:31,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-18 23:01:31,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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 12 [2023-12-18 23:01:31,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 23:01:31,055 INFO L225 Difference]: With dead ends: 31 [2023-12-18 23:01:31,055 INFO L226 Difference]: Without dead ends: 20 [2023-12-18 23:01:31,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-12-18 23:01:31,056 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-18 23:01:31,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-18 23:01:31,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-18 23:01:31,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-18 23:01:31,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 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-18 23:01:31,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-12-18 23:01:31,060 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2023-12-18 23:01:31,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 23:01:31,061 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-12-18 23:01:31,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-18 23:01:31,061 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-12-18 23:01:31,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-18 23:01:31,062 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 23:01:31,062 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 23:01:31,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-18 23:01:31,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 23:01:31,268 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 23:01:31,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 23:01:31,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1757426221, now seen corresponding path program 1 times [2023-12-18 23:01:31,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 23:01:31,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180158617] [2023-12-18 23:01:31,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 23:01:31,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 23:01:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-18 23:01:31,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-18 23:01:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-18 23:01:31,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-18 23:01:31,309 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-18 23:01:31,310 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-18 23:01:31,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-18 23:01:31,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-18 23:01:31,314 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2023-12-18 23:01:31,318 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-18 23:01:31,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:01:31 BoogieIcfgContainer [2023-12-18 23:01:31,345 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-18 23:01:31,345 INFO L158 Benchmark]: Toolchain (without parser) took 647837.70ms. Allocated memory is still 295.7MB. Free memory was 239.3MB in the beginning and 217.5MB in the end (delta: 21.8MB). Peak memory consumption was 22.1MB. Max. memory is 8.0GB. [2023-12-18 23:01:31,346 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 177.2MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-18 23:01:31,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.88ms. Allocated memory is still 295.7MB. Free memory was 239.3MB in the beginning and 227.1MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-18 23:01:31,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.39ms. Allocated memory is still 295.7MB. Free memory was 227.1MB in the beginning and 225.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-18 23:01:31,346 INFO L158 Benchmark]: Boogie Preprocessor took 32.80ms. Allocated memory is still 295.7MB. Free memory was 225.3MB in the beginning and 223.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-18 23:01:31,346 INFO L158 Benchmark]: RCFGBuilder took 421.56ms. Allocated memory is still 295.7MB. Free memory was 222.9MB in the beginning and 209.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-18 23:01:31,347 INFO L158 Benchmark]: TraceAbstraction took 647115.11ms. Allocated memory is still 295.7MB. Free memory was 208.6MB in the beginning and 217.5MB in the end (delta: -9.0MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-18 23:01:31,348 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.10ms. Allocated memory is still 177.2MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 220.88ms. Allocated memory is still 295.7MB. Free memory was 239.3MB in the beginning and 227.1MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.39ms. Allocated memory is still 295.7MB. Free memory was 227.1MB in the beginning and 225.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.80ms. Allocated memory is still 295.7MB. Free memory was 225.3MB in the beginning and 223.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 421.56ms. Allocated memory is still 295.7MB. Free memory was 222.9MB in the beginning and 209.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 647115.11ms. Allocated memory is still 295.7MB. Free memory was 208.6MB in the beginning and 217.5MB in the end (delta: -9.0MB). There was no memory consumed. 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 - UnprovableResult [Line: 102]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryArithmeticFLOAToperation at line 97. Possible FailurePath: [L108] COND FALSE !(__VERIFIER_nondet_int()) [L111] CALL main2() [L90] float IN = __VERIFIER_nondet_float(); [L91] CALL assume_abort_if_not(IN > -1.4f && IN < 1.4f) [L75] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L91] RET assume_abort_if_not(IN > -1.4f && IN < 1.4f) [L93] CALL, EXPR f(IN) VAL [\old(x)=112] [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; [L93] RET, EXPR f(IN) VAL [IN=112] [L93] CALL, EXPR fp(IN) VAL [\old(x)=112] [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; [L93] RET, EXPR fp(IN) VAL [IN=112] [L93] float x = IN - f(IN)/fp(IN); [L95] CALL, EXPR f(x) VAL [\old(x)=115] [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; [L95] RET, EXPR f(x) VAL [IN=112, x=115] [L95] CALL, EXPR fp(x) VAL [\old(x)=115] [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; [L95] RET, EXPR fp(x) VAL [IN=112, x=115] [L95] x = x - f(x)/fp(x) [L97] CALL, EXPR f(x) VAL [\old(x)=111] [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; [L97] RET, EXPR f(x) VAL [IN=112, x=111] [L97] CALL, EXPR fp(x) VAL [\old(x)=111] [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; [L97] RET, EXPR fp(x) VAL [IN=112, x=111] [L97] x = x - f(x)/fp(x) [L101] COND TRUE !(x < 0.1) VAL [IN=112] [L102] reach_error() VAL [IN=112] - UnprovableResult [Line: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 647.0s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 223.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 22.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 476 SdHoareTripleChecker+Invalid, 22.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 54 IncrementalHoareTripleChecker+Unchecked, 343 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 134 IncrementalHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 133 mSDtfsCounter, 134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 323.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 26, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 419.0s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 76 ConstructedInterpolants, 4 QuantifiedInterpolants, 2536 SizeOfPredicates, 20 NumberOfNonLiveVariables, 413 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 13/20 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: unable to determine feasibility of some traces [2023-12-18 23:01:31,555 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-18 23:01:31,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...