./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/bitvector/gcd_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c4f91361 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/bitvector/gcd_2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7da096d64cf3390a2bb7c442378ab6f697dfdf0fd9d4078975ad6171409858bb --- Real Ultimate output --- This is Ultimate 0.2.3-dev-c4f9136-m [2023-11-23 15:00:32,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 15:00:32,897 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 15:00:32,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 15:00:32,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 15:00:32,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 15:00:32,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 15:00:32,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 15:00:32,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 15:00:32,941 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 15:00:32,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 15:00:32,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 15:00:32,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 15:00:32,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 15:00:32,944 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 15:00:32,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 15:00:32,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 15:00:32,945 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 15:00:32,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 15:00:32,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 15:00:32,946 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 15:00:32,946 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 15:00:32,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 15:00:32,947 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 15:00:32,947 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 15:00:32,947 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 15:00:32,947 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 15:00:32,948 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 15:00:32,948 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 15:00:32,948 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 15:00:32,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 15:00:32,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 15:00:32,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 15:00:32,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 15:00:32,950 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 15:00:32,950 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 15:00:32,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 15:00:32,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 15:00:32,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 15:00:32,951 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 15:00:32,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 15:00:32,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 15:00:32,952 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7da096d64cf3390a2bb7c442378ab6f697dfdf0fd9d4078975ad6171409858bb [2023-11-23 15:00:33,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 15:00:33,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 15:00:33,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 15:00:33,248 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 15:00:33,249 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 15:00:33,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/gcd_2.c [2023-11-23 15:00:34,421 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 15:00:34,612 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 15:00:34,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/gcd_2.c [2023-11-23 15:00:34,619 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b21158b3b/2254ccffc8834f4b99e64570b427bf14/FLAG6880c0e42 [2023-11-23 15:00:34,634 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b21158b3b/2254ccffc8834f4b99e64570b427bf14 [2023-11-23 15:00:34,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 15:00:34,638 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 15:00:34,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 15:00:34,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 15:00:34,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 15:00:34,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:00:34" (1/1) ... [2023-11-23 15:00:34,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e0e30af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:34, skipping insertion in model container [2023-11-23 15:00:34,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:00:34" (1/1) ... [2023-11-23 15:00:34,669 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 15:00:34,782 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/gcd_2.c[664,677] [2023-11-23 15:00:34,796 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 15:00:34,804 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 15:00:34,813 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/gcd_2.c[664,677] [2023-11-23 15:00:34,817 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 15:00:34,830 INFO L206 MainTranslator]: Completed translation [2023-11-23 15:00:34,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:34 WrapperNode [2023-11-23 15:00:34,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 15:00:34,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 15:00:34,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 15:00:34,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 15:00:34,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:34" (1/1) ... [2023-11-23 15:00:34,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:34" (1/1) ... [2023-11-23 15:00:34,862 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2023-11-23 15:00:34,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 15:00:34,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 15:00:34,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 15:00:34,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 15:00:34,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:34" (1/1) ... [2023-11-23 15:00:34,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:34" (1/1) ... [2023-11-23 15:00:34,875 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:34" (1/1) ... [2023-11-23 15:00:34,890 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-11-23 15:00:34,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:34" (1/1) ... [2023-11-23 15:00:34,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:34" (1/1) ... [2023-11-23 15:00:34,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:34" (1/1) ... [2023-11-23 15:00:34,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:34" (1/1) ... [2023-11-23 15:00:34,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:34" (1/1) ... [2023-11-23 15:00:34,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:34" (1/1) ... [2023-11-23 15:00:34,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 15:00:34,905 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 15:00:34,905 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 15:00:34,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 15:00:34,906 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:34" (1/1) ... [2023-11-23 15:00:34,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 15:00:34,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:00:34,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 15:00:34,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 15:00:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 15:00:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 15:00:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 15:00:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 15:00:34,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 15:00:35,044 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 15:00:35,046 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 15:00:35,156 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 15:00:35,182 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 15:00:35,182 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 15:00:35,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:00:35 BoogieIcfgContainer [2023-11-23 15:00:35,183 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 15:00:35,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 15:00:35,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 15:00:35,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 15:00:35,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:00:34" (1/3) ... [2023-11-23 15:00:35,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13fafcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:00:35, skipping insertion in model container [2023-11-23 15:00:35,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:34" (2/3) ... [2023-11-23 15:00:35,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13fafcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:00:35, skipping insertion in model container [2023-11-23 15:00:35,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:00:35" (3/3) ... [2023-11-23 15:00:35,191 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2.c [2023-11-23 15:00:35,216 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 15:00:35,217 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 15:00:35,275 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 15:00:35,281 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;@5d0470e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 15:00:35,281 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 15:00:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 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-11-23 15:00:35,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-23 15:00:35,299 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:00:35,300 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:00:35,300 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 15:00:35,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:00:35,305 INFO L85 PathProgramCache]: Analyzing trace with hash -898167638, now seen corresponding path program 1 times [2023-11-23 15:00:35,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:00:35,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994082102] [2023-11-23 15:00:35,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:00:35,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:00:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:00:35,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:00:35,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:00:35,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994082102] [2023-11-23 15:00:35,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994082102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:00:35,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:00:35,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 15:00:35,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240672949] [2023-11-23 15:00:35,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:00:35,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 15:00:35,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:00:35,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 15:00:35,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 15:00:35,589 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 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) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-23 15:00:35,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:00:35,679 INFO L93 Difference]: Finished difference Result 27 states and 40 transitions. [2023-11-23 15:00:35,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 15:00:35,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2023-11-23 15:00:35,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:00:35,689 INFO L225 Difference]: With dead ends: 27 [2023-11-23 15:00:35,690 INFO L226 Difference]: Without dead ends: 11 [2023-11-23 15:00:35,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:00:35,696 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:00:35,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 17 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:00:35,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-11-23 15:00:35,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2023-11-23 15:00:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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-11-23 15:00:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2023-11-23 15:00:35,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 8 [2023-11-23 15:00:35,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:00:35,720 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2023-11-23 15:00:35,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-23 15:00:35,721 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2023-11-23 15:00:35,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-23 15:00:35,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:00:35,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:00:35,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 15:00:35,722 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 15:00:35,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:00:35,722 INFO L85 PathProgramCache]: Analyzing trace with hash -840909336, now seen corresponding path program 1 times [2023-11-23 15:00:35,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:00:35,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955282186] [2023-11-23 15:00:35,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:00:35,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:00:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:00:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:00:35,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:00:35,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955282186] [2023-11-23 15:00:35,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955282186] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:00:35,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:00:35,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 15:00:35,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027621806] [2023-11-23 15:00:35,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:00:35,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 15:00:35,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:00:35,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 15:00:35,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 15:00:35,798 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-23 15:00:35,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:00:35,818 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2023-11-23 15:00:35,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 15:00:35,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2023-11-23 15:00:35,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:00:35,819 INFO L225 Difference]: With dead ends: 15 [2023-11-23 15:00:35,819 INFO L226 Difference]: Without dead ends: 10 [2023-11-23 15:00:35,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:00:35,821 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 15:00:35,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 12 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 15:00:35,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-11-23 15:00:35,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-11-23 15:00:35,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-11-23 15:00:35,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-11-23 15:00:35,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2023-11-23 15:00:35,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:00:35,824 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-11-23 15:00:35,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-23 15:00:35,825 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-11-23 15:00:35,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-23 15:00:35,825 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:00:35,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:00:35,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 15:00:35,826 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 15:00:35,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:00:35,826 INFO L85 PathProgramCache]: Analyzing trace with hash -268269848, now seen corresponding path program 1 times [2023-11-23 15:00:35,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:00:35,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920015484] [2023-11-23 15:00:35,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:00:35,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:00:35,838 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-23 15:00:35,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1256902587] [2023-11-23 15:00:35,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:00:35,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:00:35,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:00:35,840 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-11-23 15:00:35,853 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-11-23 15:00:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:00:35,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 15:00:35,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:00:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:00:35,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:00:35,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:00:35,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:00:35,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920015484] [2023-11-23 15:00:35,996 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-23 15:00:35,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256902587] [2023-11-23 15:00:35,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256902587] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:00:35,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 15:00:35,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2023-11-23 15:00:35,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587449725] [2023-11-23 15:00:35,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 15:00:35,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 15:00:35,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:00:35,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 15:00:35,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 15:00:35,999 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-11-23 15:00:36,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:00:36,068 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2023-11-23 15:00:36,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 15:00:36,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-11-23 15:00:36,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:00:36,069 INFO L225 Difference]: With dead ends: 16 [2023-11-23 15:00:36,069 INFO L226 Difference]: Without dead ends: 11 [2023-11-23 15:00:36,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 15:00:36,070 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:00:36,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 19 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:00:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-11-23 15:00:36,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-11-23 15:00:36,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11-23 15:00:36,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2023-11-23 15:00:36,074 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2023-11-23 15:00:36,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:00:36,074 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2023-11-23 15:00:36,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-11-23 15:00:36,075 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2023-11-23 15:00:36,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-23 15:00:36,075 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:00:36,075 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:00:36,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 15:00:36,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:00:36,289 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 15:00:36,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:00:36,290 INFO L85 PathProgramCache]: Analyzing trace with hash 303685096, now seen corresponding path program 2 times [2023-11-23 15:00:36,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:00:36,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562409977] [2023-11-23 15:00:36,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:00:36,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:00:36,300 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-23 15:00:36,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1007570909] [2023-11-23 15:00:36,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 15:00:36,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:00:36,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:00:36,312 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-11-23 15:00:36,315 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-11-23 15:00:36,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 15:00:36,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 15:00:36,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-23 15:00:36,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:01:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:01:03,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:01:45,797 WARN L293 SmtUtils]: Spent 6.73s on a formula simplification that was a NOOP. DAG size: 109 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-23 15:02:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:02:00,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:02:00,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562409977] [2023-11-23 15:02:00,272 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-23 15:02:00,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007570909] [2023-11-23 15:02:00,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007570909] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:02:00,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 15:02:00,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-11-23 15:02:00,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307728200] [2023-11-23 15:02:00,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 15:02:00,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-23 15:02:00,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:02:00,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-23 15:02:00,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=175, Unknown=13, NotChecked=0, Total=240 [2023-11-23 15:02:00,281 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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-11-23 15:02:02,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-23 15:02:04,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-23 15:02:13,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-23 15:02:16,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-23 15:02:29,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-23 15:02:31,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-23 15:02:34,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-23 15:02:34,136 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~y~0#1| 1)) (.cse14 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (let ((.cse0 (< |c_ULTIMATE.start_main_~y~0#1| 1)) (.cse11 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse5 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse40 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse41 (mod (+ .cse40 .cse14) 256))) (or (< (mod .cse40 256) 128) (< (mod (+ .cse40 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse41) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse41) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|) (< .cse41 .cse1) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (.cse2 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse38 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse39 (mod (+ .cse38 .cse14) 256))) (or (< (mod (+ .cse38 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse39) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse39) 256) 0)) (< 127 (mod .cse38 256)) (< .cse39 .cse1) (= .cse38 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|)))) (.cse3 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse36 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse37 (mod .cse36 256))) (or (< (mod (+ .cse36 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse37) 256) 0)) (< 127 (mod (+ .cse36 .cse14) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse37) (< .cse37 .cse1))))) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|)))) (.cse4 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse35 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse34 (mod .cse35 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse34) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse34) (< 127 (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|) (< (mod (+ .cse35 .cse14) 256) 128) (< .cse34 .cse1)))))) (.cse9 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse32 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod .cse32 256))) (or (< (mod (+ .cse32 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse33) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse33) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|) (< (mod (+ .cse32 .cse14) 256) 128) (< .cse33 .cse1)))))) (.cse7 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod .cse31 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse30) 256) 0)) (< 127 (mod (+ .cse31 .cse14) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse30) (< 127 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse30 .cse1))))) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|)))) (.cse8 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod (+ .cse29 .cse14) 256))) (or (< 127 .cse28) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse28) 256) 0)) (< 127 (mod .cse29 256)) (< 127 (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse28 .cse1) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|)))) (.cse10 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse6 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse26 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod (+ .cse26 .cse14) 256))) (or (< (mod .cse26 256) 128) (< 127 .cse27) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse27) 256) 0)) (< 127 (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|) (< .cse27 .cse1) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (and (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 256) 0)) .cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| .cse1)) (or (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) .cse0 (< |c_ULTIMATE.start_gcd_test_~a#1| .cse1)) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse0 .cse11) (or .cse0 .cse11 (let ((.cse15 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1)))) (and (or .cse10 .cse5) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse12 .cse1) (< 127 (mod (+ .cse13 .cse14) 256)) (< 127 (mod .cse13 256)) (< 127 .cse12) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse12) 256) 0)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|))) .cse7) .cse15) (or (and .cse2 .cse3) .cse10) (or .cse15 .cse9) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse16 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod .cse16 256))) (or (< (mod (+ .cse16 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse17) 256) 0)) (< 127 (mod (+ .cse16 .cse14) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse17) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|) (< .cse17 .cse1))))) .cse15) (or .cse4 .cse10) (or .cse10 .cse9) (or .cse15 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse19 (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse18 256) 128) (< .cse19 .cse1) (< 127 (mod (+ .cse18 .cse14) 256)) (< 127 .cse19) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse19) 256) 0)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (or .cse15 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse20 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse21 (mod (+ .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse20 256) 128) (< .cse21 .cse1) (< 127 .cse21) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse21) 256) 0)) (< (mod (+ .cse20 .cse14) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (or .cse10 (and .cse7 .cse8)) (or .cse15 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse23 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod (+ .cse23 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse22 .cse1) (< 127 (mod .cse23 256)) (< 127 .cse22) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse22) 256) 0)) (< (mod (+ .cse23 .cse14) 256) 128) (= .cse23 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod .cse25 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse24) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse24) (< 127 (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse25 .cse14) 256) 128) (< .cse24 .cse1))))) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse10 .cse6))))))) is different from false [2023-11-23 15:02:36,146 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~y~0#1| 1)) (.cse14 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (let ((.cse0 (< |c_ULTIMATE.start_main_~y~0#1| 1)) (.cse11 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse5 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse40 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse41 (mod (+ .cse40 .cse14) 256))) (or (< (mod .cse40 256) 128) (< (mod (+ .cse40 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse41) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse41) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|) (< .cse41 .cse1) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (.cse2 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse38 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse39 (mod (+ .cse38 .cse14) 256))) (or (< (mod (+ .cse38 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse39) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse39) 256) 0)) (< 127 (mod .cse38 256)) (< .cse39 .cse1) (= .cse38 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|)))) (.cse3 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse36 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse37 (mod .cse36 256))) (or (< (mod (+ .cse36 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse37) 256) 0)) (< 127 (mod (+ .cse36 .cse14) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse37) (< .cse37 .cse1))))) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|)))) (.cse4 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse35 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse34 (mod .cse35 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse34) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse34) (< 127 (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|) (< (mod (+ .cse35 .cse14) 256) 128) (< .cse34 .cse1)))))) (.cse9 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse32 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod .cse32 256))) (or (< (mod (+ .cse32 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse33) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse33) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|) (< (mod (+ .cse32 .cse14) 256) 128) (< .cse33 .cse1)))))) (.cse7 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod .cse31 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse30) 256) 0)) (< 127 (mod (+ .cse31 .cse14) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse30) (< 127 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse30 .cse1))))) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|)))) (.cse8 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod (+ .cse29 .cse14) 256))) (or (< 127 .cse28) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse28) 256) 0)) (< 127 (mod .cse29 256)) (< 127 (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse28 .cse1) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|)))) (.cse10 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse6 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse26 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod (+ .cse26 .cse14) 256))) (or (< (mod .cse26 256) 128) (< 127 .cse27) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse27) 256) 0)) (< 127 (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|) (< .cse27 .cse1) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (and (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 256) 0)) .cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| .cse1)) (or (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) .cse0 (< |c_ULTIMATE.start_gcd_test_~a#1| .cse1)) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse0 .cse11) (or .cse0 .cse11 (let ((.cse15 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1)))) (and (or .cse10 .cse5) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse12 .cse1) (< 127 (mod (+ .cse13 .cse14) 256)) (< 127 (mod .cse13 256)) (< 127 .cse12) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse12) 256) 0)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|))) .cse7) .cse15) (or (and .cse2 .cse3) .cse10) (or .cse15 .cse9) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse16 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod .cse16 256))) (or (< (mod (+ .cse16 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse17) 256) 0)) (< 127 (mod (+ .cse16 .cse14) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse17) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|) (< .cse17 .cse1))))) .cse15) (or .cse4 .cse10) (or .cse10 .cse9) (or .cse15 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse19 (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse18 256) 128) (< .cse19 .cse1) (< 127 (mod (+ .cse18 .cse14) 256)) (< 127 .cse19) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse19) 256) 0)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (or .cse15 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse20 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse21 (mod (+ .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse20 256) 128) (< .cse21 .cse1) (< 127 .cse21) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse21) 256) 0)) (< (mod (+ .cse20 .cse14) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (or .cse10 (and .cse7 .cse8)) (or .cse15 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse23 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod (+ .cse23 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse22 .cse1) (< 127 (mod .cse23 256)) (< 127 .cse22) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse22) 256) 0)) (< (mod (+ .cse23 .cse14) 256) 128) (= .cse23 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod .cse25 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| .cse24) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse24) (< 127 (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse25 .cse14) 256) 128) (< .cse24 .cse1))))) (< |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse10 .cse6))))))) is different from true [2023-11-23 15:03:03,774 WARN L293 SmtUtils]: Spent 15.80s on a formula simplification. DAG size of input: 117 DAG size of output: 322 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-23 15:03:03,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:03:03,847 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2023-11-23 15:03:03,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 15:03:03,848 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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 10 [2023-11-23 15:03:03,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:03:03,849 INFO L225 Difference]: With dead ends: 24 [2023-11-23 15:03:03,849 INFO L226 Difference]: Without dead ends: 15 [2023-11-23 15:03:03,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 98.1s TimeCoverageRelationStatistics Valid=104, Invalid=341, Unknown=21, NotChecked=40, Total=506 [2023-11-23 15:03:03,850 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 13 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2023-11-23 15:03:03,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 28 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 76 Invalid, 8 Unknown, 41 Unchecked, 17.5s Time] [2023-11-23 15:03:03,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-23 15:03:03,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-11-23 15:03:03,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:03:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2023-11-23 15:03:03,858 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2023-11-23 15:03:03,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:03:03,858 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2023-11-23 15:03:03,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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-11-23 15:03:03,859 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2023-11-23 15:03:03,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-23 15:03:03,859 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:03:03,859 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:03:03,872 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-11-23 15:03:04,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-11-23 15:03:04,065 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 15:03:04,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:03:04,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1865686504, now seen corresponding path program 3 times [2023-11-23 15:03:04,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:03:04,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323963349] [2023-11-23 15:03:04,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:03:04,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:03:04,073 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-23 15:03:04,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1418055994] [2023-11-23 15:03:04,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 15:03:04,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:03:04,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:03:04,075 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-11-23 15:03:04,076 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-11-23 15:03:04,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-23 15:03:04,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 15:03:04,258 WARN L260 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-23 15:03:04,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:04:33,100 WARN L293 SmtUtils]: Spent 12.47s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-23 15:05:10,157 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse13 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (let ((.cse6 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse5 (mod .cse13 256)) (.cse4 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (or (and (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse3 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main_~y~0#1|) 256))) (let ((.cse2 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse3) 256))) (let ((.cse1 (mod (mod .cse3 .cse2) 256))) (let ((.cse0 (mod (mod .cse2 .cse1) 256))) (and (not (= .cse0 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_25|) (<= |c_ULTIMATE.start_main_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= (mod (mod .cse1 .cse0) 256) |c_ULTIMATE.start_gcd_test_~a#1|))))))) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|) 0))) .cse4 (<= 128 .cse5) (<= .cse6 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse11 (mod .cse12 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse10 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main_~y~0#1|) 256))) (let ((.cse9 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse10) 256))) (let ((.cse8 (mod (mod .cse10 .cse9) 256))) (let ((.cse7 (mod (mod .cse9 .cse8) 256))) (and (not (= .cse7 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_25|) (<= |c_ULTIMATE.start_main_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse7 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= (mod (mod .cse8 .cse7) 256) |c_ULTIMATE.start_gcd_test_~a#1|))))))) (= .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse12) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (<= 128 (mod (+ .cse12 .cse13) 256)) (<= .cse11 127))))))) (and (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0) (let ((.cse15 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse23 (* |c_ULTIMATE.start_main_~y~0#1| 255))) (or (and (<= 128 .cse6) (<= .cse5 127) .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse22 (+ (- 256) (mod (+ .cse23 .cse18) 256)))) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse22))) (let ((.cse20 (mod .cse21 256))) (let ((.cse19 (+ (- 256) (mod (+ (* 255 .cse21) (mod .cse22 .cse20)) 256)))) (let ((.cse17 (mod .cse20 .cse19))) (let ((.cse14 (mod .cse17 256))) (let ((.cse16 (mod .cse19 .cse14))) (and (<= .cse14 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= .cse15 (mod (+ .cse16 (* 255 .cse17)) 256)) (<= |c_ULTIMATE.start_main_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_25| 1) 0) (not (= .cse14 0)) (not (= .cse18 0)) (not (= .cse16 0)))))))))))) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|) 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse33 (mod .cse24 256))) (and (<= (mod (+ .cse24 .cse13) 256) 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse32 (+ (- 256) (mod (+ .cse23 .cse28) 256)))) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse32))) (let ((.cse30 (mod .cse31 256))) (let ((.cse29 (+ (- 256) (mod (+ (* 255 .cse31) (mod .cse32 .cse30)) 256)))) (let ((.cse27 (mod .cse30 .cse29))) (let ((.cse25 (mod .cse27 256))) (let ((.cse26 (mod .cse29 .cse25))) (and (<= .cse25 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= .cse15 (mod (+ .cse26 (* 255 .cse27)) 256)) (<= |c_ULTIMATE.start_main_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_25| 1) 0) (not (= .cse25 0)) (not (= .cse28 0)) (not (= .cse26 0)))))))))))) (= .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse24) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (<= .cse33 127))))))))))) (<= 0 |c_ULTIMATE.start_main_~y~0#1|) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (<= |c_ULTIMATE.start_main_~y~0#1| 127) (not (= |c_ULTIMATE.start_main_~y~0#1| 0))) is different from false Killed by 15