./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.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 0d29c75fd5928e2fd79a32667a60cd8af89d36d3bace71f12987f1807282a833 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 12:58:13,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 12:58:13,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 12:58:13,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 12:58:13,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 12:58:13,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 12:58:13,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 12:58:13,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 12:58:13,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 12:58:13,903 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 12:58:13,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 12:58:13,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 12:58:13,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 12:58:13,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 12:58:13,904 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 12:58:13,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 12:58:13,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 12:58:13,905 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 12:58:13,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 12:58:13,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 12:58:13,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 12:58:13,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 12:58:13,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 12:58:13,908 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 12:58:13,908 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 12:58:13,908 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 12:58:13,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 12:58:13,908 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 12:58:13,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 12:58:13,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 12:58:13,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 12:58:13,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 12:58:13,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 12:58:13,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 12:58:13,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 12:58:13,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 12:58:13,910 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 12:58:13,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 12:58:13,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 12:58:13,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 12:58:13,911 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 12:58:13,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 12:58:13,912 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 -> 0d29c75fd5928e2fd79a32667a60cd8af89d36d3bace71f12987f1807282a833 [2024-11-18 12:58:14,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 12:58:14,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 12:58:14,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 12:58:14,128 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 12:58:14,128 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 12:58:14,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c [2024-11-18 12:58:15,478 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 12:58:15,620 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 12:58:15,621 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c [2024-11-18 12:58:15,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feda69a93/0f38930d65fe4f5180e55d849aad971e/FLAG4ecb3ae04 [2024-11-18 12:58:15,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feda69a93/0f38930d65fe4f5180e55d849aad971e [2024-11-18 12:58:15,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 12:58:15,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 12:58:15,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 12:58:15,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 12:58:15,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 12:58:15,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:58:15" (1/1) ... [2024-11-18 12:58:15,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c6bdc99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:15, skipping insertion in model container [2024-11-18 12:58:15,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:58:15" (1/1) ... [2024-11-18 12:58:15,671 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 12:58:15,833 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c[614,627] [2024-11-18 12:58:15,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 12:58:15,867 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 12:58:15,876 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c[614,627] [2024-11-18 12:58:15,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 12:58:15,900 INFO L204 MainTranslator]: Completed translation [2024-11-18 12:58:15,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:15 WrapperNode [2024-11-18 12:58:15,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 12:58:15,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 12:58:15,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 12:58:15,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 12:58:15,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:15" (1/1) ... [2024-11-18 12:58:15,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:15" (1/1) ... [2024-11-18 12:58:15,934 INFO L138 Inliner]: procedures = 18, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 202 [2024-11-18 12:58:15,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 12:58:15,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 12:58:15,935 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 12:58:15,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 12:58:15,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:15" (1/1) ... [2024-11-18 12:58:15,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:15" (1/1) ... [2024-11-18 12:58:15,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:15" (1/1) ... [2024-11-18 12:58:15,966 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-18 12:58:15,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:15" (1/1) ... [2024-11-18 12:58:15,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:15" (1/1) ... [2024-11-18 12:58:15,973 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:15" (1/1) ... [2024-11-18 12:58:15,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:15" (1/1) ... [2024-11-18 12:58:15,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:15" (1/1) ... [2024-11-18 12:58:15,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:15" (1/1) ... [2024-11-18 12:58:15,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 12:58:15,987 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 12:58:15,987 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 12:58:15,987 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 12:58:15,988 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:15" (1/1) ... [2024-11-18 12:58:15,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 12:58:16,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:58:16,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 12:58:16,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 12:58:16,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 12:58:16,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 12:58:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 12:58:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 12:58:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 12:58:16,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 12:58:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 12:58:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 12:58:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_0 [2024-11-18 12:58:16,095 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_0 [2024-11-18 12:58:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_1 [2024-11-18 12:58:16,095 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_1 [2024-11-18 12:58:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 12:58:16,198 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 12:58:16,200 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 12:58:16,467 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-18 12:58:16,468 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 12:58:16,485 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 12:58:16,487 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-18 12:58:16,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:58:16 BoogieIcfgContainer [2024-11-18 12:58:16,487 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 12:58:16,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 12:58:16,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 12:58:16,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 12:58:16,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:58:15" (1/3) ... [2024-11-18 12:58:16,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c713562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:58:16, skipping insertion in model container [2024-11-18 12:58:16,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:58:15" (2/3) ... [2024-11-18 12:58:16,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c713562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:58:16, skipping insertion in model container [2024-11-18 12:58:16,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:58:16" (3/3) ... [2024-11-18 12:58:16,495 INFO L112 eAbstractionObserver]: Analyzing ICFG color-sendmoremoney.c [2024-11-18 12:58:16,508 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 12:58:16,508 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 12:58:16,568 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 12:58:16,577 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@69152983, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 12:58:16,578 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 12:58:16,582 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-18 12:58:16,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-18 12:58:16,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:16,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:16,591 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:16,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:16,596 INFO L85 PathProgramCache]: Analyzing trace with hash -871385011, now seen corresponding path program 1 times [2024-11-18 12:58:16,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:16,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859973598] [2024-11-18 12:58:16,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:16,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:16,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 12:58:16,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:16,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859973598] [2024-11-18 12:58:16,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859973598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:16,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:16,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 12:58:16,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353235540] [2024-11-18 12:58:16,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:16,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 12:58:16,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:16,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 12:58:16,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 12:58:16,925 INFO L87 Difference]: Start difference. First operand has 58 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:16,985 INFO L93 Difference]: Finished difference Result 113 states and 156 transitions. [2024-11-18 12:58:16,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 12:58:16,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-18 12:58:16,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:17,016 INFO L225 Difference]: With dead ends: 113 [2024-11-18 12:58:17,017 INFO L226 Difference]: Without dead ends: 58 [2024-11-18 12:58:17,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 12:58:17,027 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:17,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 287 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:17,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-18 12:58:17,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-18 12:58:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-18 12:58:17,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2024-11-18 12:58:17,110 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 27 [2024-11-18 12:58:17,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:17,110 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2024-11-18 12:58:17,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:17,111 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2024-11-18 12:58:17,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-18 12:58:17,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:17,115 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:17,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 12:58:17,115 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:17,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:17,116 INFO L85 PathProgramCache]: Analyzing trace with hash 373379470, now seen corresponding path program 1 times [2024-11-18 12:58:17,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:17,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727446794] [2024-11-18 12:58:17,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:17,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 12:58:17,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:17,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727446794] [2024-11-18 12:58:17,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727446794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:17,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:17,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 12:58:17,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353782333] [2024-11-18 12:58:17,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:17,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 12:58:17,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:17,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 12:58:17,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:17,288 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:17,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:17,320 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2024-11-18 12:58:17,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 12:58:17,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-18 12:58:17,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:17,321 INFO L225 Difference]: With dead ends: 62 [2024-11-18 12:58:17,321 INFO L226 Difference]: Without dead ends: 58 [2024-11-18 12:58:17,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:17,323 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:17,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-18 12:58:17,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-18 12:58:17,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-18 12:58:17,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2024-11-18 12:58:17,336 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 27 [2024-11-18 12:58:17,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:17,337 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2024-11-18 12:58:17,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:17,337 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2024-11-18 12:58:17,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-18 12:58:17,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:17,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:17,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 12:58:17,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:17,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:17,340 INFO L85 PathProgramCache]: Analyzing trace with hash 373319888, now seen corresponding path program 1 times [2024-11-18 12:58:17,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:17,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440486829] [2024-11-18 12:58:17,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:17,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:17,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 12:58:17,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:17,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440486829] [2024-11-18 12:58:17,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440486829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:17,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:17,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 12:58:17,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561650844] [2024-11-18 12:58:17,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:17,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 12:58:17,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:17,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 12:58:17,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 12:58:17,386 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:17,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:17,397 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2024-11-18 12:58:17,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 12:58:17,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-18 12:58:17,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:17,398 INFO L225 Difference]: With dead ends: 63 [2024-11-18 12:58:17,399 INFO L226 Difference]: Without dead ends: 58 [2024-11-18 12:58:17,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 12:58:17,400 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:17,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:17,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-18 12:58:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-18 12:58:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-18 12:58:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2024-11-18 12:58:17,410 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 27 [2024-11-18 12:58:17,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:17,411 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2024-11-18 12:58:17,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:17,412 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2024-11-18 12:58:17,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-18 12:58:17,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:17,413 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:17,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 12:58:17,413 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:17,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:17,414 INFO L85 PathProgramCache]: Analyzing trace with hash 489413935, now seen corresponding path program 1 times [2024-11-18 12:58:17,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:17,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49479320] [2024-11-18 12:58:17,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:17,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:17,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 12:58:17,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:17,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49479320] [2024-11-18 12:58:17,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49479320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:17,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:17,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 12:58:17,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335003223] [2024-11-18 12:58:17,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:17,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 12:58:17,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:17,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 12:58:17,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 12:58:17,491 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:17,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:17,509 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2024-11-18 12:58:17,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 12:58:17,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-18 12:58:17,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:17,511 INFO L225 Difference]: With dead ends: 72 [2024-11-18 12:58:17,512 INFO L226 Difference]: Without dead ends: 65 [2024-11-18 12:58:17,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 12:58:17,514 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 7 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:17,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 132 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:17,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-18 12:58:17,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2024-11-18 12:58:17,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-18 12:58:17,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-11-18 12:58:17,526 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 30 [2024-11-18 12:58:17,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:17,526 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-11-18 12:58:17,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:17,527 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-11-18 12:58:17,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-18 12:58:17,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:17,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:17,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 12:58:17,529 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:17,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:17,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1188806749, now seen corresponding path program 1 times [2024-11-18 12:58:17,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:17,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602856678] [2024-11-18 12:58:17,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:17,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 12:58:17,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:17,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602856678] [2024-11-18 12:58:17,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602856678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:17,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:17,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 12:58:17,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692391943] [2024-11-18 12:58:17,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:17,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 12:58:17,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:17,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 12:58:17,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:17,608 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:17,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:17,631 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2024-11-18 12:58:17,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 12:58:17,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-11-18 12:58:17,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:17,632 INFO L225 Difference]: With dead ends: 75 [2024-11-18 12:58:17,632 INFO L226 Difference]: Without dead ends: 59 [2024-11-18 12:58:17,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:17,634 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 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 [2024-11-18 12:58:17,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:17,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-18 12:58:17,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-18 12:58:17,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-18 12:58:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2024-11-18 12:58:17,640 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 31 [2024-11-18 12:58:17,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:17,640 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2024-11-18 12:58:17,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:17,641 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2024-11-18 12:58:17,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-18 12:58:17,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:17,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:17,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 12:58:17,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:17,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:17,643 INFO L85 PathProgramCache]: Analyzing trace with hash -123550359, now seen corresponding path program 1 times [2024-11-18 12:58:17,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:17,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203381723] [2024-11-18 12:58:17,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:17,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:17,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 12:58:17,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:17,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203381723] [2024-11-18 12:58:17,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203381723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:17,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:17,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 12:58:17,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211566735] [2024-11-18 12:58:17,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:17,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 12:58:17,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:17,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 12:58:17,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:17,722 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 12:58:17,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:17,769 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2024-11-18 12:58:17,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 12:58:17,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-11-18 12:58:17,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:17,771 INFO L225 Difference]: With dead ends: 83 [2024-11-18 12:58:17,771 INFO L226 Difference]: Without dead ends: 59 [2024-11-18 12:58:17,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:17,772 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:17,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:17,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-18 12:58:17,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-18 12:58:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 47 states have internal predecessors, (57), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-18 12:58:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2024-11-18 12:58:17,784 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 37 [2024-11-18 12:58:17,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:17,784 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2024-11-18 12:58:17,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 12:58:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2024-11-18 12:58:17,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-18 12:58:17,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:17,786 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:17,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 12:58:17,786 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:17,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:17,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1299194838, now seen corresponding path program 1 times [2024-11-18 12:58:17,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:17,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231377355] [2024-11-18 12:58:17,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:17,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:17,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-18 12:58:17,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:17,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231377355] [2024-11-18 12:58:17,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231377355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:17,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:17,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 12:58:17,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733649896] [2024-11-18 12:58:17,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:17,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 12:58:17,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:17,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 12:58:17,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:17,870 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 12:58:17,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:17,900 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2024-11-18 12:58:17,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 12:58:17,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-18 12:58:17,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:17,901 INFO L225 Difference]: With dead ends: 87 [2024-11-18 12:58:17,902 INFO L226 Difference]: Without dead ends: 59 [2024-11-18 12:58:17,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:17,903 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:17,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:17,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-18 12:58:17,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-18 12:58:17,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 47 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-18 12:58:17,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2024-11-18 12:58:17,915 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 43 [2024-11-18 12:58:17,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:17,916 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2024-11-18 12:58:17,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 12:58:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2024-11-18 12:58:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-18 12:58:17,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:17,917 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:17,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 12:58:17,917 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:17,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:17,918 INFO L85 PathProgramCache]: Analyzing trace with hash 318580198, now seen corresponding path program 1 times [2024-11-18 12:58:17,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:17,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123564090] [2024-11-18 12:58:17,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:17,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:18,006 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 12:58:18,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:18,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123564090] [2024-11-18 12:58:18,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123564090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:18,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:18,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 12:58:18,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083458943] [2024-11-18 12:58:18,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:18,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 12:58:18,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:18,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 12:58:18,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:18,011 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 12:58:18,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:18,033 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2024-11-18 12:58:18,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 12:58:18,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2024-11-18 12:58:18,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:18,037 INFO L225 Difference]: With dead ends: 91 [2024-11-18 12:58:18,037 INFO L226 Difference]: Without dead ends: 59 [2024-11-18 12:58:18,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:18,038 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:18,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:18,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-18 12:58:18,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-18 12:58:18,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-18 12:58:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2024-11-18 12:58:18,049 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 49 [2024-11-18 12:58:18,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:18,050 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2024-11-18 12:58:18,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 12:58:18,050 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2024-11-18 12:58:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-18 12:58:18,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:18,053 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:18,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 12:58:18,053 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:18,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:18,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1113083677, now seen corresponding path program 1 times [2024-11-18 12:58:18,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:18,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685424918] [2024-11-18 12:58:18,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:18,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:18,111 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-18 12:58:18,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:18,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685424918] [2024-11-18 12:58:18,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685424918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:18,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:18,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 12:58:18,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301426949] [2024-11-18 12:58:18,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:18,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 12:58:18,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:18,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 12:58:18,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:18,113 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 12:58:18,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:18,130 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2024-11-18 12:58:18,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 12:58:18,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-11-18 12:58:18,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:18,134 INFO L225 Difference]: With dead ends: 101 [2024-11-18 12:58:18,134 INFO L226 Difference]: Without dead ends: 59 [2024-11-18 12:58:18,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:18,135 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:18,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:18,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-18 12:58:18,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-18 12:58:18,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-18 12:58:18,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2024-11-18 12:58:18,141 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 55 [2024-11-18 12:58:18,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:18,141 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2024-11-18 12:58:18,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 12:58:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2024-11-18 12:58:18,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-18 12:58:18,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:18,142 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:18,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 12:58:18,143 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:18,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:18,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1508263573, now seen corresponding path program 1 times [2024-11-18 12:58:18,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:18,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493668423] [2024-11-18 12:58:18,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:18,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-18 12:58:18,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:18,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493668423] [2024-11-18 12:58:18,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493668423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:18,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:18,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 12:58:18,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421715229] [2024-11-18 12:58:18,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:18,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 12:58:18,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:18,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 12:58:18,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:18,210 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-18 12:58:18,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:18,231 INFO L93 Difference]: Finished difference Result 105 states and 125 transitions. [2024-11-18 12:58:18,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 12:58:18,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2024-11-18 12:58:18,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:18,232 INFO L225 Difference]: With dead ends: 105 [2024-11-18 12:58:18,233 INFO L226 Difference]: Without dead ends: 59 [2024-11-18 12:58:18,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:18,233 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:18,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:18,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-18 12:58:18,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-18 12:58:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-18 12:58:18,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2024-11-18 12:58:18,240 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 61 [2024-11-18 12:58:18,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:18,240 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2024-11-18 12:58:18,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-18 12:58:18,240 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2024-11-18 12:58:18,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-18 12:58:18,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:18,241 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:18,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 12:58:18,241 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:18,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:18,242 INFO L85 PathProgramCache]: Analyzing trace with hash 92534082, now seen corresponding path program 1 times [2024-11-18 12:58:18,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:18,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173715326] [2024-11-18 12:58:18,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:18,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-18 12:58:18,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:18,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173715326] [2024-11-18 12:58:18,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173715326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:18,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:18,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 12:58:18,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572128168] [2024-11-18 12:58:18,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:18,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 12:58:18,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:18,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 12:58:18,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:18,295 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-18 12:58:18,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:18,310 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2024-11-18 12:58:18,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 12:58:18,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2024-11-18 12:58:18,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:18,311 INFO L225 Difference]: With dead ends: 109 [2024-11-18 12:58:18,311 INFO L226 Difference]: Without dead ends: 59 [2024-11-18 12:58:18,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:18,312 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:18,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:18,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-18 12:58:18,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-11-18 12:58:18,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-18 12:58:18,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2024-11-18 12:58:18,315 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 67 [2024-11-18 12:58:18,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:18,315 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2024-11-18 12:58:18,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-18 12:58:18,315 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2024-11-18 12:58:18,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-18 12:58:18,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:18,316 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:18,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 12:58:18,316 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:18,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:18,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1352872087, now seen corresponding path program 1 times [2024-11-18 12:58:18,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:18,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576013324] [2024-11-18 12:58:18,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:18,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-18 12:58:18,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:18,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576013324] [2024-11-18 12:58:18,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576013324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:18,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:18,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 12:58:18,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001700850] [2024-11-18 12:58:18,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:18,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 12:58:18,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:18,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 12:58:18,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:18,384 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 12:58:18,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:18,395 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2024-11-18 12:58:18,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 12:58:18,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2024-11-18 12:58:18,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:18,396 INFO L225 Difference]: With dead ends: 61 [2024-11-18 12:58:18,396 INFO L226 Difference]: Without dead ends: 55 [2024-11-18 12:58:18,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:18,396 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:18,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:18,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-18 12:58:18,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-18 12:58:18,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-18 12:58:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2024-11-18 12:58:18,400 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 73 [2024-11-18 12:58:18,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:18,401 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-11-18 12:58:18,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 12:58:18,401 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-11-18 12:58:18,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-18 12:58:18,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:18,401 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:18,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 12:58:18,401 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:18,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:18,402 INFO L85 PathProgramCache]: Analyzing trace with hash 453527745, now seen corresponding path program 1 times [2024-11-18 12:58:18,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:18,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235371754] [2024-11-18 12:58:18,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:18,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:18,475 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-18 12:58:18,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:18,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235371754] [2024-11-18 12:58:18,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235371754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:18,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:18,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 12:58:18,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499591117] [2024-11-18 12:58:18,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:18,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 12:58:18,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:18,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 12:58:18,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:18,476 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 12:58:18,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:18,494 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2024-11-18 12:58:18,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 12:58:18,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2024-11-18 12:58:18,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:18,495 INFO L225 Difference]: With dead ends: 76 [2024-11-18 12:58:18,495 INFO L226 Difference]: Without dead ends: 63 [2024-11-18 12:58:18,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:58:18,495 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 8 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:18,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 168 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:18,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-18 12:58:18,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2024-11-18 12:58:18,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 45 states have internal predecessors, (49), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-18 12:58:18,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2024-11-18 12:58:18,498 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 76 [2024-11-18 12:58:18,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:18,498 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2024-11-18 12:58:18,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 12:58:18,498 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2024-11-18 12:58:18,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-18 12:58:18,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:18,499 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:18,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-18 12:58:18,499 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:18,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:18,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1665566163, now seen corresponding path program 1 times [2024-11-18 12:58:18,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:18,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395998024] [2024-11-18 12:58:18,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:18,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:18,545 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-18 12:58:18,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:18,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395998024] [2024-11-18 12:58:18,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395998024] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 12:58:18,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888476744] [2024-11-18 12:58:18,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:18,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:58:18,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:58:18,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 12:58:18,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 12:58:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:18,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 12:58:18,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:58:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-18 12:58:18,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:58:18,788 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-18 12:58:18,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888476744] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:58:18,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 12:58:18,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-11-18 12:58:18,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640491485] [2024-11-18 12:58:18,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 12:58:18,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 12:58:18,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:18,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 12:58:18,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-18 12:58:18,792 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 12:58:18,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:18,927 INFO L93 Difference]: Finished difference Result 107 states and 131 transitions. [2024-11-18 12:58:18,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-18 12:58:18,928 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2024-11-18 12:58:18,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:18,928 INFO L225 Difference]: With dead ends: 107 [2024-11-18 12:58:18,928 INFO L226 Difference]: Without dead ends: 94 [2024-11-18 12:58:18,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2024-11-18 12:58:18,929 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 35 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:18,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 286 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:18,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-18 12:58:18,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2024-11-18 12:58:18,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.077922077922078) internal successors, (83), 77 states have internal predecessors, (83), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-18 12:58:18,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2024-11-18 12:58:18,936 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 79 [2024-11-18 12:58:18,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:18,937 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2024-11-18 12:58:18,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 12:58:18,937 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2024-11-18 12:58:18,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-18 12:58:18,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:18,938 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 6, 6, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:18,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 12:58:19,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-18 12:58:19,139 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:19,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:19,140 INFO L85 PathProgramCache]: Analyzing trace with hash -548194093, now seen corresponding path program 2 times [2024-11-18 12:58:19,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:19,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969835497] [2024-11-18 12:58:19,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 12:58:19,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:19,185 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 12:58:19,185 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:58:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 78 proven. 22 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-18 12:58:19,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:19,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969835497] [2024-11-18 12:58:19,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969835497] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 12:58:19,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456762663] [2024-11-18 12:58:19,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 12:58:19,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:58:19,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:58:19,317 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 12:58:19,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 12:58:19,446 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 12:58:19,446 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:58:19,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 12:58:19,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:58:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 78 proven. 22 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-18 12:58:19,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:58:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 78 proven. 22 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-18 12:58:19,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456762663] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:58:19,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 12:58:19,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-11-18 12:58:19,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033254683] [2024-11-18 12:58:19,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 12:58:19,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-18 12:58:19,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:19,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-18 12:58:19,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=167, Unknown=0, NotChecked=0, Total=272 [2024-11-18 12:58:19,586 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 12:58:19,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:19,719 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2024-11-18 12:58:19,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-18 12:58:19,719 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 111 [2024-11-18 12:58:19,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:19,720 INFO L225 Difference]: With dead ends: 137 [2024-11-18 12:58:19,734 INFO L226 Difference]: Without dead ends: 104 [2024-11-18 12:58:19,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 211 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=358, Unknown=0, NotChecked=0, Total=552 [2024-11-18 12:58:19,735 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 37 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:19,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 662 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 12:58:19,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-18 12:58:19,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-18 12:58:19,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 92 states have (on average 1.065217391304348) internal successors, (98), 92 states have internal predecessors, (98), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-18 12:58:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2024-11-18 12:58:19,740 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 111 [2024-11-18 12:58:19,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:19,740 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2024-11-18 12:58:19,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 12:58:19,741 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2024-11-18 12:58:19,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-18 12:58:19,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:19,742 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 6, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:19,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-18 12:58:19,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-18 12:58:19,943 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:19,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:19,944 INFO L85 PathProgramCache]: Analyzing trace with hash 313659905, now seen corresponding path program 3 times [2024-11-18 12:58:19,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:19,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991878677] [2024-11-18 12:58:19,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 12:58:19,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:20,064 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-18 12:58:20,064 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:58:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-18 12:58:20,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:20,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991878677] [2024-11-18 12:58:20,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991878677] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 12:58:20,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098716259] [2024-11-18 12:58:20,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 12:58:20,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:58:20,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:58:20,143 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) [2024-11-18 12:58:20,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 12:58:20,269 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-18 12:58:20,269 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:58:20,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 12:58:20,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:58:20,308 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-18 12:58:20,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:58:20,380 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-18 12:58:20,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098716259] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 12:58:20,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 12:58:20,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 8 [2024-11-18 12:58:20,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704464363] [2024-11-18 12:58:20,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:20,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 12:58:20,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:20,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 12:58:20,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-18 12:58:20,383 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 12:58:20,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:20,423 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2024-11-18 12:58:20,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 12:58:20,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 126 [2024-11-18 12:58:20,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:20,425 INFO L225 Difference]: With dead ends: 117 [2024-11-18 12:58:20,425 INFO L226 Difference]: Without dead ends: 110 [2024-11-18 12:58:20,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 248 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-18 12:58:20,426 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 8 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:20,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 217 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:58:20,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-18 12:58:20,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-18 12:58:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 99 states have (on average 1.0707070707070707) internal successors, (106), 99 states have internal predecessors, (106), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-18 12:58:20,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2024-11-18 12:58:20,431 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 126 [2024-11-18 12:58:20,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:20,432 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2024-11-18 12:58:20,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 12:58:20,432 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2024-11-18 12:58:20,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-18 12:58:20,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:20,433 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 6, 6, 6, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:20,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-18 12:58:20,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:58:20,638 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:20,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:20,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1299283323, now seen corresponding path program 4 times [2024-11-18 12:58:20,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:20,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397939880] [2024-11-18 12:58:20,639 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-18 12:58:20,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:20,657 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-18 12:58:20,658 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:58:20,773 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 272 proven. 56 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-18 12:58:20,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:20,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397939880] [2024-11-18 12:58:20,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397939880] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 12:58:20,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432345863] [2024-11-18 12:58:20,773 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-18 12:58:20,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:58:20,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:58:20,775 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) [2024-11-18 12:58:20,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 12:58:20,875 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-18 12:58:20,875 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:58:20,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-18 12:58:20,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:58:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 206 proven. 172 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-18 12:58:20,986 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:58:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 225 proven. 153 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-18 12:58:21,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432345863] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:58:21,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 12:58:21,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 26 [2024-11-18 12:58:21,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914456183] [2024-11-18 12:58:21,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 12:58:21,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-18 12:58:21,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:21,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-18 12:58:21,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2024-11-18 12:58:21,289 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 26 states, 26 states have (on average 4.6923076923076925) internal successors, (122), 26 states have internal predecessors, (122), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 12:58:21,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:21,693 INFO L93 Difference]: Finished difference Result 215 states and 248 transitions. [2024-11-18 12:58:21,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-18 12:58:21,694 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.6923076923076925) internal successors, (122), 26 states have internal predecessors, (122), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 133 [2024-11-18 12:58:21,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:21,695 INFO L225 Difference]: With dead ends: 215 [2024-11-18 12:58:21,695 INFO L226 Difference]: Without dead ends: 188 [2024-11-18 12:58:21,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 244 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=713, Invalid=2257, Unknown=0, NotChecked=0, Total=2970 [2024-11-18 12:58:21,697 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 69 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:21,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 539 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 12:58:21,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-18 12:58:21,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 144. [2024-11-18 12:58:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 133 states have (on average 1.0751879699248121) internal successors, (143), 133 states have internal predecessors, (143), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-18 12:58:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2024-11-18 12:58:21,703 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 133 [2024-11-18 12:58:21,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:21,703 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2024-11-18 12:58:21,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.6923076923076925) internal successors, (122), 26 states have internal predecessors, (122), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 12:58:21,703 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2024-11-18 12:58:21,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-18 12:58:21,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:21,704 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 6, 6, 6, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:21,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 12:58:21,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-18 12:58:21,909 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:21,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:21,909 INFO L85 PathProgramCache]: Analyzing trace with hash -251669101, now seen corresponding path program 5 times [2024-11-18 12:58:21,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:21,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169388609] [2024-11-18 12:58:21,910 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-18 12:58:21,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:21,939 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2024-11-18 12:58:21,939 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:58:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 444 proven. 347 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-18 12:58:22,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:58:22,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169388609] [2024-11-18 12:58:22,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169388609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 12:58:22,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674077404] [2024-11-18 12:58:22,155 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-18 12:58:22,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:58:22,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:58:22,157 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) [2024-11-18 12:58:22,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 12:58:22,297 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2024-11-18 12:58:22,297 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:58:22,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-18 12:58:22,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:58:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 431 proven. 357 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-18 12:58:22,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:58:22,573 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 457 proven. 331 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-18 12:58:22,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674077404] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:58:22,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 12:58:22,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2024-11-18 12:58:22,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938212631] [2024-11-18 12:58:22,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 12:58:22,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-18 12:58:22,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:58:22,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-18 12:58:22,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2024-11-18 12:58:22,576 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand has 21 states, 21 states have (on average 5.476190476190476) internal successors, (115), 21 states have internal predecessors, (115), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 12:58:23,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:23,078 INFO L93 Difference]: Finished difference Result 244 states and 269 transitions. [2024-11-18 12:58:23,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-18 12:58:23,079 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.476190476190476) internal successors, (115), 21 states have internal predecessors, (115), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 161 [2024-11-18 12:58:23,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:23,084 INFO L225 Difference]: With dead ends: 244 [2024-11-18 12:58:23,084 INFO L226 Difference]: Without dead ends: 161 [2024-11-18 12:58:23,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 309 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=706, Invalid=1946, Unknown=0, NotChecked=0, Total=2652 [2024-11-18 12:58:23,086 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 30 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:23,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 577 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 12:58:23,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-18 12:58:23,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-18 12:58:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 150 states have (on average 1.0666666666666667) internal successors, (160), 150 states have internal predecessors, (160), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-18 12:58:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 176 transitions. [2024-11-18 12:58:23,094 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 176 transitions. Word has length 161 [2024-11-18 12:58:23,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:23,095 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 176 transitions. [2024-11-18 12:58:23,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.476190476190476) internal successors, (115), 21 states have internal predecessors, (115), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 12:58:23,095 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 176 transitions. [2024-11-18 12:58:23,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-18 12:58:23,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:23,096 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 7, 7, 7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:23,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 12:58:23,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-18 12:58:23,297 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:23,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:23,298 INFO L85 PathProgramCache]: Analyzing trace with hash 773529361, now seen corresponding path program 6 times [2024-11-18 12:58:23,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:58:23,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228686895] [2024-11-18 12:58:23,298 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-18 12:58:23,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:58:23,535 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2024-11-18 12:58:23,535 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-18 12:58:23,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 12:58:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 12:58:23,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 12:58:23,623 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 12:58:23,628 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 12:58:23,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-18 12:58:23,635 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:23,689 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 12:58:23,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 12:58:23 BoogieIcfgContainer [2024-11-18 12:58:23,691 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 12:58:23,692 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 12:58:23,692 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 12:58:23,692 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 12:58:23,692 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:58:16" (3/4) ... [2024-11-18 12:58:23,693 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-18 12:58:23,757 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 12:58:23,757 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 12:58:23,757 INFO L158 Benchmark]: Toolchain (without parser) took 8114.33ms. Allocated memory was 201.3MB in the beginning and 371.2MB in the end (delta: 169.9MB). Free memory was 128.7MB in the beginning and 146.3MB in the end (delta: -17.5MB). Peak memory consumption was 152.5MB. Max. memory is 16.1GB. [2024-11-18 12:58:23,757 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 160.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 12:58:23,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.77ms. Allocated memory is still 201.3MB. Free memory was 128.5MB in the beginning and 115.2MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 12:58:23,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.12ms. Allocated memory is still 201.3MB. Free memory was 115.2MB in the beginning and 113.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 12:58:23,758 INFO L158 Benchmark]: Boogie Preprocessor took 47.30ms. Allocated memory is still 201.3MB. Free memory was 112.8MB in the beginning and 110.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 12:58:23,758 INFO L158 Benchmark]: RCFGBuilder took 500.70ms. Allocated memory is still 201.3MB. Free memory was 110.4MB in the beginning and 148.6MB in the end (delta: -38.3MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-11-18 12:58:23,758 INFO L158 Benchmark]: TraceAbstraction took 7202.51ms. Allocated memory was 201.3MB in the beginning and 371.2MB in the end (delta: 169.9MB). Free memory was 147.9MB in the beginning and 152.6MB in the end (delta: -4.6MB). Peak memory consumption was 166.0MB. Max. memory is 16.1GB. [2024-11-18 12:58:23,759 INFO L158 Benchmark]: Witness Printer took 65.05ms. Allocated memory is still 371.2MB. Free memory was 152.6MB in the beginning and 146.3MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 12:58:23,760 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.14ms. Allocated memory is still 201.3MB. Free memory is still 160.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.77ms. Allocated memory is still 201.3MB. Free memory was 128.5MB in the beginning and 115.2MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.12ms. Allocated memory is still 201.3MB. Free memory was 115.2MB in the beginning and 113.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.30ms. Allocated memory is still 201.3MB. Free memory was 112.8MB in the beginning and 110.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 500.70ms. Allocated memory is still 201.3MB. Free memory was 110.4MB in the beginning and 148.6MB in the end (delta: -38.3MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7202.51ms. Allocated memory was 201.3MB in the beginning and 371.2MB in the end (delta: 169.9MB). Free memory was 147.9MB in the beginning and 152.6MB in the end (delta: -4.6MB). Peak memory consumption was 166.0MB. Max. memory is 16.1GB. * Witness Printer took 65.05ms. Allocated memory is still 371.2MB. Free memory was 152.6MB in the beginning and 146.3MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L58] int s, e, n, d, m, o, r, y; [L59] s = __VERIFIER_nondet_int() [L60] e = __VERIFIER_nondet_int() [L61] n = __VERIFIER_nondet_int() [L62] d = __VERIFIER_nondet_int() [L63] m = __VERIFIER_nondet_int() [L64] o = __VERIFIER_nondet_int() [L65] r = __VERIFIER_nondet_int() [L66] y = __VERIFIER_nondet_int() [L67] CALL, EXPR solve(s, e, n, d, m, o, r, y) [L46] CALL, EXPR check_domain_1(S) VAL [\old(x)=9] [L32] COND TRUE x >= 1 && x <= 9 [L32] return 1; VAL [\old(x)=9, \result=1] [L46] RET, EXPR check_domain_1(S) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] CALL, EXPR check_domain_0(E) VAL [\old(x)=5] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=5, \result=1] [L46] RET, EXPR check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] CALL, EXPR check_domain_0(N) VAL [\old(x)=6] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=6, \result=1] [L46] RET, EXPR check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_0(D) VAL [\old(x)=7] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=7, \result=1] [L47] RET, EXPR check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_1(M) VAL [\old(x)=1] [L32] COND TRUE x >= 1 && x <= 9 [L32] return 1; VAL [\old(x)=1, \result=1] [L47] RET, EXPR check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_0(O) VAL [\old(x)=0] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=0, \result=1] [L47] RET, EXPR check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L48] CALL, EXPR check_domain_0(R) VAL [\old(x)=8] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=8, \result=1] [L48] RET, EXPR check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L48] CALL, EXPR check_domain_0(Y) VAL [\old(x)=2] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=2, \result=1] [L48] RET, EXPR check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L51] CALL, EXPR check_diff(S, E, N, D, M, O, R, Y) [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L38] int i = 0; VAL [d={10:0}, i=0] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=0, j=1] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=0] [L38] i++ VAL [d={10:0}, i=1] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=1, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=1] [L38] i++ VAL [d={10:0}, i=2] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=2, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=2] [L38] i++ VAL [d={10:0}, i=3] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=3, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=3] [L38] i++ VAL [d={10:0}, i=4] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=4, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=4, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=4, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=4, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=4] [L38] i++ VAL [d={10:0}, i=5] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=5, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=5, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=5, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=5] [L38] i++ VAL [d={10:0}, i=6] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=6, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=6, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=6] [L38] i++ VAL [d={10:0}, i=7] [L38] COND FALSE !(i < 7) VAL [d={10:0}] [L42] return 1; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L42] return 1; VAL [\result=1] [L51] RET, EXPR check_diff(S, E, N, D, M, O, R, Y) [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L46-L51] COND TRUE check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L52] return 1; VAL [\result=1] [L67] RET, EXPR solve(s, e, n, d, m, o, r, y) [L67] CALL __VERIFIER_assert(!solve(s, e, n, d, m, o, r, y)) [L18] COND TRUE !(cond) [L20] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 19, TraceHistogramMax: 28, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 194 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 4715 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3532 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 681 IncrementalHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 1183 mSDtfsCounter, 681 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1385 GetRequests, 1191 SyntacticMatches, 19 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1823 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=18, InterpolantAutomatonStates: 166, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 68 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2007 NumberOfCodeBlocks, 1861 NumberOfCodeBlocksAsserted, 112 NumberOfCheckSat, 2405 ConstructedInterpolants, 0 QuantifiedInterpolants, 3540 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1658 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 5112/6605 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 proved your program to be incorrect! [2024-11-18 12:58:23,807 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE